./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_string_eq_c_str_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_string_eq_c_str_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b64b813c3d856efe8cd859d380d09d4b682c371a0a165a5a5fe0d11dc206dad7 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 03:23:49,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 03:23:49,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 03:23:49,104 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 03:23:49,105 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 03:23:49,108 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 03:23:49,109 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 03:23:49,111 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 03:23:49,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 03:23:49,116 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 03:23:49,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 03:23:49,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 03:23:49,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 03:23:49,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 03:23:49,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 03:23:49,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 03:23:49,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 03:23:49,124 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 03:23:49,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 03:23:49,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 03:23:49,132 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 03:23:49,132 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 03:23:49,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 03:23:49,134 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 03:23:49,139 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 03:23:49,139 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 03:23:49,139 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 03:23:49,140 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 03:23:49,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 03:23:49,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 03:23:49,142 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 03:23:49,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 03:23:49,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 03:23:49,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 03:23:49,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 03:23:49,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 03:23:49,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 03:23:49,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 03:23:49,146 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 03:23:49,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 03:23:49,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 03:23:49,149 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-16 03:23:49,176 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 03:23:49,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 03:23:49,177 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 03:23:49,177 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 03:23:49,178 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 03:23:49,178 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 03:23:49,178 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 03:23:49,178 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 03:23:49,179 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 03:23:49,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 03:23:49,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 03:23:49,180 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 03:23:49,180 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 03:23:49,180 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 03:23:49,180 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 03:23:49,180 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 03:23:49,180 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 03:23:49,181 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 03:23:49,181 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 03:23:49,181 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 03:23:49,181 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 03:23:49,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 03:23:49,182 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 03:23:49,182 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 03:23:49,182 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 03:23:49,182 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 03:23:49,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 03:23:49,182 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 03:23:49,183 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 03:23:49,183 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 03:23:49,183 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 03:23:49,183 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 ! call(reach_error())) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b64b813c3d856efe8cd859d380d09d4b682c371a0a165a5a5fe0d11dc206dad7 [2021-12-16 03:23:49,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 03:23:49,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 03:23:49,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 03:23:49,414 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 03:23:49,414 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 03:23:49,415 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_string_eq_c_str_harness.i [2021-12-16 03:23:49,462 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b247d4d4c/67976055c9954990a56f19d4b5584568/FLAGf681059d4 [2021-12-16 03:23:50,042 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 03:23:50,043 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_c_str_harness.i [2021-12-16 03:23:50,076 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b247d4d4c/67976055c9954990a56f19d4b5584568/FLAGf681059d4 [2021-12-16 03:23:50,227 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b247d4d4c/67976055c9954990a56f19d4b5584568 [2021-12-16 03:23:50,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 03:23:50,230 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 03:23:50,232 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 03:23:50,233 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 03:23:50,235 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 03:23:50,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:23:50" (1/1) ... [2021-12-16 03:23:50,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@204c4c1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:23:50, skipping insertion in model container [2021-12-16 03:23:50,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:23:50" (1/1) ... [2021-12-16 03:23:50,240 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 03:23:50,331 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 03:23:50,551 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_c_str_harness.i[4493,4506] [2021-12-16 03:23:50,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_c_str_harness.i[4553,4566] [2021-12-16 03:23:51,065 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:23:51,066 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:23:51,066 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:23:51,067 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:23:51,067 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:23:51,074 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:23:51,075 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:23:51,076 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:23:51,076 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:23:51,286 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-16 03:23:51,287 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-16 03:23:51,288 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-16 03:23:51,289 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-16 03:23:51,290 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-16 03:23:51,290 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-16 03:23:51,290 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-16 03:23:51,291 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-16 03:23:51,291 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-16 03:23:51,292 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-16 03:23:51,377 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-16 03:23:51,495 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:23:51,496 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:23:51,530 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 03:23:51,560 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 03:23:51,578 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_c_str_harness.i[4493,4506] [2021-12-16 03:23:51,608 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_c_str_harness.i[4553,4566] [2021-12-16 03:23:51,639 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:23:51,640 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:23:51,641 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:23:51,641 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:23:51,641 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:23:51,645 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:23:51,647 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:23:51,648 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:23:51,648 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:23:51,673 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-16 03:23:51,674 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-16 03:23:51,677 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-16 03:23:51,678 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-16 03:23:51,679 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-16 03:23:51,679 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-16 03:23:51,679 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-16 03:23:51,680 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-16 03:23:51,680 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-16 03:23:51,680 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-16 03:23:51,691 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-16 03:23:51,735 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:23:51,735 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:23:51,745 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 03:23:51,902 INFO L208 MainTranslator]: Completed translation [2021-12-16 03:23:51,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:23:51 WrapperNode [2021-12-16 03:23:51,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 03:23:51,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 03:23:51,904 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 03:23:51,904 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 03:23:51,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:23:51" (1/1) ... [2021-12-16 03:23:51,961 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:23:51" (1/1) ... [2021-12-16 03:23:52,015 INFO L137 Inliner]: procedures = 681, calls = 2272, calls flagged for inlining = 60, calls inlined = 8, statements flattened = 391 [2021-12-16 03:23:52,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 03:23:52,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 03:23:52,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 03:23:52,018 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 03:23:52,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:23:51" (1/1) ... [2021-12-16 03:23:52,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:23:51" (1/1) ... [2021-12-16 03:23:52,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:23:51" (1/1) ... [2021-12-16 03:23:52,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:23:51" (1/1) ... [2021-12-16 03:23:52,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:23:51" (1/1) ... [2021-12-16 03:23:52,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:23:51" (1/1) ... [2021-12-16 03:23:52,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:23:51" (1/1) ... [2021-12-16 03:23:52,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 03:23:52,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 03:23:52,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 03:23:52,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 03:23:52,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:23:51" (1/1) ... [2021-12-16 03:23:52,100 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 03:23:52,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:23:52,126 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-16 03:23:52,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-16 03:23:52,165 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq_c_str [2021-12-16 03:23:52,165 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq_c_str [2021-12-16 03:23:52,165 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2021-12-16 03:23:52,166 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2021-12-16 03:23:52,166 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2021-12-16 03:23:52,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2021-12-16 03:23:52,166 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-12-16 03:23:52,166 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-12-16 03:23:52,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 03:23:52,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-16 03:23:52,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-16 03:23:52,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 03:23:52,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 03:23:52,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 03:23:52,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 03:23:52,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 03:23:52,168 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-16 03:23:52,169 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-16 03:23:52,169 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-16 03:23:52,169 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-16 03:23:52,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-16 03:23:52,169 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-12-16 03:23:52,169 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-12-16 03:23:52,169 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-16 03:23:52,169 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-16 03:23:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 03:23:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 03:23:52,405 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 03:23:52,407 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 03:23:52,665 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 03:23:52,669 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 03:23:52,670 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-16 03:23:52,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:23:52 BoogieIcfgContainer [2021-12-16 03:23:52,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 03:23:52,672 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 03:23:52,672 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 03:23:52,674 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 03:23:52,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:23:50" (1/3) ... [2021-12-16 03:23:52,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e24a6ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:23:52, skipping insertion in model container [2021-12-16 03:23:52,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:23:51" (2/3) ... [2021-12-16 03:23:52,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e24a6ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:23:52, skipping insertion in model container [2021-12-16 03:23:52,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:23:52" (3/3) ... [2021-12-16 03:23:52,676 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_eq_c_str_harness.i [2021-12-16 03:23:52,679 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 03:23:52,679 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 03:23:52,706 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 03:23:52,710 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-12-16 03:23:52,711 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-16 03:23:52,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 71 states have internal predecessors, (87), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2021-12-16 03:23:52,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 03:23:52,726 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:23:52,727 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:23:52,727 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:23:52,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:23:52,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1676862830, now seen corresponding path program 1 times [2021-12-16 03:23:52,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:23:52,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165327366] [2021-12-16 03:23:52,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:23:52,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:23:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:52,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:23:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:52,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 03:23:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:53,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-16 03:23:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:53,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-16 03:23:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:53,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-16 03:23:53,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:23:53,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165327366] [2021-12-16 03:23:53,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165327366] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:23:53,035 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:23:53,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 03:23:53,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808712325] [2021-12-16 03:23:53,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:23:53,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-16 03:23:53,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:23:53,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-16 03:23:53,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 03:23:53,068 INFO L87 Difference]: Start difference. First operand has 107 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 71 states have internal predecessors, (87), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:23:53,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:23:53,126 INFO L93 Difference]: Finished difference Result 205 states and 281 transitions. [2021-12-16 03:23:53,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-16 03:23:53,129 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2021-12-16 03:23:53,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:23:53,137 INFO L225 Difference]: With dead ends: 205 [2021-12-16 03:23:53,137 INFO L226 Difference]: Without dead ends: 101 [2021-12-16 03:23:53,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 03:23:53,148 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 03:23:53,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 03:23:53,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-16 03:23:53,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-12-16 03:23:53,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-16 03:23:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2021-12-16 03:23:53,182 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 36 [2021-12-16 03:23:53,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:23:53,183 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2021-12-16 03:23:53,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 03:23:53,183 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2021-12-16 03:23:53,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 03:23:53,185 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:23:53,185 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:23:53,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 03:23:53,186 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:23:53,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:23:53,186 INFO L85 PathProgramCache]: Analyzing trace with hash -12080912, now seen corresponding path program 1 times [2021-12-16 03:23:53,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:23:53,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605024116] [2021-12-16 03:23:53,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:23:53,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:23:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:53,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:23:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:53,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 03:23:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:53,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-16 03:23:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:53,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-16 03:23:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:53,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-16 03:23:53,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:23:53,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605024116] [2021-12-16 03:23:53,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605024116] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:23:53,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:23:53,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 03:23:53,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440767896] [2021-12-16 03:23:53,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:23:53,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 03:23:53,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:23:53,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 03:23:53,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 03:23:53,301 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-16 03:23:53,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:23:53,324 INFO L93 Difference]: Finished difference Result 148 states and 186 transitions. [2021-12-16 03:23:53,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 03:23:53,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2021-12-16 03:23:53,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:23:53,326 INFO L225 Difference]: With dead ends: 148 [2021-12-16 03:23:53,326 INFO L226 Difference]: Without dead ends: 101 [2021-12-16 03:23:53,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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-12-16 03:23:53,327 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 6 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 03:23:53,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 380 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 03:23:53,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-16 03:23:53,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-12-16 03:23:53,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 66 states have internal predecessors, (76), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-16 03:23:53,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 127 transitions. [2021-12-16 03:23:53,337 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 127 transitions. Word has length 36 [2021-12-16 03:23:53,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:23:53,337 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 127 transitions. [2021-12-16 03:23:53,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-16 03:23:53,338 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 127 transitions. [2021-12-16 03:23:53,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-16 03:23:53,339 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:23:53,339 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:23:53,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 03:23:53,340 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:23:53,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:23:53,340 INFO L85 PathProgramCache]: Analyzing trace with hash 2108660913, now seen corresponding path program 1 times [2021-12-16 03:23:53,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:23:53,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034490068] [2021-12-16 03:23:53,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:23:53,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:23:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:53,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:23:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:53,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 03:23:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:53,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:23:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:53,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 03:23:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:53,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 03:23:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:53,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:23:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:53,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-16 03:23:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:53,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 03:23:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:53,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-16 03:23:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:53,594 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-16 03:23:53,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:23:53,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034490068] [2021-12-16 03:23:53,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034490068] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:23:53,595 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:23:53,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 03:23:53,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809519974] [2021-12-16 03:23:53,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:23:53,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 03:23:53,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:23:53,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 03:23:53,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-16 03:23:53,597 INFO L87 Difference]: Start difference. First operand 101 states and 127 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-16 03:23:53,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:23:53,855 INFO L93 Difference]: Finished difference Result 138 states and 169 transitions. [2021-12-16 03:23:53,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 03:23:53,856 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 64 [2021-12-16 03:23:53,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:23:53,857 INFO L225 Difference]: With dead ends: 138 [2021-12-16 03:23:53,858 INFO L226 Difference]: Without dead ends: 101 [2021-12-16 03:23:53,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-12-16 03:23:53,859 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 89 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 03:23:53,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 545 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 03:23:53,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-16 03:23:53,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-12-16 03:23:53,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 66 states have internal predecessors, (75), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-16 03:23:53,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2021-12-16 03:23:53,869 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 64 [2021-12-16 03:23:53,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:23:53,870 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2021-12-16 03:23:53,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-16 03:23:53,870 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2021-12-16 03:23:53,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-16 03:23:53,872 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:23:53,872 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:23:53,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 03:23:53,872 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:23:53,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:23:53,873 INFO L85 PathProgramCache]: Analyzing trace with hash -63104247, now seen corresponding path program 1 times [2021-12-16 03:23:53,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:23:53,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994189689] [2021-12-16 03:23:53,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:23:53,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:23:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:53,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:23:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:53,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 03:23:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:53,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 03:23:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:53,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 03:23:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:54,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 03:23:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:54,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:23:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:54,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-16 03:23:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:54,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 03:23:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:54,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-16 03:23:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:54,067 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-16 03:23:54,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:23:54,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994189689] [2021-12-16 03:23:54,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994189689] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:23:54,068 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:23:54,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 03:23:54,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745264040] [2021-12-16 03:23:54,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:23:54,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 03:23:54,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:23:54,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 03:23:54,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 03:23:54,071 INFO L87 Difference]: Start difference. First operand 101 states and 126 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-16 03:23:54,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:23:54,257 INFO L93 Difference]: Finished difference Result 159 states and 199 transitions. [2021-12-16 03:23:54,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 03:23:54,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 65 [2021-12-16 03:23:54,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:23:54,262 INFO L225 Difference]: With dead ends: 159 [2021-12-16 03:23:54,262 INFO L226 Difference]: Without dead ends: 101 [2021-12-16 03:23:54,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 03:23:54,266 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 41 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 03:23:54,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 334 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 03:23:54,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-16 03:23:54,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-12-16 03:23:54,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-16 03:23:54,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 125 transitions. [2021-12-16 03:23:54,283 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 125 transitions. Word has length 65 [2021-12-16 03:23:54,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:23:54,284 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 125 transitions. [2021-12-16 03:23:54,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-16 03:23:54,284 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions. [2021-12-16 03:23:54,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-12-16 03:23:54,290 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:23:54,290 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:23:54,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 03:23:54,291 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:23:54,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:23:54,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1726009102, now seen corresponding path program 1 times [2021-12-16 03:23:54,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:23:54,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726668930] [2021-12-16 03:23:54,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:23:54,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:23:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:54,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:23:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:54,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:23:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:54,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:23:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:54,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 03:23:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:54,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:23:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:54,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:23:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:54,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 03:23:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:54,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 03:23:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:54,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-16 03:23:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:54,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-16 03:23:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:54,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-16 03:23:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:54,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:23:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:54,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-16 03:23:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:54,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-16 03:23:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:54,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-16 03:23:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:54,560 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-12-16 03:23:54,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:23:54,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726668930] [2021-12-16 03:23:54,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726668930] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:23:54,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480008595] [2021-12-16 03:23:54,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:23:54,561 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:23:54,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:23:54,563 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 03:23:54,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-16 03:23:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:54,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-16 03:23:54,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:23:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-12-16 03:23:54,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 03:23:55,226 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-12-16 03:23:55,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480008595] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 03:23:55,227 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 03:23:55,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 23 [2021-12-16 03:23:55,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280174851] [2021-12-16 03:23:55,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 03:23:55,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-16 03:23:55,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:23:55,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-16 03:23:55,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2021-12-16 03:23:55,229 INFO L87 Difference]: Start difference. First operand 101 states and 125 transitions. Second operand has 23 states, 23 states have (on average 3.391304347826087) internal successors, (78), 17 states have internal predecessors, (78), 7 states have call successors, (26), 4 states have call predecessors, (26), 6 states have return successors, (25), 11 states have call predecessors, (25), 7 states have call successors, (25) [2021-12-16 03:23:55,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:23:55,807 INFO L93 Difference]: Finished difference Result 155 states and 191 transitions. [2021-12-16 03:23:55,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 03:23:55,807 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.391304347826087) internal successors, (78), 17 states have internal predecessors, (78), 7 states have call successors, (26), 4 states have call predecessors, (26), 6 states have return successors, (25), 11 states have call predecessors, (25), 7 states have call successors, (25) Word has length 99 [2021-12-16 03:23:55,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:23:55,808 INFO L225 Difference]: With dead ends: 155 [2021-12-16 03:23:55,808 INFO L226 Difference]: Without dead ends: 101 [2021-12-16 03:23:55,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 216 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2021-12-16 03:23:55,810 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 89 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 03:23:55,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 1293 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 03:23:55,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-16 03:23:55,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-12-16 03:23:55,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.123076923076923) internal successors, (73), 66 states have internal predecessors, (73), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-16 03:23:55,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 124 transitions. [2021-12-16 03:23:55,819 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 124 transitions. Word has length 99 [2021-12-16 03:23:55,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:23:55,821 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 124 transitions. [2021-12-16 03:23:55,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.391304347826087) internal successors, (78), 17 states have internal predecessors, (78), 7 states have call successors, (26), 4 states have call predecessors, (26), 6 states have return successors, (25), 11 states have call predecessors, (25), 7 states have call successors, (25) [2021-12-16 03:23:55,822 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2021-12-16 03:23:55,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-12-16 03:23:55,824 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:23:55,824 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:23:55,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-16 03:23:56,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:23:56,043 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:23:56,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:23:56,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1789492427, now seen corresponding path program 1 times [2021-12-16 03:23:56,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:23:56,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471531454] [2021-12-16 03:23:56,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:23:56,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:23:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:56,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:23:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:56,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:23:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:56,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:23:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:56,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 03:23:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:56,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:23:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:56,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:23:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:56,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 03:23:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:56,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 03:23:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:56,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-16 03:23:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:56,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-16 03:23:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:56,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-16 03:23:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:56,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:23:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:56,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-16 03:23:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:56,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-16 03:23:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:56,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-16 03:23:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:56,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 03:23:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:56,398 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-12-16 03:23:56,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:23:56,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471531454] [2021-12-16 03:23:56,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471531454] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:23:56,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:23:56,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-12-16 03:23:56,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798823247] [2021-12-16 03:23:56,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:23:56,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-16 03:23:56,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:23:56,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-16 03:23:56,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-12-16 03:23:56,401 INFO L87 Difference]: Start difference. First operand 101 states and 124 transitions. Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 13 states have internal predecessors, (45), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 9 states have call predecessors, (15), 6 states have call successors, (15) [2021-12-16 03:23:56,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:23:56,848 INFO L93 Difference]: Finished difference Result 138 states and 166 transitions. [2021-12-16 03:23:56,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-16 03:23:56,849 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 13 states have internal predecessors, (45), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 9 states have call predecessors, (15), 6 states have call successors, (15) Word has length 108 [2021-12-16 03:23:56,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:23:56,850 INFO L225 Difference]: With dead ends: 138 [2021-12-16 03:23:56,850 INFO L226 Difference]: Without dead ends: 101 [2021-12-16 03:23:56,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2021-12-16 03:23:56,851 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 132 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 03:23:56,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 736 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 03:23:56,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-16 03:23:56,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-12-16 03:23:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 66 states have internal predecessors, (72), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-16 03:23:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2021-12-16 03:23:56,858 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 108 [2021-12-16 03:23:56,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:23:56,859 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2021-12-16 03:23:56,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 13 states have internal predecessors, (45), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 9 states have call predecessors, (15), 6 states have call successors, (15) [2021-12-16 03:23:56,859 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2021-12-16 03:23:56,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-12-16 03:23:56,860 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:23:56,860 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:23:56,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 03:23:56,861 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:23:56,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:23:56,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1818490091, now seen corresponding path program 1 times [2021-12-16 03:23:56,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:23:56,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370554341] [2021-12-16 03:23:56,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:23:56,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:23:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:57,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:23:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:57,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 03:23:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:57,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:23:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:57,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 03:23:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:57,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 03:23:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:57,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:23:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:57,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 03:23:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:57,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 03:23:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:57,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-16 03:23:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:57,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-16 03:23:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:57,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-16 03:23:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:57,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:23:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:57,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-16 03:23:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:57,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-16 03:23:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:57,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-16 03:23:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:57,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-16 03:23:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:57,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:23:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:57,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 03:23:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:57,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-16 03:23:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:57,379 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-12-16 03:23:57,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:23:57,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370554341] [2021-12-16 03:23:57,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370554341] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:23:57,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811804248] [2021-12-16 03:23:57,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:23:57,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:23:57,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:23:57,382 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 03:23:57,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-16 03:23:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:23:57,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 104 conjunts are in the unsatisfiable core [2021-12-16 03:23:57,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:23:57,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 03:24:01,109 INFO L354 Elim1Store]: treesize reduction 120, result has 21.6 percent of original size [2021-12-16 03:24:01,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 176 treesize of output 140 [2021-12-16 03:24:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 67 proven. 8 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-16 03:24:01,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 03:24:05,042 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-12-16 03:24:05,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811804248] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 03:24:05,042 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 03:24:05,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 31, 17] total 56 [2021-12-16 03:24:05,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022063894] [2021-12-16 03:24:05,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 03:24:05,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2021-12-16 03:24:05,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:24:05,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-12-16 03:24:05,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2895, Unknown=0, NotChecked=0, Total=3080 [2021-12-16 03:24:05,045 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand has 56 states, 48 states have (on average 3.1041666666666665) internal successors, (149), 44 states have internal predecessors, (149), 19 states have call successors, (48), 7 states have call predecessors, (48), 14 states have return successors, (47), 18 states have call predecessors, (47), 17 states have call successors, (47) [2021-12-16 03:24:05,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:24:05,831 INFO L93 Difference]: Finished difference Result 116 states and 135 transitions. [2021-12-16 03:24:05,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-16 03:24:05,833 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 48 states have (on average 3.1041666666666665) internal successors, (149), 44 states have internal predecessors, (149), 19 states have call successors, (48), 7 states have call predecessors, (48), 14 states have return successors, (47), 18 states have call predecessors, (47), 17 states have call successors, (47) Word has length 126 [2021-12-16 03:24:05,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:24:05,834 INFO L225 Difference]: With dead ends: 116 [2021-12-16 03:24:05,834 INFO L226 Difference]: Without dead ends: 0 [2021-12-16 03:24:05,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 241 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 913 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=275, Invalid=4281, Unknown=0, NotChecked=0, Total=4556 [2021-12-16 03:24:05,836 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 46 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 03:24:05,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 586 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 566 Invalid, 0 Unknown, 81 Unchecked, 0.4s Time] [2021-12-16 03:24:05,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-16 03:24:05,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-16 03:24:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:24:05,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-16 03:24:05,837 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 126 [2021-12-16 03:24:05,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:24:05,837 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-16 03:24:05,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 48 states have (on average 3.1041666666666665) internal successors, (149), 44 states have internal predecessors, (149), 19 states have call successors, (48), 7 states have call predecessors, (48), 14 states have return successors, (47), 18 states have call predecessors, (47), 17 states have call successors, (47) [2021-12-16 03:24:05,837 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-16 03:24:05,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-16 03:24:05,839 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-16 03:24:05,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-16 03:24:06,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-12-16 03:24:06,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-16 03:24:06,246 INFO L854 garLoopResultBuilder]: At program point L6816(lines 6807 6817) the Hoare annotation is: (and (not (= 16 |ensure_string_is_allocated_bounded_length_#in~max_size#1|)) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= |ensure_string_is_allocated_bounded_length_~max_size#1| 16)) (not (= 0 |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base|)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (not (= 0 |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base|)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| 0)) [2021-12-16 03:24:06,246 INFO L858 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6801 6805) no Hoare annotation was computed. [2021-12-16 03:24:06,246 INFO L858 garLoopResultBuilder]: For program point L6811-1(lines 6811 6812) no Hoare annotation was computed. [2021-12-16 03:24:06,247 INFO L854 garLoopResultBuilder]: At program point L6811(line 6811) the Hoare annotation is: (and (not (= 16 |ensure_string_is_allocated_bounded_length_#in~max_size#1|)) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= |ensure_string_is_allocated_bounded_length_~max_size#1| 16)) (not (= 0 |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base|)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0)) [2021-12-16 03:24:06,247 INFO L858 garLoopResultBuilder]: For program point L6811-5(lines 6811 6812) no Hoare annotation was computed. [2021-12-16 03:24:06,247 INFO L858 garLoopResultBuilder]: For program point L6808-1(line 6808) no Hoare annotation was computed. [2021-12-16 03:24:06,247 INFO L854 garLoopResultBuilder]: At program point L6808(line 6808) the Hoare annotation is: (let ((.cse0 (not (= 16 |ensure_string_is_allocated_bounded_length_#in~max_size#1|)))) (and (= |#memory_int| |old(#memory_int)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (or .cse0 (<= 0 (+ (* 18446744073709551616 (div (+ (* |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| (- 1)) 15) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|))) (= |#memory_real| |old(#memory_real)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= |ensure_string_is_allocated_bounded_length_~max_size#1| 16)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or .cse0 (let ((.cse1 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616))) (<= (* 18446744073709551616 .cse1) (+ (* 18446744073709551616 (div (+ (* .cse1 18446744073709551616) (* |ensure_string_is_allocated_bounded_length_~len~1#1| (- 1)) 15) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_~len~1#1|)))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) [2021-12-16 03:24:06,247 INFO L858 garLoopResultBuilder]: For program point L6811-3(line 6811) no Hoare annotation was computed. [2021-12-16 03:24:06,247 INFO L854 garLoopResultBuilder]: At program point L6811-2(line 6811) the Hoare annotation is: (and (not (= 16 |ensure_string_is_allocated_bounded_length_#in~max_size#1|)) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= |ensure_string_is_allocated_bounded_length_~max_size#1| 16)) (not (= 0 |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base|)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0)) [2021-12-16 03:24:06,247 INFO L854 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |#memory_real| |old(#memory_real)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= |ensure_string_is_allocated_bounded_length_~max_size#1| 16)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2021-12-16 03:24:06,247 INFO L858 garLoopResultBuilder]: For program point L6803-1(line 6803) no Hoare annotation was computed. [2021-12-16 03:24:06,247 INFO L854 garLoopResultBuilder]: At program point L6803(line 6803) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |#memory_real| |old(#memory_real)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= |ensure_string_is_allocated_bounded_length_~max_size#1| 16)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2021-12-16 03:24:06,247 INFO L854 garLoopResultBuilder]: At program point ensure_string_is_allocated_bounded_lengthENTRY(lines 6801 6805) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |#memory_real| |old(#memory_real)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2021-12-16 03:24:06,247 INFO L858 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2021-12-16 03:24:06,247 INFO L858 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6801 6805) no Hoare annotation was computed. [2021-12-16 03:24:06,247 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6883 6888) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|)) [2021-12-16 03:24:06,247 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6883 6888) no Hoare annotation was computed. [2021-12-16 03:24:06,247 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6883 6888) no Hoare annotation was computed. [2021-12-16 03:24:06,247 INFO L858 garLoopResultBuilder]: For program point L6884-1(lines 6884 6886) no Hoare annotation was computed. [2021-12-16 03:24:06,248 INFO L854 garLoopResultBuilder]: At program point L6884(lines 6884 6886) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |bounded_malloc_#in~size| bounded_malloc_~size)) [2021-12-16 03:24:06,248 INFO L858 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2021-12-16 03:24:06,248 INFO L858 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2021-12-16 03:24:06,248 INFO L861 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2021-12-16 03:24:06,248 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-12-16 03:24:06,248 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-12-16 03:24:06,248 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-12-16 03:24:06,248 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-12-16 03:24:06,248 INFO L858 garLoopResultBuilder]: For program point L8097(lines 8097 8101) no Hoare annotation was computed. [2021-12-16 03:24:06,248 INFO L858 garLoopResultBuilder]: For program point L8095-4(lines 8095 8108) no Hoare annotation was computed. [2021-12-16 03:24:06,248 INFO L861 garLoopResultBuilder]: At program point L8095-3(lines 8095 8108) the Hoare annotation is: true [2021-12-16 03:24:06,248 INFO L858 garLoopResultBuilder]: For program point L8095-2(lines 8095 8108) no Hoare annotation was computed. [2021-12-16 03:24:06,248 INFO L858 garLoopResultBuilder]: For program point aws_array_eq_c_strFINAL(lines 8078 8111) no Hoare annotation was computed. [2021-12-16 03:24:06,248 INFO L858 garLoopResultBuilder]: For program point L8083(lines 8083 8085) no Hoare annotation was computed. [2021-12-16 03:24:06,248 INFO L861 garLoopResultBuilder]: At program point L8080-1(line 8080) the Hoare annotation is: true [2021-12-16 03:24:06,248 INFO L861 garLoopResultBuilder]: At program point L8080(line 8080) the Hoare annotation is: true [2021-12-16 03:24:06,248 INFO L861 garLoopResultBuilder]: At program point aws_array_eq_c_strENTRY(lines 8078 8111) the Hoare annotation is: true [2021-12-16 03:24:06,248 INFO L858 garLoopResultBuilder]: For program point L8103(lines 8103 8107) no Hoare annotation was computed. [2021-12-16 03:24:06,248 INFO L858 garLoopResultBuilder]: For program point aws_array_eq_c_strEXIT(lines 8078 8111) no Hoare annotation was computed. [2021-12-16 03:24:06,249 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6890 6892) no Hoare annotation was computed. [2021-12-16 03:24:06,249 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6890 6892) no Hoare annotation was computed. [2021-12-16 03:24:06,249 INFO L861 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6890 6892) the Hoare annotation is: true [2021-12-16 03:24:06,249 INFO L861 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6253 6258) the Hoare annotation is: true [2021-12-16 03:24:06,249 INFO L858 garLoopResultBuilder]: For program point L6257-2(line 6257) no Hoare annotation was computed. [2021-12-16 03:24:06,249 INFO L858 garLoopResultBuilder]: For program point L6257-3(line 6257) no Hoare annotation was computed. [2021-12-16 03:24:06,249 INFO L858 garLoopResultBuilder]: For program point L6257(line 6257) no Hoare annotation was computed. [2021-12-16 03:24:06,249 INFO L858 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6253 6258) no Hoare annotation was computed. [2021-12-16 03:24:06,249 INFO L858 garLoopResultBuilder]: For program point L6257-5(line 6257) no Hoare annotation was computed. [2021-12-16 03:24:06,249 INFO L858 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6253 6258) no Hoare annotation was computed. [2021-12-16 03:24:06,249 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2021-12-16 03:24:06,249 INFO L861 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2021-12-16 03:24:06,249 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2021-12-16 03:24:06,249 INFO L861 garLoopResultBuilder]: At program point L8925(line 8925) the Hoare annotation is: true [2021-12-16 03:24:06,249 INFO L858 garLoopResultBuilder]: For program point L7579(line 7579) no Hoare annotation was computed. [2021-12-16 03:24:06,249 INFO L858 garLoopResultBuilder]: For program point L7100(lines 7100 7113) no Hoare annotation was computed. [2021-12-16 03:24:06,249 INFO L858 garLoopResultBuilder]: For program point L7579-5(line 7579) no Hoare annotation was computed. [2021-12-16 03:24:06,249 INFO L854 garLoopResultBuilder]: At program point L7579-4(line 7579) the Hoare annotation is: (or (and (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset|) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_#res#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0)) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0)) (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base|)) (and (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.offset|) (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.base|))) [2021-12-16 03:24:06,249 INFO L858 garLoopResultBuilder]: For program point L7579-3(line 7579) no Hoare annotation was computed. [2021-12-16 03:24:06,250 INFO L854 garLoopResultBuilder]: At program point L7579-2(line 7579) the Hoare annotation is: (or (and (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset|) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_#res#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0)) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0)) (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base|)) (and (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.offset|) (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.base|))) [2021-12-16 03:24:06,250 INFO L854 garLoopResultBuilder]: At program point L8921(line 8921) the Hoare annotation is: false [2021-12-16 03:24:06,250 INFO L858 garLoopResultBuilder]: For program point L8921-1(line 8921) no Hoare annotation was computed. [2021-12-16 03:24:06,250 INFO L858 garLoopResultBuilder]: For program point L6820-1(line 6820) no Hoare annotation was computed. [2021-12-16 03:24:06,250 INFO L854 garLoopResultBuilder]: At program point L6820(line 6820) the Hoare annotation is: (and (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset|) (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base|)) [2021-12-16 03:24:06,250 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-16 03:24:06,250 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-16 03:24:06,250 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-16 03:24:06,250 INFO L858 garLoopResultBuilder]: For program point L7580(lines 7580 7588) no Hoare annotation was computed. [2021-12-16 03:24:06,250 INFO L858 garLoopResultBuilder]: For program point L7101-1(lines 7100 7113) no Hoare annotation was computed. [2021-12-16 03:24:06,250 INFO L854 garLoopResultBuilder]: At program point L7101(line 7101) the Hoare annotation is: false [2021-12-16 03:24:06,250 INFO L858 garLoopResultBuilder]: For program point L8918(lines 8918 8923) no Hoare annotation was computed. [2021-12-16 03:24:06,250 INFO L854 garLoopResultBuilder]: At program point L6821-1(line 6821) the Hoare annotation is: (and (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset|) (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base|)) [2021-12-16 03:24:06,250 INFO L854 garLoopResultBuilder]: At program point L6821(line 6821) the Hoare annotation is: (and (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset|) (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base|)) [2021-12-16 03:24:06,250 INFO L858 garLoopResultBuilder]: For program point L7589(lines 7589 7597) no Hoare annotation was computed. [2021-12-16 03:24:06,250 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-16 03:24:06,250 INFO L854 garLoopResultBuilder]: At program point L6272(lines 6263 6273) the Hoare annotation is: false [2021-12-16 03:24:06,250 INFO L858 garLoopResultBuilder]: For program point L8919-2(line 8919) no Hoare annotation was computed. [2021-12-16 03:24:06,250 INFO L854 garLoopResultBuilder]: At program point L8915(line 8915) the Hoare annotation is: (and (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset|) (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base|)) [2021-12-16 03:24:06,250 INFO L858 garLoopResultBuilder]: For program point L8915-1(lines 8915 8916) no Hoare annotation was computed. [2021-12-16 03:24:06,251 INFO L854 garLoopResultBuilder]: At program point L8919(line 8919) the Hoare annotation is: false [2021-12-16 03:24:06,251 INFO L854 garLoopResultBuilder]: At program point L8919-1(line 8919) the Hoare annotation is: false [2021-12-16 03:24:06,251 INFO L854 garLoopResultBuilder]: At program point L7598(line 7598) the Hoare annotation is: (or (and (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset|) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_#res#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0)) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0)) (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base|)) (and (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.offset|) (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.base|))) [2021-12-16 03:24:06,251 INFO L854 garLoopResultBuilder]: At program point L6826(line 6826) the Hoare annotation is: (and (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset|) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0)) (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base|)) [2021-12-16 03:24:06,251 INFO L858 garLoopResultBuilder]: For program point L8915-3(lines 8915 8916) no Hoare annotation was computed. [2021-12-16 03:24:06,254 INFO L854 garLoopResultBuilder]: At program point L7598-2(lines 7577 7599) the Hoare annotation is: (or (and (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset|) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_#res#1.base| 0)) (not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0)) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0)) (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base|)) (and (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.offset|) (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.base|))) [2021-12-16 03:24:06,254 INFO L858 garLoopResultBuilder]: For program point L8911(lines 8911 8924) no Hoare annotation was computed. [2021-12-16 03:24:06,254 INFO L858 garLoopResultBuilder]: For program point L7598-1(line 7598) no Hoare annotation was computed. [2021-12-16 03:24:06,254 INFO L858 garLoopResultBuilder]: For program point L6822(line 6822) no Hoare annotation was computed. [2021-12-16 03:24:06,254 INFO L858 garLoopResultBuilder]: For program point L7111-1(line 7111) no Hoare annotation was computed. [2021-12-16 03:24:06,254 INFO L854 garLoopResultBuilder]: At program point L7111(line 7111) the Hoare annotation is: false [2021-12-16 03:24:06,255 INFO L858 garLoopResultBuilder]: For program point L6826-1(line 6826) no Hoare annotation was computed. [2021-12-16 03:24:06,255 INFO L858 garLoopResultBuilder]: For program point L7107-1(line 7107) no Hoare annotation was computed. [2021-12-16 03:24:06,255 INFO L854 garLoopResultBuilder]: At program point L7107(line 7107) the Hoare annotation is: false [2021-12-16 03:24:06,255 INFO L854 garLoopResultBuilder]: At program point L8920(line 8920) the Hoare annotation is: false [2021-12-16 03:24:06,255 INFO L858 garLoopResultBuilder]: For program point L8920-1(line 8920) no Hoare annotation was computed. [2021-12-16 03:24:06,255 INFO L858 garLoopResultBuilder]: For program point L8912-3(line 8912) no Hoare annotation was computed. [2021-12-16 03:24:06,255 INFO L858 garLoopResultBuilder]: For program point L8912-5(lines 8912 8913) no Hoare annotation was computed. [2021-12-16 03:24:06,255 INFO L861 garLoopResultBuilder]: At program point L8912(line 8912) the Hoare annotation is: true [2021-12-16 03:24:06,255 INFO L854 garLoopResultBuilder]: At program point L6827(lines 6819 6828) the Hoare annotation is: (and (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset|) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_#res#1.base| 0)) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0)) (= 0 |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base|)) [2021-12-16 03:24:06,255 INFO L858 garLoopResultBuilder]: For program point L8912-1(lines 8912 8913) no Hoare annotation was computed. [2021-12-16 03:24:06,255 INFO L861 garLoopResultBuilder]: At program point L8912-2(line 8912) the Hoare annotation is: true [2021-12-16 03:24:06,255 INFO L858 garLoopResultBuilder]: For program point L7108-1(lines 7108 7110) no Hoare annotation was computed. [2021-12-16 03:24:06,255 INFO L854 garLoopResultBuilder]: At program point L7108(lines 7108 7110) the Hoare annotation is: false [2021-12-16 03:24:06,255 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-12-16 03:24:06,255 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-12-16 03:24:06,255 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-12-16 03:24:06,255 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-12-16 03:24:06,255 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-12-16 03:24:06,256 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-12-16 03:24:06,258 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:24:06,259 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 03:24:06,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:24:06 BoogieIcfgContainer [2021-12-16 03:24:06,281 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 03:24:06,281 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 03:24:06,281 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 03:24:06,282 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 03:24:06,282 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:23:52" (3/4) ... [2021-12-16 03:24:06,284 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-16 03:24:06,290 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2021-12-16 03:24:06,291 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-12-16 03:24:06,291 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2021-12-16 03:24:06,291 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2021-12-16 03:24:06,291 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-16 03:24:06,292 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-12-16 03:24:06,292 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_eq_c_str [2021-12-16 03:24:06,292 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2021-12-16 03:24:06,292 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2021-12-16 03:24:06,301 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2021-12-16 03:24:06,306 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-12-16 03:24:06,306 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-16 03:24:06,307 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-16 03:24:06,331 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == str && !(\result == 0)) && !(str == 0)) && 0 == str [2021-12-16 03:24:06,333 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == str && !(\result == 0)) && !(c_str == 0)) && !(str == 0)) && 0 == str) || (0 == c_str && 0 == c_str) [2021-12-16 03:24:06,334 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(16 == \old(max_size)) && (\old(max_size) == max_size || max_size == 16)) && !(0 == str)) && str == 0) && !(0 == \result)) && \result == 0 [2021-12-16 03:24:06,454 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 03:24:06,455 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 03:24:06,455 INFO L158 Benchmark]: Toolchain (without parser) took 16224.74ms. Allocated memory was 113.2MB in the beginning and 402.7MB in the end (delta: 289.4MB). Free memory was 78.6MB in the beginning and 296.7MB in the end (delta: -218.1MB). Peak memory consumption was 251.1MB. Max. memory is 16.1GB. [2021-12-16 03:24:06,456 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory is still 70.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 03:24:06,456 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1670.38ms. Allocated memory was 113.2MB in the beginning and 169.9MB in the end (delta: 56.6MB). Free memory was 78.4MB in the beginning and 96.7MB in the end (delta: -18.3MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. [2021-12-16 03:24:06,456 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.89ms. Allocated memory is still 169.9MB. Free memory was 96.7MB in the beginning and 88.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-16 03:24:06,456 INFO L158 Benchmark]: Boogie Preprocessor took 75.91ms. Allocated memory is still 169.9MB. Free memory was 88.3MB in the beginning and 84.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-16 03:24:06,457 INFO L158 Benchmark]: RCFGBuilder took 576.66ms. Allocated memory is still 169.9MB. Free memory was 84.1MB in the beginning and 101.9MB in the end (delta: -17.8MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2021-12-16 03:24:06,457 INFO L158 Benchmark]: TraceAbstraction took 13608.83ms. Allocated memory was 169.9MB in the beginning and 402.7MB in the end (delta: 232.8MB). Free memory was 101.9MB in the beginning and 140.4MB in the end (delta: -38.6MB). Peak memory consumption was 195.2MB. Max. memory is 16.1GB. [2021-12-16 03:24:06,457 INFO L158 Benchmark]: Witness Printer took 173.34ms. Allocated memory is still 402.7MB. Free memory was 140.4MB in the beginning and 296.7MB in the end (delta: -156.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-16 03:24:06,459 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.14ms. Allocated memory is still 113.2MB. Free memory is still 70.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1670.38ms. Allocated memory was 113.2MB in the beginning and 169.9MB in the end (delta: 56.6MB). Free memory was 78.4MB in the beginning and 96.7MB in the end (delta: -18.3MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 113.89ms. Allocated memory is still 169.9MB. Free memory was 96.7MB in the beginning and 88.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.91ms. Allocated memory is still 169.9MB. Free memory was 88.3MB in the beginning and 84.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 576.66ms. Allocated memory is still 169.9MB. Free memory was 84.1MB in the beginning and 101.9MB in the end (delta: -17.8MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * TraceAbstraction took 13608.83ms. Allocated memory was 169.9MB in the beginning and 402.7MB in the end (delta: 232.8MB). Free memory was 101.9MB in the beginning and 140.4MB in the end (delta: -38.6MB). Peak memory consumption was 195.2MB. Max. memory is 16.1GB. * Witness Printer took 173.34ms. Allocated memory is still 402.7MB. Free memory was 140.4MB in the beginning and 296.7MB in the end (delta: -156.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.6s, OverallIterations: 7, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 429 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 403 mSDsluCounter, 4010 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 81 IncrementalHoareTripleChecker+Unchecked, 3275 mSDsCounter, 255 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2624 IncrementalHoareTripleChecker+Invalid, 2960 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 255 mSolverCounterUnsat, 735 mSDtfsCounter, 2624 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 687 GetRequests, 549 SyntacticMatches, 4 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=0, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 41 LocationsWithAnnotation, 152 PreInvPairs, 176 NumberOfFragments, 407 HoareAnnotationTreeSize, 152 FomulaSimplifications, 4 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 41 FomulaSimplificationsInter, 164 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 759 NumberOfCodeBlocks, 759 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 973 ConstructedInterpolants, 28 QuantifiedInterpolants, 7779 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1909 ConjunctsInSsa, 125 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 717/783 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 8095]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6263]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 8925]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7577]: Loop Invariant Derived loop invariant: ((((0 == str && !(\result == 0)) && !(c_str == 0)) && !(str == 0)) && 0 == str) || (0 == c_str && 0 == c_str) - InvariantResult [Line: 6807]: Loop Invariant Derived loop invariant: ((((!(16 == \old(max_size)) && (\old(max_size) == max_size || max_size == 16)) && !(0 == str)) && str == 0) && !(0 == \result)) && \result == 0 - InvariantResult [Line: 6819]: Loop Invariant Derived loop invariant: ((0 == str && !(\result == 0)) && !(str == 0)) && 0 == str RESULT: Ultimate proved your program to be correct! [2021-12-16 03:24:06,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE