./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_clear_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fcb8e130 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_hash_table_clear_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 76206b4f7fb4016a4087a30dbd51e90ef533ed916c2eae20331e23ac9a9e91be --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 20:04:11,791 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 20:04:11,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 20:04:11,846 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 20:04:11,848 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 20:04:11,850 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 20:04:11,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 20:04:11,855 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 20:04:11,857 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 20:04:11,860 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 20:04:11,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 20:04:11,862 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 20:04:11,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 20:04:11,863 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 20:04:11,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 20:04:11,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 20:04:11,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 20:04:11,872 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 20:04:11,875 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 20:04:11,876 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 20:04:11,878 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 20:04:11,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 20:04:11,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 20:04:11,881 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 20:04:11,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 20:04:11,886 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 20:04:11,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 20:04:11,887 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 20:04:11,888 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 20:04:11,889 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 20:04:11,889 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 20:04:11,889 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 20:04:11,890 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 20:04:11,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 20:04:11,892 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 20:04:11,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 20:04:11,893 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 20:04:11,893 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 20:04:11,893 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 20:04:11,894 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 20:04:11,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 20:04:11,895 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-22 20:04:11,917 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 20:04:11,923 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 20:04:11,924 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 20:04:11,924 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 20:04:11,925 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 20:04:11,925 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 20:04:11,925 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 20:04:11,925 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 20:04:11,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 20:04:11,926 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 20:04:11,926 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 20:04:11,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 20:04:11,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 20:04:11,927 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 20:04:11,927 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 20:04:11,927 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 20:04:11,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 20:04:11,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 20:04:11,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 20:04:11,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 20:04:11,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 20:04:11,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 20:04:11,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 20:04:11,928 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 20:04:11,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 20:04:11,928 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 20:04:11,928 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 20:04:11,928 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 20:04:11,929 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 20:04:11,929 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 -> 76206b4f7fb4016a4087a30dbd51e90ef533ed916c2eae20331e23ac9a9e91be [2021-11-22 20:04:12,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 20:04:12,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 20:04:12,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 20:04:12,143 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 20:04:12,144 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 20:04:12,145 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_clear_harness.i [2021-11-22 20:04:12,198 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12304dcad/f5c225e25381442da4d39342e468bd0a/FLAGef6cbd65b [2021-11-22 20:04:12,754 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 20:04:12,755 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clear_harness.i [2021-11-22 20:04:12,782 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12304dcad/f5c225e25381442da4d39342e468bd0a/FLAGef6cbd65b [2021-11-22 20:04:12,951 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12304dcad/f5c225e25381442da4d39342e468bd0a [2021-11-22 20:04:12,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 20:04:12,954 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 20:04:12,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 20:04:12,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 20:04:12,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 20:04:12,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:04:12" (1/1) ... [2021-11-22 20:04:12,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@222176d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:04:12, skipping insertion in model container [2021-11-22 20:04:12,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:04:12" (1/1) ... [2021-11-22 20:04:12,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 20:04:13,041 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 20:04:13,254 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_hash_table_clear_harness.i[4494,4507] [2021-11-22 20:04:13,260 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_hash_table_clear_harness.i[4554,4567] [2021-11-22 20:04:13,983 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:13,984 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:13,985 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:13,985 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:13,986 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,000 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,001 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,003 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,004 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,006 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,007 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,007 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,008 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,229 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 20:04:14,230 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 20:04:14,232 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 20:04:14,233 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 20:04:14,235 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 20:04:14,236 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 20:04:14,236 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 20:04:14,236 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 20:04:14,237 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 20:04:14,237 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 20:04:14,351 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 20:04:14,540 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,541 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,566 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,568 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,572 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,573 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,589 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,590 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,590 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,590 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,591 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,591 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,592 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,636 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 20:04:14,671 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 20:04:14,688 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_hash_table_clear_harness.i[4494,4507] [2021-11-22 20:04:14,688 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_hash_table_clear_harness.i[4554,4567] [2021-11-22 20:04:14,715 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,715 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,716 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,716 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,716 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,721 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,722 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,723 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,723 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,724 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,725 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,725 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,725 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,743 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 20:04:14,747 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 20:04:14,747 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 20:04:14,748 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 20:04:14,748 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 20:04:14,748 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 20:04:14,749 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 20:04:14,749 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 20:04:14,749 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 20:04:14,749 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 20:04:14,764 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 20:04:14,840 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,841 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,845 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,845 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,846 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,847 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,855 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,856 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,856 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,857 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,857 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,857 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,858 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:04:14,871 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 20:04:15,022 INFO L208 MainTranslator]: Completed translation [2021-11-22 20:04:15,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:04:15 WrapperNode [2021-11-22 20:04:15,023 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 20:04:15,024 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 20:04:15,024 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 20:04:15,024 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 20:04:15,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:04:15" (1/1) ... [2021-11-22 20:04:15,129 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:04:15" (1/1) ... [2021-11-22 20:04:15,204 INFO L137 Inliner]: procedures = 775, calls = 2440, calls flagged for inlining = 754, calls inlined = 62, statements flattened = 1102 [2021-11-22 20:04:15,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 20:04:15,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 20:04:15,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 20:04:15,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 20:04:15,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:04:15" (1/1) ... [2021-11-22 20:04:15,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:04:15" (1/1) ... [2021-11-22 20:04:15,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:04:15" (1/1) ... [2021-11-22 20:04:15,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:04:15" (1/1) ... [2021-11-22 20:04:15,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:04:15" (1/1) ... [2021-11-22 20:04:15,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:04:15" (1/1) ... [2021-11-22 20:04:15,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:04:15" (1/1) ... [2021-11-22 20:04:15,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 20:04:15,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 20:04:15,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 20:04:15,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 20:04:15,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:04:15" (1/1) ... [2021-11-22 20:04:15,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 20:04:15,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:04:15,316 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-11-22 20:04:15,336 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-11-22 20:04:15,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-22 20:04:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 20:04:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 20:04:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 20:04:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 20:04:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 20:04:15,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 20:04:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 20:04:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 20:04:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 20:04:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 20:04:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 20:04:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 20:04:15,621 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 20:04:15,622 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 20:04:16,298 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 20:04:16,303 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 20:04:16,304 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-22 20:04:16,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:04:16 BoogieIcfgContainer [2021-11-22 20:04:16,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 20:04:16,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 20:04:16,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 20:04:16,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 20:04:16,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 08:04:12" (1/3) ... [2021-11-22 20:04:16,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3117ffdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:04:16, skipping insertion in model container [2021-11-22 20:04:16,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:04:15" (2/3) ... [2021-11-22 20:04:16,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3117ffdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:04:16, skipping insertion in model container [2021-11-22 20:04:16,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:04:16" (3/3) ... [2021-11-22 20:04:16,311 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_clear_harness.i [2021-11-22 20:04:16,314 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 20:04:16,315 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-22 20:04:16,358 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 20:04:16,367 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-11-22 20:04:16,368 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-22 20:04:16,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 127 states have (on average 1.3858267716535433) internal successors, (176), 132 states have internal predecessors, (176), 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-11-22 20:04:16,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-22 20:04:16,398 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:04:16,398 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:04:16,399 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:04:16,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:04:16,402 INFO L85 PathProgramCache]: Analyzing trace with hash -603307753, now seen corresponding path program 1 times [2021-11-22 20:04:16,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:04:16,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653340680] [2021-11-22 20:04:16,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:16,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:04:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:04:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:16,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:04:16,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653340680] [2021-11-22 20:04:16,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653340680] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:04:16,738 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:04:16,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 20:04:16,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822140309] [2021-11-22 20:04:16,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:04:16,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-22 20:04:16,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:04:16,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-22 20:04:16,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 20:04:16,773 INFO L87 Difference]: Start difference. First operand has 133 states, 127 states have (on average 1.3858267716535433) internal successors, (176), 132 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 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-11-22 20:04:16,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:04:16,799 INFO L93 Difference]: Finished difference Result 262 states and 347 transitions. [2021-11-22 20:04:16,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-22 20:04:16,801 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-11-22 20:04:16,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:04:16,808 INFO L225 Difference]: With dead ends: 262 [2021-11-22 20:04:16,808 INFO L226 Difference]: Without dead ends: 126 [2021-11-22 20:04:16,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 20:04:16,815 INFO L933 BasicCegarLoop]: 158 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, 158 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-11-22 20:04:16,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:04:16,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-11-22 20:04:16,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-11-22 20:04:16,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 121 states have (on average 1.2396694214876034) internal successors, (150), 125 states have internal predecessors, (150), 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-11-22 20:04:16,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 150 transitions. [2021-11-22 20:04:16,852 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 150 transitions. Word has length 57 [2021-11-22 20:04:16,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:04:16,853 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 150 transitions. [2021-11-22 20:04:16,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 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-11-22 20:04:16,853 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 150 transitions. [2021-11-22 20:04:16,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-22 20:04:16,854 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:04:16,854 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:04:16,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 20:04:16,855 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:04:16,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:04:16,855 INFO L85 PathProgramCache]: Analyzing trace with hash -623931689, now seen corresponding path program 1 times [2021-11-22 20:04:16,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:04:16,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674169808] [2021-11-22 20:04:16,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:16,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:04:16,955 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:04:16,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [615347125] [2021-11-22 20:04:16,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:16,956 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:04:16,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:04:16,957 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-11-22 20:04:16,958 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-11-22 20:04:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:04:17,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 2216 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 20:04:17,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:04:17,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:17,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:04:17,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:04:17,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674169808] [2021-11-22 20:04:17,461 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:04:17,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615347125] [2021-11-22 20:04:17,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615347125] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:04:17,462 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:04:17,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 20:04:17,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874709882] [2021-11-22 20:04:17,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:04:17,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 20:04:17,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:04:17,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 20:04:17,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 20:04:17,464 INFO L87 Difference]: Start difference. First operand 126 states and 150 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-11-22 20:04:17,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:04:17,485 INFO L93 Difference]: Finished difference Result 175 states and 206 transitions. [2021-11-22 20:04:17,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 20:04:17,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-11-22 20:04:17,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:04:17,492 INFO L225 Difference]: With dead ends: 175 [2021-11-22 20:04:17,492 INFO L226 Difference]: Without dead ends: 127 [2021-11-22 20:04:17,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 20:04:17,495 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:04:17,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 293 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:04:17,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-11-22 20:04:17,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-11-22 20:04:17,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.2377049180327868) internal successors, (151), 126 states have internal predecessors, (151), 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-11-22 20:04:17,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 151 transitions. [2021-11-22 20:04:17,506 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 151 transitions. Word has length 57 [2021-11-22 20:04:17,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:04:17,507 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 151 transitions. [2021-11-22 20:04:17,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-11-22 20:04:17,507 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 151 transitions. [2021-11-22 20:04:17,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-22 20:04:17,511 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:04:17,511 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:04:17,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-22 20:04:17,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:04:17,720 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:04:17,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:04:17,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1151075673, now seen corresponding path program 1 times [2021-11-22 20:04:17,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:04:17,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733804378] [2021-11-22 20:04:17,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:17,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:04:17,782 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:04:17,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [222634969] [2021-11-22 20:04:17,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:17,785 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:04:17,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:04:17,786 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-11-22 20:04:17,787 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-11-22 20:04:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:04:18,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 2221 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-22 20:04:18,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:04:18,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:18,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:04:18,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:04:18,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733804378] [2021-11-22 20:04:18,296 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:04:18,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222634969] [2021-11-22 20:04:18,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222634969] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:04:18,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:04:18,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:04:18,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346671279] [2021-11-22 20:04:18,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:04:18,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:04:18,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:04:18,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:04:18,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:04:18,298 INFO L87 Difference]: Start difference. First operand 127 states and 151 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-11-22 20:04:18,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:04:18,354 INFO L93 Difference]: Finished difference Result 347 states and 414 transitions. [2021-11-22 20:04:18,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:04:18,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-11-22 20:04:18,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:04:18,356 INFO L225 Difference]: With dead ends: 347 [2021-11-22 20:04:18,357 INFO L226 Difference]: Without dead ends: 242 [2021-11-22 20:04:18,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:04:18,358 INFO L933 BasicCegarLoop]: 271 mSDtfsCounter, 269 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:04:18,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 833 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:04:18,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-11-22 20:04:18,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 130. [2021-11-22 20:04:18,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 125 states have (on average 1.232) internal successors, (154), 129 states have internal predecessors, (154), 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-11-22 20:04:18,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 154 transitions. [2021-11-22 20:04:18,371 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 154 transitions. Word has length 57 [2021-11-22 20:04:18,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:04:18,372 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 154 transitions. [2021-11-22 20:04:18,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-11-22 20:04:18,372 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 154 transitions. [2021-11-22 20:04:18,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-22 20:04:18,373 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:04:18,374 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:04:18,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-22 20:04:18,587 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,SelfDestructingSolverStorable2 [2021-11-22 20:04:18,588 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:04:18,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:04:18,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1848911421, now seen corresponding path program 1 times [2021-11-22 20:04:18,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:04:18,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784872446] [2021-11-22 20:04:18,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:18,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:04:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:04:18,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:18,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:04:18,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784872446] [2021-11-22 20:04:18,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784872446] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:04:18,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:04:18,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 20:04:18,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241950915] [2021-11-22 20:04:18,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:04:18,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 20:04:18,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:04:18,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 20:04:18,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:04:18,813 INFO L87 Difference]: Start difference. First operand 130 states and 154 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 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-11-22 20:04:18,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:04:18,997 INFO L93 Difference]: Finished difference Result 228 states and 271 transitions. [2021-11-22 20:04:18,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 20:04:18,997 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-22 20:04:18,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:04:18,998 INFO L225 Difference]: With dead ends: 228 [2021-11-22 20:04:18,998 INFO L226 Difference]: Without dead ends: 136 [2021-11-22 20:04:18,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-11-22 20:04:18,999 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 203 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:04:18,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 608 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:04:19,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-11-22 20:04:19,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2021-11-22 20:04:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 127 states have (on average 1.2283464566929134) internal successors, (156), 131 states have internal predecessors, (156), 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-11-22 20:04:19,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 156 transitions. [2021-11-22 20:04:19,005 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 156 transitions. Word has length 59 [2021-11-22 20:04:19,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:04:19,005 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 156 transitions. [2021-11-22 20:04:19,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 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-11-22 20:04:19,005 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 156 transitions. [2021-11-22 20:04:19,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-22 20:04:19,005 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:04:19,006 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:04:19,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 20:04:19,006 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:04:19,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:04:19,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1786524353, now seen corresponding path program 1 times [2021-11-22 20:04:19,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:04:19,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074906561] [2021-11-22 20:04:19,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:19,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:04:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:04:19,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:19,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:04:19,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074906561] [2021-11-22 20:04:19,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074906561] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:04:19,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:04:19,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:04:19,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992263911] [2021-11-22 20:04:19,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:04:19,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:04:19,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:04:19,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:04:19,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:04:19,151 INFO L87 Difference]: Start difference. First operand 132 states and 156 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-11-22 20:04:19,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:04:19,178 INFO L93 Difference]: Finished difference Result 227 states and 269 transitions. [2021-11-22 20:04:19,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:04:19,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-22 20:04:19,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:04:19,180 INFO L225 Difference]: With dead ends: 227 [2021-11-22 20:04:19,180 INFO L226 Difference]: Without dead ends: 130 [2021-11-22 20:04:19,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:04:19,181 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 122 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:04:19,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 264 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:04:19,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-11-22 20:04:19,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2021-11-22 20:04:19,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 125 states have (on average 1.2) internal successors, (150), 129 states have internal predecessors, (150), 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-11-22 20:04:19,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 150 transitions. [2021-11-22 20:04:19,192 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 150 transitions. Word has length 59 [2021-11-22 20:04:19,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:04:19,192 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 150 transitions. [2021-11-22 20:04:19,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-11-22 20:04:19,193 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2021-11-22 20:04:19,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-22 20:04:19,194 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:04:19,195 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:04:19,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 20:04:19,195 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:04:19,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:04:19,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1528112600, now seen corresponding path program 1 times [2021-11-22 20:04:19,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:04:19,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148718483] [2021-11-22 20:04:19,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:19,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:04:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:04:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:19,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:04:19,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148718483] [2021-11-22 20:04:19,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148718483] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:04:19,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:04:19,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:04:19,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650017313] [2021-11-22 20:04:19,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:04:19,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:04:19,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:04:19,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:04:19,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:04:19,335 INFO L87 Difference]: Start difference. First operand 130 states and 150 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-11-22 20:04:19,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:04:19,504 INFO L93 Difference]: Finished difference Result 226 states and 261 transitions. [2021-11-22 20:04:19,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 20:04:19,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-11-22 20:04:19,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:04:19,506 INFO L225 Difference]: With dead ends: 226 [2021-11-22 20:04:19,506 INFO L226 Difference]: Without dead ends: 133 [2021-11-22 20:04:19,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:04:19,507 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 135 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:04:19,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 333 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:04:19,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-11-22 20:04:19,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2021-11-22 20:04:19,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 125 states have (on average 1.168) internal successors, (146), 129 states have internal predecessors, (146), 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-11-22 20:04:19,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 146 transitions. [2021-11-22 20:04:19,513 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 146 transitions. Word has length 61 [2021-11-22 20:04:19,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:04:19,513 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 146 transitions. [2021-11-22 20:04:19,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-11-22 20:04:19,514 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 146 transitions. [2021-11-22 20:04:19,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-22 20:04:19,514 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:04:19,514 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:04:19,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 20:04:19,515 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:04:19,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:04:19,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1741102199, now seen corresponding path program 1 times [2021-11-22 20:04:19,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:04:19,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155175072] [2021-11-22 20:04:19,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:19,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:04:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:04:19,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:19,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:04:19,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155175072] [2021-11-22 20:04:19,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155175072] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:04:19,721 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:04:19,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:04:19,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551072281] [2021-11-22 20:04:19,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:04:19,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:04:19,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:04:19,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:04:19,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:04:19,736 INFO L87 Difference]: Start difference. First operand 130 states and 146 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-11-22 20:04:19,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:04:19,754 INFO L93 Difference]: Finished difference Result 130 states and 146 transitions. [2021-11-22 20:04:19,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:04:19,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-22 20:04:19,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:04:19,756 INFO L225 Difference]: With dead ends: 130 [2021-11-22 20:04:19,756 INFO L226 Difference]: Without dead ends: 128 [2021-11-22 20:04:19,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:04:19,757 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 48 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:04:19,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 356 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:04:19,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-11-22 20:04:19,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2021-11-22 20:04:19,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 124 states have (on average 1.1612903225806452) internal successors, (144), 127 states have internal predecessors, (144), 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-11-22 20:04:19,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2021-11-22 20:04:19,762 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 62 [2021-11-22 20:04:19,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:04:19,762 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2021-11-22 20:04:19,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-11-22 20:04:19,763 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2021-11-22 20:04:19,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-22 20:04:19,764 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:04:19,764 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:04:19,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 20:04:19,764 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:04:19,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:04:19,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1838164555, now seen corresponding path program 1 times [2021-11-22 20:04:19,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:04:19,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075922303] [2021-11-22 20:04:19,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:19,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:04:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:04:20,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:20,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:04:20,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075922303] [2021-11-22 20:04:20,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075922303] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:04:20,167 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:04:20,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-22 20:04:20,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256165307] [2021-11-22 20:04:20,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:04:20,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-22 20:04:20,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:04:20,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-22 20:04:20,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-11-22 20:04:20,169 INFO L87 Difference]: Start difference. First operand 128 states and 144 transitions. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 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-11-22 20:04:20,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:04:20,597 INFO L93 Difference]: Finished difference Result 196 states and 222 transitions. [2021-11-22 20:04:20,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-22 20:04:20,598 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-22 20:04:20,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:04:20,598 INFO L225 Difference]: With dead ends: 196 [2021-11-22 20:04:20,598 INFO L226 Difference]: Without dead ends: 132 [2021-11-22 20:04:20,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=549, Unknown=0, NotChecked=0, Total=702 [2021-11-22 20:04:20,599 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 375 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:04:20,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [375 Valid, 743 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 20:04:20,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-11-22 20:04:20,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2021-11-22 20:04:20,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 124 states have (on average 1.153225806451613) internal successors, (143), 127 states have internal predecessors, (143), 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-11-22 20:04:20,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 143 transitions. [2021-11-22 20:04:20,604 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 143 transitions. Word has length 64 [2021-11-22 20:04:20,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:04:20,605 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 143 transitions. [2021-11-22 20:04:20,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 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-11-22 20:04:20,605 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 143 transitions. [2021-11-22 20:04:20,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-22 20:04:20,605 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:04:20,606 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:04:20,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 20:04:20,606 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:04:20,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:04:20,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1689820984, now seen corresponding path program 1 times [2021-11-22 20:04:20,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:04:20,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218972864] [2021-11-22 20:04:20,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:20,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:04:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:04:20,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:20,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:04:20,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218972864] [2021-11-22 20:04:20,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218972864] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:04:20,974 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:04:20,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:04:20,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131811807] [2021-11-22 20:04:20,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:04:20,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:04:20,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:04:20,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:04:20,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:04:20,976 INFO L87 Difference]: Start difference. First operand 128 states and 143 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-11-22 20:04:21,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:04:21,011 INFO L93 Difference]: Finished difference Result 231 states and 257 transitions. [2021-11-22 20:04:21,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:04:21,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-22 20:04:21,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:04:21,013 INFO L225 Difference]: With dead ends: 231 [2021-11-22 20:04:21,013 INFO L226 Difference]: Without dead ends: 128 [2021-11-22 20:04:21,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:04:21,015 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:04:21,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 389 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:04:21,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-11-22 20:04:21,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2021-11-22 20:04:21,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 121 states have (on average 1.140495867768595) internal successors, (138), 124 states have internal predecessors, (138), 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-11-22 20:04:21,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2021-11-22 20:04:21,024 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 67 [2021-11-22 20:04:21,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:04:21,025 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2021-11-22 20:04:21,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-11-22 20:04:21,025 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2021-11-22 20:04:21,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-22 20:04:21,029 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:04:21,029 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:04:21,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-22 20:04:21,030 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:04:21,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:04:21,030 INFO L85 PathProgramCache]: Analyzing trace with hash 916777109, now seen corresponding path program 1 times [2021-11-22 20:04:21,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:04:21,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187063937] [2021-11-22 20:04:21,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:21,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:04:21,069 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:04:21,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1451180078] [2021-11-22 20:04:21,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:21,069 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:04:21,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:04:21,070 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:04:21,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-22 20:04:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:04:21,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 2405 conjuncts, 148 conjunts are in the unsatisfiable core [2021-11-22 20:04:21,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:04:21,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-11-22 20:04:21,784 INFO L354 Elim1Store]: treesize reduction 133, result has 15.3 percent of original size [2021-11-22 20:04:21,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 45 treesize of output 53 [2021-11-22 20:04:22,041 INFO L354 Elim1Store]: treesize reduction 96, result has 27.8 percent of original size [2021-11-22 20:04:22,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 57 [2021-11-22 20:04:22,201 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-11-22 20:04:22,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 33 [2021-11-22 20:04:22,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:04:22,334 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-22 20:04:22,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2021-11-22 20:04:22,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-22 20:04:22,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2021-11-22 20:04:22,427 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-11-22 20:04:22,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 36 [2021-11-22 20:04:22,771 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:04:22,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-11-22 20:04:22,782 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-11-22 20:04:22,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2021-11-22 20:04:22,886 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:04:22,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2021-11-22 20:04:22,896 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-11-22 20:04:22,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 34 [2021-11-22 20:04:22,956 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 20:04:22,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-22 20:04:23,111 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-11-22 20:04:23,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 62 [2021-11-22 20:04:23,124 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:04:23,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 51 [2021-11-22 20:04:23,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2021-11-22 20:04:23,383 INFO L354 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2021-11-22 20:04:23,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 44 [2021-11-22 20:04:23,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:23,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:04:23,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:04:23,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187063937] [2021-11-22 20:04:23,416 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:04:23,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451180078] [2021-11-22 20:04:23,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451180078] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:04:23,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:04:23,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-22 20:04:23,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897273523] [2021-11-22 20:04:23,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:04:23,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-22 20:04:23,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:04:23,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-22 20:04:23,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-11-22 20:04:23,418 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 18 states have internal predecessors, (70), 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-11-22 20:04:24,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:04:24,264 INFO L93 Difference]: Finished difference Result 197 states and 215 transitions. [2021-11-22 20:04:24,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-22 20:04:24,268 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 18 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-22 20:04:24,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:04:24,269 INFO L225 Difference]: With dead ends: 197 [2021-11-22 20:04:24,269 INFO L226 Difference]: Without dead ends: 151 [2021-11-22 20:04:24,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2021-11-22 20:04:24,270 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 159 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:04:24,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 1332 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 359 Invalid, 0 Unknown, 53 Unchecked, 0.3s Time] [2021-11-22 20:04:24,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-11-22 20:04:24,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2021-11-22 20:04:24,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 143 states have (on average 1.1258741258741258) internal successors, (161), 146 states have internal predecessors, (161), 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-11-22 20:04:24,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2021-11-22 20:04:24,279 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 70 [2021-11-22 20:04:24,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:04:24,279 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2021-11-22 20:04:24,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 18 states have internal predecessors, (70), 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-11-22 20:04:24,280 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2021-11-22 20:04:24,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-22 20:04:24,280 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:04:24,281 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:04:24,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-22 20:04:24,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:04:24,491 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:04:24,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:04:24,491 INFO L85 PathProgramCache]: Analyzing trace with hash 215177235, now seen corresponding path program 1 times [2021-11-22 20:04:24,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:04:24,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925243248] [2021-11-22 20:04:24,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:24,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:04:24,552 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:04:24,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1336834659] [2021-11-22 20:04:24,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:24,552 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:04:24,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:04:24,568 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:04:24,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-22 20:04:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:04:30,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 2404 conjuncts, 216 conjunts are in the unsatisfiable core [2021-11-22 20:04:30,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:04:30,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-22 20:04:30,675 INFO L354 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2021-11-22 20:04:30,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-11-22 20:04:31,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:31,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:04:31,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:04:31,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925243248] [2021-11-22 20:04:31,051 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:04:31,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336834659] [2021-11-22 20:04:31,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336834659] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:04:31,051 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:04:31,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-22 20:04:31,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169581003] [2021-11-22 20:04:31,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:04:31,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 20:04:31,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:04:31,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 20:04:31,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-11-22 20:04:31,054 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 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-11-22 20:04:31,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:04:31,442 INFO L93 Difference]: Finished difference Result 288 states and 315 transitions. [2021-11-22 20:04:31,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 20:04:31,443 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-22 20:04:31,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:04:31,444 INFO L225 Difference]: With dead ends: 288 [2021-11-22 20:04:31,444 INFO L226 Difference]: Without dead ends: 160 [2021-11-22 20:04:31,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2021-11-22 20:04:31,445 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 78 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:04:31,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 785 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 50 Unchecked, 0.2s Time] [2021-11-22 20:04:31,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-11-22 20:04:31,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 152. [2021-11-22 20:04:31,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 148 states have (on average 1.1216216216216217) internal successors, (166), 151 states have internal predecessors, (166), 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-11-22 20:04:31,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2021-11-22 20:04:31,456 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 70 [2021-11-22 20:04:31,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:04:31,456 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2021-11-22 20:04:31,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 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-11-22 20:04:31,456 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2021-11-22 20:04:31,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-22 20:04:31,457 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:04:31,457 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:04:31,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-22 20:04:31,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:04:31,671 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:04:31,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:04:31,672 INFO L85 PathProgramCache]: Analyzing trace with hash 485935535, now seen corresponding path program 1 times [2021-11-22 20:04:31,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:04:31,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093413769] [2021-11-22 20:04:31,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:31,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:04:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:04:31,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:31,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:04:31,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093413769] [2021-11-22 20:04:31,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093413769] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:04:31,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:04:31,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:04:31,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454156109] [2021-11-22 20:04:31,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:04:31,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:04:31,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:04:31,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:04:31,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:04:31,818 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-11-22 20:04:31,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:04:31,853 INFO L93 Difference]: Finished difference Result 282 states and 308 transitions. [2021-11-22 20:04:31,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:04:31,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-11-22 20:04:31,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:04:31,854 INFO L225 Difference]: With dead ends: 282 [2021-11-22 20:04:31,854 INFO L226 Difference]: Without dead ends: 145 [2021-11-22 20:04:31,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:04:31,855 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 123 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:04:31,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 541 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:04:31,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-11-22 20:04:31,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2021-11-22 20:04:31,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 141 states have (on average 1.1134751773049645) internal successors, (157), 144 states have internal predecessors, (157), 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-11-22 20:04:31,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2021-11-22 20:04:31,862 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 72 [2021-11-22 20:04:31,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:04:31,862 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2021-11-22 20:04:31,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-11-22 20:04:31,862 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2021-11-22 20:04:31,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-22 20:04:31,863 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:04:31,863 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:04:31,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-22 20:04:31,863 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:04:31,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:04:31,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1011325001, now seen corresponding path program 1 times [2021-11-22 20:04:31,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:04:31,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494508752] [2021-11-22 20:04:31,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:31,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:04:31,897 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:04:31,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1940844253] [2021-11-22 20:04:31,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:04:31,898 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:04:31,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:04:31,899 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:04:31,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-22 20:04:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:04:32,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 2401 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-22 20:04:32,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:04:32,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:04:32,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:04:32,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:04:32,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494508752] [2021-11-22 20:04:32,391 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:04:32,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940844253] [2021-11-22 20:04:32,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940844253] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:04:32,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:04:32,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:04:32,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393795486] [2021-11-22 20:04:32,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:04:32,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:04:32,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:04:32,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:04:32,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:04:32,393 INFO L87 Difference]: Start difference. First operand 145 states and 157 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-11-22 20:04:32,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:04:32,430 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2021-11-22 20:04:32,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:04:32,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-11-22 20:04:32,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:04:32,430 INFO L225 Difference]: With dead ends: 145 [2021-11-22 20:04:32,430 INFO L226 Difference]: Without dead ends: 0 [2021-11-22 20:04:32,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:04:32,433 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:04:32,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 75 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:04:32,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-22 20:04:32,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-22 20:04:32,434 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-11-22 20:04:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-22 20:04:32,435 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2021-11-22 20:04:32,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:04:32,435 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-22 20:04:32,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-11-22 20:04:32,435 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-22 20:04:32,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-22 20:04:32,437 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2021-11-22 20:04:32,437 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2021-11-22 20:04:32,438 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2021-11-22 20:04:32,438 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2021-11-22 20:04:32,439 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2021-11-22 20:04:32,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-22 20:04:32,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-22 20:04:32,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-22 20:04:33,959 INFO L854 garLoopResultBuilder]: At program point L250(lines 248 251) the Hoare annotation is: (and (= |ULTIMATE.start_aws_mul_u64_checked_~b#1| 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| |ULTIMATE.start_aws_add_u64_checked_~r#1.offset|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| |ULTIMATE.start_aws_mul_u64_checked_~a#1|) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_add_u64_checked_~r#1.base|) (= |ULTIMATE.start_aws_mul_u64_checked_~r#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| |ULTIMATE.start_aws_mul_u64_checked_~r#1.offset|) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (exists ((|ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base| Int)) (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) 0))) (and (= (* 24 |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1|) .cse0) (= |ULTIMATE.start_aws_add_u64_checked_~a#1| .cse0)))) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) 1) (not (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) (= (* 24 |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1|) (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset|)) (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|) (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (= (+ |ULTIMATE.start_aws_add_u64_checked_~b#1| 29629528) 0) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|)) (not (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) 1)) [2021-11-22 20:04:33,959 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:04:33,960 INFO L858 garLoopResultBuilder]: For program point L7385-1(lines 7385 7387) no Hoare annotation was computed. [2021-11-22 20:04:33,960 INFO L858 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-11-22 20:04:33,960 INFO L858 garLoopResultBuilder]: For program point L10028(lines 10028 10032) no Hoare annotation was computed. [2021-11-22 20:04:33,960 INFO L858 garLoopResultBuilder]: For program point L10028-1(lines 10028 10032) no Hoare annotation was computed. [2021-11-22 20:04:33,960 INFO L858 garLoopResultBuilder]: For program point L10028-2(lines 10028 10032) no Hoare annotation was computed. [2021-11-22 20:04:33,960 INFO L858 garLoopResultBuilder]: For program point L10028-3(lines 10028 10032) no Hoare annotation was computed. [2021-11-22 20:04:33,960 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-22 20:04:33,960 INFO L858 garLoopResultBuilder]: For program point L6825-2(lines 6825 6827) no Hoare annotation was computed. [2021-11-22 20:04:33,960 INFO L854 garLoopResultBuilder]: At program point L2630(lines 2626 2631) the Hoare annotation is: (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|) (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| 0) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) 1)) [2021-11-22 20:04:33,960 INFO L858 garLoopResultBuilder]: For program point L6825(lines 6825 6827) no Hoare annotation was computed. [2021-11-22 20:04:33,961 INFO L854 garLoopResultBuilder]: At program point L2630-2(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:04:33,961 INFO L854 garLoopResultBuilder]: At program point L2630-1(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:04:33,961 INFO L858 garLoopResultBuilder]: For program point L2498(lines 2498 2499) no Hoare annotation was computed. [2021-11-22 20:04:33,961 INFO L854 garLoopResultBuilder]: At program point L2630-4(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:04:33,961 INFO L854 garLoopResultBuilder]: At program point L2630-3(lines 2626 2631) the Hoare annotation is: false [2021-11-22 20:04:33,961 INFO L858 garLoopResultBuilder]: For program point L9947(lines 9947 9949) no Hoare annotation was computed. [2021-11-22 20:04:33,961 INFO L858 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2021-11-22 20:04:33,961 INFO L854 garLoopResultBuilder]: At program point L6843(lines 6837 6844) the Hoare annotation is: false [2021-11-22 20:04:33,961 INFO L858 garLoopResultBuilder]: For program point L10131(lines 10131 10133) no Hoare annotation was computed. [2021-11-22 20:04:33,962 INFO L858 garLoopResultBuilder]: For program point L9933(lines 9933 9958) no Hoare annotation was computed. [2021-11-22 20:04:33,962 INFO L858 garLoopResultBuilder]: For program point L7175(lines 7175 7183) no Hoare annotation was computed. [2021-11-22 20:04:33,962 INFO L854 garLoopResultBuilder]: At program point L2501(lines 2497 2502) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_mul_u64_checked_~b#1| 24)) (.cse1 (= |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|)) (.cse2 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| |ULTIMATE.start_aws_mul_u64_checked_~a#1|)) (.cse4 (= |ULTIMATE.start_aws_mul_u64_checked_~r#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (.cse5 (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4)) (.cse6 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| |ULTIMATE.start_aws_mul_u64_checked_~r#1.offset|)) (.cse8 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|))) (.cse9 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.base|)) (.cse10 (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) 1)) (.cse11 (not (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base| 0))) (.cse12 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|)) (.cse13 (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18|) 0))) (.cse14 (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|)) (.cse15 (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| 0)) (.cse16 (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1)) (.cse17 (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4)) (.cse18 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|))) (.cse19 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|)) (.cse20 (not (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|))) (.cse21 (= (select |#valid| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (* 24 |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1|) (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset|)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and (<= (+ |ULTIMATE.start_aws_raise_error_#res#1| 1) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ |ULTIMATE.start_aws_mul_u64_checked_#res#1| 1) 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2021-11-22 20:04:33,962 INFO L854 garLoopResultBuilder]: At program point L255(lines 253 256) the Hoare annotation is: (and (= |ULTIMATE.start_aws_mul_u64_checked_~b#1| 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| |ULTIMATE.start_aws_mul_u64_checked_~a#1|) (= |ULTIMATE.start_aws_mul_u64_checked_~r#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| |ULTIMATE.start_aws_mul_u64_checked_~r#1.offset|) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) 1) (not (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18|) 0)) (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|) (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|)) (not (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) 1)) [2021-11-22 20:04:33,962 INFO L858 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:04:33,962 INFO L858 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:04:33,962 INFO L858 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:04:33,962 INFO L858 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:04:33,963 INFO L858 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-11-22 20:04:33,963 INFO L854 garLoopResultBuilder]: At program point L2617(lines 2613 2621) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|))) (.cse1 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|)) (.cse2 (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) 1)) (.cse3 (not (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base| 0))) (.cse4 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|)) (.cse5 (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|)) (.cse6 (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| 0)) (.cse7 (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1)) (.cse8 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|))) (.cse9 (not (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|))) (.cse10 (= (select |#valid| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) 1))) (or (and (<= (+ |ULTIMATE.start_aws_raise_error_#res#1| 1) 0) (<= (+ |ULTIMATE.start_aws_add_u64_checked_#res#1| 1) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ |ULTIMATE.start_aws_add_size_checked_#res#1| 1) 0) .cse8 .cse9 .cse10) (and (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) .cse0 .cse1 .cse2 (= (* 24 |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1|) (+ 29629528 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|))) .cse3 .cse4 .cse5 .cse6 .cse7 (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) .cse8 .cse9 .cse10))) [2021-11-22 20:04:33,963 INFO L858 garLoopResultBuilder]: For program point L7407-4(lines 7407 7409) no Hoare annotation was computed. [2021-11-22 20:04:33,963 INFO L854 garLoopResultBuilder]: At program point L7407-3(lines 7407 7409) the Hoare annotation is: false [2021-11-22 20:04:33,963 INFO L858 garLoopResultBuilder]: For program point L7407-2(lines 7407 7409) no Hoare annotation was computed. [2021-11-22 20:04:33,963 INFO L858 garLoopResultBuilder]: For program point L7176(lines 7176 7182) no Hoare annotation was computed. [2021-11-22 20:04:33,963 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-22 20:04:33,963 INFO L858 garLoopResultBuilder]: For program point L10017-5(line 10017) no Hoare annotation was computed. [2021-11-22 20:04:33,964 INFO L854 garLoopResultBuilder]: At program point L10017-6(lines 10015 10018) the Hoare annotation is: false [2021-11-22 20:04:33,964 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-22 20:04:33,964 INFO L858 garLoopResultBuilder]: For program point L10017-7(line 10017) no Hoare annotation was computed. [2021-11-22 20:04:33,964 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-22 20:04:33,964 INFO L858 garLoopResultBuilder]: For program point L10017(line 10017) no Hoare annotation was computed. [2021-11-22 20:04:33,964 INFO L858 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-22 20:04:33,964 INFO L858 garLoopResultBuilder]: For program point L10017-2(line 10017) no Hoare annotation was computed. [2021-11-22 20:04:33,964 INFO L858 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-22 20:04:33,964 INFO L858 garLoopResultBuilder]: For program point L10017-3(line 10017) no Hoare annotation was computed. [2021-11-22 20:04:33,964 INFO L858 garLoopResultBuilder]: For program point L10017-12(line 10017) no Hoare annotation was computed. [2021-11-22 20:04:33,965 INFO L858 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-22 20:04:33,965 INFO L854 garLoopResultBuilder]: At program point L10017-13(lines 10015 10018) the Hoare annotation is: false [2021-11-22 20:04:33,965 INFO L858 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-22 20:04:33,965 INFO L858 garLoopResultBuilder]: For program point L10017-14(line 10017) no Hoare annotation was computed. [2021-11-22 20:04:33,965 INFO L858 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-11-22 20:04:33,965 INFO L858 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-11-22 20:04:33,965 INFO L858 garLoopResultBuilder]: For program point L10017-9(line 10017) no Hoare annotation was computed. [2021-11-22 20:04:33,965 INFO L858 garLoopResultBuilder]: For program point L10017-10(line 10017) no Hoare annotation was computed. [2021-11-22 20:04:33,965 INFO L858 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-11-22 20:04:33,965 INFO L858 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-11-22 20:04:33,966 INFO L854 garLoopResultBuilder]: At program point L10017-20(lines 10015 10018) the Hoare annotation is: false [2021-11-22 20:04:33,966 INFO L858 garLoopResultBuilder]: For program point L10017-21(line 10017) no Hoare annotation was computed. [2021-11-22 20:04:33,966 INFO L858 garLoopResultBuilder]: For program point L10017-23(line 10017) no Hoare annotation was computed. [2021-11-22 20:04:33,966 INFO L858 garLoopResultBuilder]: For program point L10017-16(line 10017) no Hoare annotation was computed. [2021-11-22 20:04:33,966 INFO L858 garLoopResultBuilder]: For program point L10017-17(line 10017) no Hoare annotation was computed. [2021-11-22 20:04:33,966 INFO L858 garLoopResultBuilder]: For program point L10017-19(line 10017) no Hoare annotation was computed. [2021-11-22 20:04:33,966 INFO L858 garLoopResultBuilder]: For program point L10017-24(line 10017) no Hoare annotation was computed. [2021-11-22 20:04:33,966 INFO L858 garLoopResultBuilder]: For program point L10017-26(line 10017) no Hoare annotation was computed. [2021-11-22 20:04:33,966 INFO L854 garLoopResultBuilder]: At program point L10017-27(lines 10015 10018) the Hoare annotation is: false [2021-11-22 20:04:33,967 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:04:33,967 INFO L854 garLoopResultBuilder]: At program point L6947(lines 6943 6948) the Hoare annotation is: false [2021-11-22 20:04:33,967 INFO L858 garLoopResultBuilder]: For program point L10135(lines 10135 10137) no Hoare annotation was computed. [2021-11-22 20:04:33,967 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:04:33,967 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-22 20:04:33,967 INFO L858 garLoopResultBuilder]: For program point L9938(line 9938) no Hoare annotation was computed. [2021-11-22 20:04:33,967 INFO L854 garLoopResultBuilder]: At program point L7411(lines 7397 7412) the Hoare annotation is: false [2021-11-22 20:04:33,967 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:04:33,967 INFO L858 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:04:33,968 INFO L858 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:04:33,968 INFO L858 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:04:33,968 INFO L858 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:04:33,968 INFO L854 garLoopResultBuilder]: At program point L6833(lines 6831 6834) the Hoare annotation is: false [2021-11-22 20:04:33,968 INFO L858 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:04:33,968 INFO L858 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:04:33,968 INFO L858 garLoopResultBuilder]: For program point L9938-2(lines 9938 9951) no Hoare annotation was computed. [2021-11-22 20:04:33,968 INFO L858 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:04:33,968 INFO L858 garLoopResultBuilder]: For program point L9938-3(lines 9938 9951) no Hoare annotation was computed. [2021-11-22 20:04:33,968 INFO L858 garLoopResultBuilder]: For program point L210-8(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:04:33,969 INFO L858 garLoopResultBuilder]: For program point L210-9(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:04:33,969 INFO L858 garLoopResultBuilder]: For program point L210-10(lines 210 212) no Hoare annotation was computed. [2021-11-22 20:04:33,969 INFO L854 garLoopResultBuilder]: At program point L10071-2(lines 10026 10073) the Hoare annotation is: false [2021-11-22 20:04:33,969 INFO L854 garLoopResultBuilder]: At program point L10071-3(lines 10026 10073) the Hoare annotation is: false [2021-11-22 20:04:33,969 INFO L858 garLoopResultBuilder]: For program point L9939-1(lines 9939 9950) no Hoare annotation was computed. [2021-11-22 20:04:33,969 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:04:33,969 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-22 20:04:33,969 INFO L854 garLoopResultBuilder]: At program point L10071(lines 10026 10073) the Hoare annotation is: false [2021-11-22 20:04:33,969 INFO L854 garLoopResultBuilder]: At program point L10071-1(lines 10026 10073) the Hoare annotation is: false [2021-11-22 20:04:33,970 INFO L858 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-22 20:04:33,970 INFO L858 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-22 20:04:33,970 INFO L861 garLoopResultBuilder]: At program point L10154(line 10154) the Hoare annotation is: true [2021-11-22 20:04:33,970 INFO L858 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-11-22 20:04:33,970 INFO L854 garLoopResultBuilder]: At program point L9939-3(lines 9939 9950) the Hoare annotation is: false [2021-11-22 20:04:33,970 INFO L858 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-11-22 20:04:33,970 INFO L854 garLoopResultBuilder]: At program point L9939-4(lines 9939 9950) the Hoare annotation is: false [2021-11-22 20:04:33,970 INFO L858 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-11-22 20:04:33,970 INFO L858 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-11-22 20:04:33,970 INFO L854 garLoopResultBuilder]: At program point L261(line 261) the Hoare annotation is: false [2021-11-22 20:04:33,971 INFO L858 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-11-22 20:04:33,971 INFO L854 garLoopResultBuilder]: At program point L261-1(line 261) the Hoare annotation is: false [2021-11-22 20:04:33,971 INFO L858 garLoopResultBuilder]: For program point L211-16(line 211) no Hoare annotation was computed. [2021-11-22 20:04:33,971 INFO L858 garLoopResultBuilder]: For program point L211-18(line 211) no Hoare annotation was computed. [2021-11-22 20:04:33,971 INFO L854 garLoopResultBuilder]: At program point L2590(lines 2586 2594) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_mul_u64_checked_~b#1| 24)) (.cse1 (= |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|)) (.cse2 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| |ULTIMATE.start_aws_mul_u64_checked_~a#1|)) (.cse4 (= |ULTIMATE.start_aws_mul_u64_checked_~r#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (.cse5 (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4)) (.cse6 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| |ULTIMATE.start_aws_mul_u64_checked_~r#1.offset|)) (.cse8 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|))) (.cse9 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.base|)) (.cse10 (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) 1)) (.cse11 (not (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base| 0))) (.cse12 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|)) (.cse13 (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18|) 0))) (.cse14 (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|)) (.cse15 (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| 0)) (.cse16 (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1)) (.cse17 (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4)) (.cse18 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|))) (.cse19 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|)) (.cse20 (not (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|))) (.cse21 (= (select |#valid| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (* 24 |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1|) (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset|)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and (<= (+ |ULTIMATE.start_aws_raise_error_#res#1| 1) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ |ULTIMATE.start_aws_mul_u64_checked_#res#1| 1) 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= (+ |ULTIMATE.start_aws_mul_size_checked_#res#1| 1) 0) .cse18 .cse19 .cse20 .cse21))) [2021-11-22 20:04:33,971 INFO L858 garLoopResultBuilder]: For program point L211-20(line 211) no Hoare annotation was computed. [2021-11-22 20:04:33,971 INFO L858 garLoopResultBuilder]: For program point L6852-1(line 6852) no Hoare annotation was computed. [2021-11-22 20:04:33,971 INFO L858 garLoopResultBuilder]: For program point L6852(line 6852) no Hoare annotation was computed. [2021-11-22 20:04:33,972 INFO L854 garLoopResultBuilder]: At program point L10139(lines 10128 10140) the Hoare annotation is: (let ((.cse0 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|)) (.cse1 (not (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base| 0))) (.cse2 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|)) (.cse3 (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|)) (.cse4 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|))) (.cse5 (= (select |#valid| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) 1))) (or (and (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) .cse0 (= (* 24 |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1|) (+ 29629528 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|))) (= |ULTIMATE.start_hash_table_state_required_bytes_#res#1| 0) .cse1 .cse2 .cse3 (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (<= (+ |ULTIMATE.start_hash_table_state_required_bytes_#res#1| 1) 0) .cse4 .cse5))) [2021-11-22 20:04:33,972 INFO L858 garLoopResultBuilder]: For program point L9941(lines 9941 9943) no Hoare annotation was computed. [2021-11-22 20:04:33,972 INFO L858 garLoopResultBuilder]: For program point L2542(lines 2542 2543) no Hoare annotation was computed. [2021-11-22 20:04:33,972 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-22 20:04:33,972 INFO L854 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: false [2021-11-22 20:04:33,972 INFO L854 garLoopResultBuilder]: At program point L-1-2(line -1) the Hoare annotation is: false [2021-11-22 20:04:33,972 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 20:04:33,972 INFO L854 garLoopResultBuilder]: At program point L7415(lines 7414 7416) the Hoare annotation is: false [2021-11-22 20:04:33,973 INFO L854 garLoopResultBuilder]: At program point L1998(lines 1988 1999) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_aws_raise_error_#res#1| 1) 0) (= |ULTIMATE.start_aws_mul_u64_checked_~b#1| 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| |ULTIMATE.start_aws_mul_u64_checked_~a#1|) (= |ULTIMATE.start_aws_mul_u64_checked_~r#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| |ULTIMATE.start_aws_mul_u64_checked_~r#1.offset|) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) 1) (not (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18|) 0)) (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|) (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|)) (not (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) 1)) [2021-11-22 20:04:33,973 INFO L854 garLoopResultBuilder]: At program point L1998-1(lines 1988 1999) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_aws_raise_error_#res#1| 1) 0) (= |ULTIMATE.start_aws_mul_u64_checked_~b#1| 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| |ULTIMATE.start_aws_mul_u64_checked_~a#1|) (= |ULTIMATE.start_aws_mul_u64_checked_~r#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.offset| |ULTIMATE.start_aws_mul_u64_checked_~r#1.offset|) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~required_bytes#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) 1) (not (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|) (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|)) (not (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) 1)) [2021-11-22 20:04:33,973 INFO L858 garLoopResultBuilder]: For program point L6821(lines 6821 6828) no Hoare annotation was computed. [2021-11-22 20:04:33,973 INFO L858 garLoopResultBuilder]: For program point L10141(lines 10141 10153) no Hoare annotation was computed. [2021-11-22 20:04:33,973 INFO L858 garLoopResultBuilder]: For program point L7185(lines 7185 7187) no Hoare annotation was computed. [2021-11-22 20:04:33,973 INFO L858 garLoopResultBuilder]: For program point L6822(lines 6822 6824) no Hoare annotation was computed. [2021-11-22 20:04:33,973 INFO L858 garLoopResultBuilder]: For program point L6822-2(lines 6822 6824) no Hoare annotation was computed. [2021-11-22 20:04:33,973 INFO L858 garLoopResultBuilder]: For program point L9944(lines 9944 9946) no Hoare annotation was computed. [2021-11-22 20:04:33,974 INFO L858 garLoopResultBuilder]: For program point L9944-2(lines 9944 9946) no Hoare annotation was computed. [2021-11-22 20:04:33,974 INFO L854 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|))) (.cse1 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|)) (.cse2 (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|) 1)) (.cse3 (not (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base| 0))) (.cse4 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|)) (.cse5 (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|)) (.cse6 (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| 0)) (.cse7 (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1)) (.cse8 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|))) (.cse9 (not (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base|))) (.cse10 (= (select |#valid| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) 1))) (or (and (<= (+ |ULTIMATE.start_aws_raise_error_#res#1| 1) 0) (<= (+ |ULTIMATE.start_aws_add_u64_checked_#res#1| 1) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) .cse0 .cse1 .cse2 (= (* 24 |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1|) (+ 29629528 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|))) .cse3 .cse4 .cse5 .cse6 .cse7 (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) .cse8 .cse9 .cse10))) [2021-11-22 20:04:33,974 INFO L854 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|) (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) 1)) [2021-11-22 20:04:33,974 INFO L854 garLoopResultBuilder]: At program point L266-1(line 266) the Hoare annotation is: false [2021-11-22 20:04:33,974 INFO L854 garLoopResultBuilder]: At program point L266-2(line 266) the Hoare annotation is: false [2021-11-22 20:04:33,981 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:04:33,982 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-22 20:04:34,010 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] [2021-11-22 20:04:34,012 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] [2021-11-22 20:04:34,013 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] [2021-11-22 20:04:34,016 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] [2021-11-22 20:04:34,018 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] [2021-11-22 20:04:34,024 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] [2021-11-22 20:04:34,027 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] [2021-11-22 20:04:34,027 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] [2021-11-22 20:04:34,029 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] [2021-11-22 20:04:34,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] [2021-11-22 20:04:34,031 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] [2021-11-22 20:04:34,031 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] [2021-11-22 20:04:34,032 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base,QUANTIFIED] [2021-11-22 20:04:34,032 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base,QUANTIFIED] [2021-11-22 20:04:34,032 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base,QUANTIFIED] [2021-11-22 20:04:34,032 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base,QUANTIFIED] [2021-11-22 20:04:34,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 08:04:34 BoogieIcfgContainer [2021-11-22 20:04:34,034 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-22 20:04:34,035 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 20:04:34,035 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 20:04:34,035 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 20:04:34,036 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:04:16" (3/4) ... [2021-11-22 20:04:34,038 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-22 20:04:34,063 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 209 nodes and edges [2021-11-22 20:04:34,064 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 71 nodes and edges [2021-11-22 20:04:34,065 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2021-11-22 20:04:34,066 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-22 20:04:34,067 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-22 20:04:34,068 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-22 20:04:34,069 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-22 20:04:34,070 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-22 20:04:34,093 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((b == 24 && required_bytes == required_bytes) && elemsize == 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && required_bytes == required_bytes) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[elemsize] == 1) && !(map == 0)) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18] == 0)) && map == map) && map == 0) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) && !(map == elemsize)) && \valid[map] == 1 [2021-11-22 20:04:34,094 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((b == 24 && required_bytes == required_bytes) && elemsize == 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && required_bytes == required_bytes) && \valid[elemsize] == 1) && !(map == 0)) && map == map) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18] == 0)) && map == map) && map == 0) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) && unknown-#StackHeapBarrier-unknown < map) && !(map == elemsize)) && \valid[map] == 1) || (((((((((((((((((((((((\result + 1 <= 0 && b == 24) && required_bytes == required_bytes) && elemsize == 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && \result + 1 <= 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && !(map == 0)) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18] == 0)) && map == map) && map == 0) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) && unknown-#StackHeapBarrier-unknown < map) && !(map == elemsize)) && \valid[map] == 1) [2021-11-22 20:04:34,094 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((b == 24 && required_bytes == required_bytes) && elemsize == 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && required_bytes == required_bytes) && \valid[elemsize] == 1) && !(map == 0)) && map == map) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18] == 0)) && map == map) && map == 0) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) && unknown-#StackHeapBarrier-unknown < map) && !(map == elemsize)) && \valid[map] == 1) || ((((((((((((((((((((((((\result + 1 <= 0 && b == 24) && required_bytes == required_bytes) && elemsize == 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && \result + 1 <= 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && !(map == 0)) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18] == 0)) && map == map) && map == 0) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 4) && \result + 1 <= 0) && !(required_bytes == map)) && unknown-#StackHeapBarrier-unknown < map) && !(map == elemsize)) && \valid[map] == 1) [2021-11-22 20:04:34,094 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((\result + 1 <= 0 && b == 24) && required_bytes == required_bytes) && elemsize == 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && required_bytes == required_bytes) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[elemsize] == 1) && !(map == 0)) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18] == 0)) && map == map) && map == 0) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) && !(map == elemsize)) && \valid[map] == 1 [2021-11-22 20:04:34,094 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((required_bytes == 0 && unknown-#StackHeapBarrier-unknown + 1 <= map) && 24 * num_entries == 29629528 + unknown-#memory_int-unknown[required_bytes][required_bytes]) && \result == 0) && !(map == 0)) && map == map) && map == map) && map == 0) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) && \valid[map] == 1) || ((((((unknown-#StackHeapBarrier-unknown + 1 <= map && !(map == 0)) && map == map) && map == map) && \result + 1 <= 0) && !(required_bytes == map)) && \valid[map] == 1) [2021-11-22 20:04:34,094 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((b == 24 && required_bytes == required_bytes) && required_bytes == r) && elemsize == 0) && num_entries == a) && required_bytes == r) && r == elemsize) && max_table_entries == 4) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && (\exists ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base : int :: 24 * num_entries == unknown-#memory_int-unknown[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base][0] && a == unknown-#memory_int-unknown[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base][0])) && required_bytes == required_bytes) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[elemsize] == 1) && !(map == 0)) && map == map) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && map == map) && map == 0) && \valid[required_bytes] == 1) && b + 29629528 == 0) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) && !(map == elemsize)) && \valid[map] == 1 [2021-11-22 20:04:34,096 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((\result + 1 <= 0 && \result + 1 <= 0) && !(required_bytes == elemsize)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[elemsize] == 1) && !(map == 0)) && map == map) && map == map) && map == 0) && \valid[required_bytes] == 1) && !(required_bytes == map)) && !(map == elemsize)) && \valid[map] == 1) || (((((((((((((required_bytes == 0 && !(required_bytes == elemsize)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[elemsize] == 1) && 24 * num_entries == 29629528 + unknown-#memory_int-unknown[required_bytes][required_bytes]) && !(map == 0)) && map == map) && map == map) && map == 0) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) && !(map == elemsize)) && \valid[map] == 1) [2021-11-22 20:04:34,096 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((\result + 1 <= 0 && \result + 1 <= 0) && !(required_bytes == elemsize)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[elemsize] == 1) && !(map == 0)) && map == map) && map == map) && map == 0) && \valid[required_bytes] == 1) && \result + 1 <= 0) && !(required_bytes == map)) && !(map == elemsize)) && \valid[map] == 1) || (((((((((((((required_bytes == 0 && !(required_bytes == elemsize)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[elemsize] == 1) && 24 * num_entries == 29629528 + unknown-#memory_int-unknown[required_bytes][required_bytes]) && !(map == 0)) && map == map) && map == map) && map == 0) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) && !(map == elemsize)) && \valid[map] == 1) [2021-11-22 20:04:34,096 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result + 1 <= 0 && b == 24) && required_bytes == required_bytes) && elemsize == 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && required_bytes == required_bytes) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[elemsize] == 1) && !(map == 0)) && map == map) && map == map) && map == 0) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) && !(map == elemsize)) && \valid[map] == 1 [2021-11-22 20:04:34,560 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-22 20:04:34,560 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 20:04:34,563 INFO L158 Benchmark]: Toolchain (without parser) took 21606.23ms. Allocated memory was 94.4MB in the beginning and 352.3MB in the end (delta: 257.9MB). Free memory was 55.4MB in the beginning and 89.9MB in the end (delta: -34.4MB). Peak memory consumption was 260.3MB. Max. memory is 16.1GB. [2021-11-22 20:04:34,563 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 77.6MB. Free memory was 36.0MB in the beginning and 36.0MB in the end (delta: 27.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 20:04:34,563 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2067.54ms. Allocated memory was 94.4MB in the beginning and 130.0MB in the end (delta: 35.7MB). Free memory was 55.4MB in the beginning and 45.7MB in the end (delta: 9.7MB). Peak memory consumption was 62.6MB. Max. memory is 16.1GB. [2021-11-22 20:04:34,563 INFO L158 Benchmark]: Boogie Procedure Inliner took 180.89ms. Allocated memory is still 130.0MB. Free memory was 45.7MB in the beginning and 66.1MB in the end (delta: -20.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-22 20:04:34,564 INFO L158 Benchmark]: Boogie Preprocessor took 81.86ms. Allocated memory is still 130.0MB. Free memory was 66.1MB in the beginning and 59.1MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-22 20:04:34,564 INFO L158 Benchmark]: RCFGBuilder took 1017.53ms. Allocated memory was 130.0MB in the beginning and 159.4MB in the end (delta: 29.4MB). Free memory was 59.1MB in the beginning and 58.0MB in the end (delta: 1.1MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2021-11-22 20:04:34,564 INFO L158 Benchmark]: TraceAbstraction took 17728.31ms. Allocated memory was 159.4MB in the beginning and 352.3MB in the end (delta: 192.9MB). Free memory was 58.0MB in the beginning and 247.8MB in the end (delta: -189.9MB). Peak memory consumption was 175.9MB. Max. memory is 16.1GB. [2021-11-22 20:04:34,564 INFO L158 Benchmark]: Witness Printer took 525.40ms. Allocated memory is still 352.3MB. Free memory was 247.8MB in the beginning and 89.9MB in the end (delta: 158.0MB). Peak memory consumption was 195.7MB. Max. memory is 16.1GB. [2021-11-22 20:04:34,565 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.16ms. Allocated memory is still 77.6MB. Free memory was 36.0MB in the beginning and 36.0MB in the end (delta: 27.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2067.54ms. Allocated memory was 94.4MB in the beginning and 130.0MB in the end (delta: 35.7MB). Free memory was 55.4MB in the beginning and 45.7MB in the end (delta: 9.7MB). Peak memory consumption was 62.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 180.89ms. Allocated memory is still 130.0MB. Free memory was 45.7MB in the beginning and 66.1MB in the end (delta: -20.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.86ms. Allocated memory is still 130.0MB. Free memory was 66.1MB in the beginning and 59.1MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1017.53ms. Allocated memory was 130.0MB in the beginning and 159.4MB in the end (delta: 29.4MB). Free memory was 59.1MB in the beginning and 58.0MB in the end (delta: 1.1MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * TraceAbstraction took 17728.31ms. Allocated memory was 159.4MB in the beginning and 352.3MB in the end (delta: 192.9MB). Free memory was 58.0MB in the beginning and 247.8MB in the end (delta: -189.9MB). Peak memory consumption was 175.9MB. Max. memory is 16.1GB. * Witness Printer took 525.40ms. Allocated memory is still 352.3MB. Free memory was 247.8MB in the beginning and 89.9MB in the end (delta: 158.0MB). Peak memory consumption was 195.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base,QUANTIFIED] * 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 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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 1 procedures, 133 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 17.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1519 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1519 mSDsluCounter, 6710 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 103 IncrementalHoareTripleChecker+Unchecked, 4960 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1097 IncrementalHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 1750 mSDtfsCounter, 1097 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 419 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=11, InterpolantAutomatonStates: 98, 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, 13 MinimizatonAttempts, 138 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 38 LocationsWithAnnotation, 38 PreInvPairs, 54 NumberOfFragments, 1169 HoareAnnotationTreeSize, 38 FomulaSimplifications, 48 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 38 FomulaSimplificationsInter, 748 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 7.3s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 827 NumberOfCodeBlocks, 827 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 814 ConstructedInterpolants, 9 QuantifiedInterpolants, 4666 SizeOfPredicates, 113 NumberOfNonLiveVariables, 11647 ConjunctsInSsa, 378 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 2613]: Loop Invariant Derived loop invariant: (((((((((((((\result + 1 <= 0 && \result + 1 <= 0) && !(required_bytes == elemsize)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[elemsize] == 1) && !(map == 0)) && map == map) && map == map) && map == 0) && \valid[required_bytes] == 1) && \result + 1 <= 0) && !(required_bytes == map)) && !(map == elemsize)) && \valid[map] == 1) || (((((((((((((required_bytes == 0 && !(required_bytes == elemsize)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[elemsize] == 1) && 24 * num_entries == 29629528 + unknown-#memory_int-unknown[required_bytes][required_bytes]) && !(map == 0)) && map == map) && map == map) && map == 0) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) && !(map == elemsize)) && \valid[map] == 1) - InvariantResult [Line: 9939]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2497]: Loop Invariant [2021-11-22 20:04:34,572 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] [2021-11-22 20:04:34,572 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] [2021-11-22 20:04:34,573 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] [2021-11-22 20:04:34,573 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((b == 24 && required_bytes == required_bytes) && elemsize == 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && required_bytes == required_bytes) && \valid[elemsize] == 1) && !(map == 0)) && map == map) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18] == 0)) && map == map) && map == 0) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) && unknown-#StackHeapBarrier-unknown < map) && !(map == elemsize)) && \valid[map] == 1) || (((((((((((((((((((((((\result + 1 <= 0 && b == 24) && required_bytes == required_bytes) && elemsize == 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && \result + 1 <= 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && !(map == 0)) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18] == 0)) && map == map) && map == 0) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) && unknown-#StackHeapBarrier-unknown < map) && !(map == elemsize)) && \valid[map] == 1) - InvariantResult [Line: 7414]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10154]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9939]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10015]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10015]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: (((((max_table_entries == 4 && unknown-#StackHeapBarrier-unknown + 1 <= map) && !(map == 0)) && map == map) && map == map) && map == 0) && \valid[map] == 1 - InvariantResult [Line: 6837]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10026]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result + 1 <= 0 && b == 24) && required_bytes == required_bytes) && elemsize == 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && required_bytes == required_bytes) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[elemsize] == 1) && !(map == 0)) && map == map) && map == map) && map == 0) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) && !(map == elemsize)) && \valid[map] == 1 - InvariantResult [Line: 1988]: Loop Invariant [2021-11-22 20:04:34,575 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] [2021-11-22 20:04:34,576 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((\result + 1 <= 0 && b == 24) && required_bytes == required_bytes) && elemsize == 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && required_bytes == required_bytes) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[elemsize] == 1) && !(map == 0)) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18] == 0)) && map == map) && map == 0) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) && !(map == elemsize)) && \valid[map] == 1 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 253]: Loop Invariant [2021-11-22 20:04:34,576 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] [2021-11-22 20:04:34,577 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((b == 24 && required_bytes == required_bytes) && elemsize == 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && required_bytes == required_bytes) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[elemsize] == 1) && !(map == 0)) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18] == 0)) && map == map) && map == 0) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) && !(map == elemsize)) && \valid[map] == 1 - InvariantResult [Line: 10128]: Loop Invariant Derived loop invariant: (((((((((((required_bytes == 0 && unknown-#StackHeapBarrier-unknown + 1 <= map) && 24 * num_entries == 29629528 + unknown-#memory_int-unknown[required_bytes][required_bytes]) && \result == 0) && !(map == 0)) && map == map) && map == map) && map == 0) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) && \valid[map] == 1) || ((((((unknown-#StackHeapBarrier-unknown + 1 <= map && !(map == 0)) && map == map) && map == map) && \result + 1 <= 0) && !(required_bytes == map)) && \valid[map] == 1) - InvariantResult [Line: 10015]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2586]: Loop Invariant [2021-11-22 20:04:34,578 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] [2021-11-22 20:04:34,578 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] [2021-11-22 20:04:34,578 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] [2021-11-22 20:04:34,579 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((b == 24 && required_bytes == required_bytes) && elemsize == 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && required_bytes == required_bytes) && \valid[elemsize] == 1) && !(map == 0)) && map == map) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18] == 0)) && map == map) && map == 0) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) && unknown-#StackHeapBarrier-unknown < map) && !(map == elemsize)) && \valid[map] == 1) || ((((((((((((((((((((((((\result + 1 <= 0 && b == 24) && required_bytes == required_bytes) && elemsize == 0) && num_entries == a) && r == elemsize) && max_table_entries == 4) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && \result + 1 <= 0) && required_bytes == required_bytes) && \valid[elemsize] == 1) && !(map == 0)) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1#1.base_18] == 0)) && map == map) && map == 0) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 4) && \result + 1 <= 0) && !(required_bytes == map)) && unknown-#StackHeapBarrier-unknown < map) && !(map == elemsize)) && \valid[map] == 1) - InvariantResult [Line: 248]: Loop Invariant [2021-11-22 20:04:34,579 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base,QUANTIFIED] [2021-11-22 20:04:34,579 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base,QUANTIFIED] [2021-11-22 20:04:34,580 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base,QUANTIFIED] [2021-11-22 20:04:34,580 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((b == 24 && required_bytes == required_bytes) && required_bytes == r) && elemsize == 0) && num_entries == a) && required_bytes == r) && r == elemsize) && max_table_entries == 4) && required_bytes == 0) && elemsize == r) && !(required_bytes == elemsize)) && (\exists ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base : int :: 24 * num_entries == unknown-#memory_int-unknown[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base][0] && a == unknown-#memory_int-unknown[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0#1.base][0])) && required_bytes == required_bytes) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[elemsize] == 1) && !(map == 0)) && map == map) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && map == map) && map == 0) && \valid[required_bytes] == 1) && b + 29629528 == 0) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) && !(map == elemsize)) && \valid[map] == 1 - InvariantResult [Line: 6943]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7407]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6831]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10015]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10026]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: (((((((cond == 1 && max_table_entries == 4) && unknown-#StackHeapBarrier-unknown + 1 <= map) && !(map == 0)) && map == map) && map == map) && map == 0) && num_entries % 18446744073709551616 <= 4) && \valid[map] == 1 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10026]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10026]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: ((((((((((((\result + 1 <= 0 && \result + 1 <= 0) && !(required_bytes == elemsize)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[elemsize] == 1) && !(map == 0)) && map == map) && map == map) && map == 0) && \valid[required_bytes] == 1) && !(required_bytes == map)) && !(map == elemsize)) && \valid[map] == 1) || (((((((((((((required_bytes == 0 && !(required_bytes == elemsize)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && \valid[elemsize] == 1) && 24 * num_entries == 29629528 + unknown-#memory_int-unknown[required_bytes][required_bytes]) && !(map == 0)) && map == map) && map == map) && map == 0) && \valid[required_bytes] == 1) && num_entries % 18446744073709551616 <= 4) && !(required_bytes == map)) && !(map == elemsize)) && \valid[map] == 1) - InvariantResult [Line: 7397]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2021-11-22 20:04:34,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE