./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 173e3943 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_priority_queue_size_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 1baae56bade188786b6c048f5a5545dd6165460ea50e58a0310e4360c89d1838 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 11:41:51,940 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 11:41:51,943 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 11:41:51,993 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 11:41:51,994 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 11:41:51,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 11:41:51,998 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 11:41:52,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 11:41:52,004 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 11:41:52,008 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 11:41:52,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 11:41:52,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 11:41:52,010 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 11:41:52,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 11:41:52,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 11:41:52,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 11:41:52,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 11:41:52,021 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 11:41:52,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 11:41:52,025 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 11:41:52,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 11:41:52,029 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 11:41:52,030 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 11:41:52,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 11:41:52,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 11:41:52,038 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 11:41:52,038 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 11:41:52,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 11:41:52,041 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 11:41:52,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 11:41:52,042 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 11:41:52,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 11:41:52,043 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 11:41:52,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 11:41:52,044 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 11:41:52,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 11:41:52,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 11:41:52,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 11:41:52,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 11:41:52,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 11:41:52,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 11:41:52,047 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 11:41:52,077 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 11:41:52,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 11:41:52,078 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 11:41:52,078 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 11:41:52,079 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 11:41:52,079 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 11:41:52,080 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 11:41:52,080 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 11:41:52,080 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 11:41:52,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 11:41:52,081 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 11:41:52,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 11:41:52,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 11:41:52,081 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 11:41:52,081 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 11:41:52,082 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 11:41:52,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 11:41:52,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 11:41:52,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 11:41:52,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 11:41:52,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 11:41:52,082 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 11:41:52,083 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 11:41:52,083 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 11:41:52,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 11:41:52,083 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 11:41:52,083 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 11:41:52,083 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 11:41:52,084 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 11:41:52,084 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 -> 1baae56bade188786b6c048f5a5545dd6165460ea50e58a0310e4360c89d1838 [2021-11-06 11:41:52,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 11:41:52,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 11:41:52,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 11:41:52,335 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 11:41:52,336 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 11:41:52,336 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i [2021-11-06 11:41:52,396 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/968da07c6/42c70d3fbf7f458caa94c78114a5bca9/FLAGaafe64bb8 [2021-11-06 11:41:52,990 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 11:41:52,993 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i [2021-11-06 11:41:53,031 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/968da07c6/42c70d3fbf7f458caa94c78114a5bca9/FLAGaafe64bb8 [2021-11-06 11:41:53,198 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/968da07c6/42c70d3fbf7f458caa94c78114a5bca9 [2021-11-06 11:41:53,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 11:41:53,203 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 11:41:53,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 11:41:53,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 11:41:53,207 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 11:41:53,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:41:53" (1/1) ... [2021-11-06 11:41:53,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c66075c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:41:53, skipping insertion in model container [2021-11-06 11:41:53,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:41:53" (1/1) ... [2021-11-06 11:41:53,214 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 11:41:53,289 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 11:41:53,528 WARN L228 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_priority_queue_size_harness.i[4497,4510] [2021-11-06 11:41:53,540 WARN L228 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_priority_queue_size_harness.i[4557,4570] [2021-11-06 11:41:53,563 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 11:41:53,573 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 11:41:54,080 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 11:41:54,128 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:41:54,129 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:41:54,133 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:41:54,134 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:41:54,135 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:41:54,143 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:41:54,143 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:41:54,145 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:41:54,145 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:41:54,320 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 11:41:54,321 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 11:41:54,322 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 11:41:54,328 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 11:41:54,330 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 11:41:54,331 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 11:41:54,339 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 11:41:54,340 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 11:41:54,343 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 11:41:54,344 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 11:41:54,480 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:41:54,480 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:41:54,529 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 11:41:54,555 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 11:41:54,564 WARN L228 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_priority_queue_size_harness.i[4497,4510] [2021-11-06 11:41:54,565 WARN L228 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_priority_queue_size_harness.i[4557,4570] [2021-11-06 11:41:54,567 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 11:41:54,567 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 11:41:54,598 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 11:41:54,608 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:41:54,609 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:41:54,609 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:41:54,609 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:41:54,610 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:41:54,614 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:41:54,615 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:41:54,616 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:41:54,616 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:41:54,637 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 11:41:54,638 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 11:41:54,639 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 11:41:54,640 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 11:41:54,640 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 11:41:54,641 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 11:41:54,641 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 11:41:54,641 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 11:41:54,642 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 11:41:54,642 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 11:41:54,662 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:41:54,662 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:41:54,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 11:41:54,836 INFO L208 MainTranslator]: Completed translation [2021-11-06 11:41:54,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:41:54 WrapperNode [2021-11-06 11:41:54,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 11:41:54,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 11:41:54,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 11:41:54,838 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 11:41:54,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:41:54" (1/1) ... [2021-11-06 11:41:54,933 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:41:54" (1/1) ... [2021-11-06 11:41:55,027 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 11:41:55,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 11:41:55,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 11:41:55,029 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 11:41:55,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:41:54" (1/1) ... [2021-11-06 11:41:55,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:41:54" (1/1) ... [2021-11-06 11:41:55,058 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:41:54" (1/1) ... [2021-11-06 11:41:55,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:41:54" (1/1) ... [2021-11-06 11:41:55,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:41:54" (1/1) ... [2021-11-06 11:41:55,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:41:54" (1/1) ... [2021-11-06 11:41:55,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:41:54" (1/1) ... [2021-11-06 11:41:55,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 11:41:55,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 11:41:55,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 11:41:55,189 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 11:41:55,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:41:54" (1/1) ... [2021-11-06 11:41:55,195 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 11:41:55,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 11:41:55,226 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-06 11:41:55,258 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-06 11:41:55,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 11:41:55,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 11:41:55,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 11:41:55,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 11:41:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 11:41:55,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 11:41:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 11:41:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-06 11:41:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 11:41:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 11:41:55,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 11:41:55,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 11:42:02,901 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 11:42:02,901 INFO L299 CfgBuilder]: Removed 188 assume(true) statements. [2021-11-06 11:42:02,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:42:02 BoogieIcfgContainer [2021-11-06 11:42:02,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 11:42:02,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 11:42:02,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 11:42:02,907 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 11:42:02,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:41:53" (1/3) ... [2021-11-06 11:42:02,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d34c19b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:42:02, skipping insertion in model container [2021-11-06 11:42:02,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:41:54" (2/3) ... [2021-11-06 11:42:02,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d34c19b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:42:02, skipping insertion in model container [2021-11-06 11:42:02,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:42:02" (3/3) ... [2021-11-06 11:42:02,909 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_priority_queue_size_harness.i [2021-11-06 11:42:02,913 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 11:42:02,913 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2021-11-06 11:42:02,960 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 11:42:02,968 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-06 11:42:02,968 INFO L340 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2021-11-06 11:42:02,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 246 states, 231 states have (on average 1.4458874458874458) internal successors, (334), 245 states have internal predecessors, (334), 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-06 11:42:02,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-06 11:42:02,994 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:42:02,995 INFO L513 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] [2021-11-06 11:42:02,996 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:42:03,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:42:03,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1385932008, now seen corresponding path program 1 times [2021-11-06 11:42:03,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 11:42:03,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407283610] [2021-11-06 11:42:03,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:42:03,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 11:42:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:42:03,548 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-06 11:42:03,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 11:42:03,549 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407283610] [2021-11-06 11:42:03,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407283610] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 11:42:03,550 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:42:03,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 11:42:03,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287197287] [2021-11-06 11:42:03,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 11:42:03,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 11:42:03,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 11:42:03,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 11:42:03,572 INFO L87 Difference]: Start difference. First operand has 246 states, 231 states have (on average 1.4458874458874458) internal successors, (334), 245 states have internal predecessors, (334), 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 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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-06 11:42:03,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:42:03,617 INFO L93 Difference]: Finished difference Result 486 states and 661 transitions. [2021-11-06 11:42:03,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 11:42:03,619 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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 40 [2021-11-06 11:42:03,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:42:03,630 INFO L225 Difference]: With dead ends: 486 [2021-11-06 11:42:03,631 INFO L226 Difference]: Without dead ends: 239 [2021-11-06 11:42:03,635 INFO L786 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-06 11:42:03,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-11-06 11:42:03,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2021-11-06 11:42:03,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 225 states have (on average 1.3244444444444445) internal successors, (298), 238 states have internal predecessors, (298), 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-06 11:42:03,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 298 transitions. [2021-11-06 11:42:03,687 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 298 transitions. Word has length 40 [2021-11-06 11:42:03,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:42:03,687 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 298 transitions. [2021-11-06 11:42:03,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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-06 11:42:03,689 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 298 transitions. [2021-11-06 11:42:03,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-06 11:42:03,693 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:42:03,693 INFO L513 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] [2021-11-06 11:42:03,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 11:42:03,694 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:42:03,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:42:03,697 INFO L85 PathProgramCache]: Analyzing trace with hash 577264856, now seen corresponding path program 1 times [2021-11-06 11:42:03,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 11:42:03,697 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553189172] [2021-11-06 11:42:03,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:42:03,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 11:42:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:42:04,030 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-06 11:42:04,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 11:42:04,031 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553189172] [2021-11-06 11:42:04,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553189172] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 11:42:04,031 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:42:04,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 11:42:04,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206420560] [2021-11-06 11:42:04,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 11:42:04,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 11:42:04,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 11:42:04,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 11:42:04,033 INFO L87 Difference]: Start difference. First operand 239 states and 298 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-06 11:42:04,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:42:04,148 INFO L93 Difference]: Finished difference Result 398 states and 491 transitions. [2021-11-06 11:42:04,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 11:42:04,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2021-11-06 11:42:04,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:42:04,150 INFO L225 Difference]: With dead ends: 398 [2021-11-06 11:42:04,150 INFO L226 Difference]: Without dead ends: 239 [2021-11-06 11:42:04,151 INFO L786 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-06 11:42:04,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-11-06 11:42:04,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2021-11-06 11:42:04,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 225 states have (on average 1.3155555555555556) internal successors, (296), 238 states have internal predecessors, (296), 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-06 11:42:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 296 transitions. [2021-11-06 11:42:04,159 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 296 transitions. Word has length 40 [2021-11-06 11:42:04,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:42:04,160 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 296 transitions. [2021-11-06 11:42:04,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-06 11:42:04,160 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 296 transitions. [2021-11-06 11:42:04,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-06 11:42:04,161 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:42:04,161 INFO L513 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] [2021-11-06 11:42:04,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 11:42:04,162 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:42:04,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:42:04,162 INFO L85 PathProgramCache]: Analyzing trace with hash -252060921, now seen corresponding path program 1 times [2021-11-06 11:42:04,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 11:42:04,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358261011] [2021-11-06 11:42:04,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:42:04,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 11:42:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:42:04,541 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-06 11:42:04,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 11:42:04,541 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358261011] [2021-11-06 11:42:04,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358261011] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 11:42:04,541 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:42:04,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 11:42:04,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456662098] [2021-11-06 11:42:04,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 11:42:04,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 11:42:04,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 11:42:04,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 11:42:04,542 INFO L87 Difference]: Start difference. First operand 239 states and 296 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-06 11:42:04,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:42:04,983 INFO L93 Difference]: Finished difference Result 509 states and 617 transitions. [2021-11-06 11:42:04,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 11:42:04,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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 44 [2021-11-06 11:42:04,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:42:04,986 INFO L225 Difference]: With dead ends: 509 [2021-11-06 11:42:04,986 INFO L226 Difference]: Without dead ends: 318 [2021-11-06 11:42:04,987 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-06 11:42:04,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-11-06 11:42:04,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 239. [2021-11-06 11:42:04,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 225 states have (on average 1.3066666666666666) internal successors, (294), 238 states have internal predecessors, (294), 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-06 11:42:04,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 294 transitions. [2021-11-06 11:42:04,995 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 294 transitions. Word has length 44 [2021-11-06 11:42:04,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:42:04,995 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 294 transitions. [2021-11-06 11:42:04,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-06 11:42:04,996 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 294 transitions. [2021-11-06 11:42:04,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-06 11:42:04,997 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:42:04,997 INFO L513 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] [2021-11-06 11:42:04,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 11:42:04,997 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:42:04,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:42:04,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1945926435, now seen corresponding path program 1 times [2021-11-06 11:42:04,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 11:42:04,998 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128090140] [2021-11-06 11:42:04,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:42:04,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 11:42:05,091 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 11:42:05,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [894695180] [2021-11-06 11:42:05,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:42:05,092 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 11:42:05,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 11:42:05,111 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-06 11:42:05,130 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-06 11:42:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:42:05,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 2572 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-06 11:42:05,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:42:06,417 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-06 11:42:06,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 11:42:06,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128090140] [2021-11-06 11:42:06,418 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 11:42:06,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894695180] [2021-11-06 11:42:06,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894695180] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 11:42:06,419 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:42:06,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 11:42:06,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252755458] [2021-11-06 11:42:06,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 11:42:06,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 11:42:06,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 11:42:06,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 11:42:06,420 INFO L87 Difference]: Start difference. First operand 239 states and 294 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 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-06 11:42:06,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:42:06,793 INFO L93 Difference]: Finished difference Result 399 states and 486 transitions. [2021-11-06 11:42:06,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 11:42:06,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 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 52 [2021-11-06 11:42:06,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:42:06,795 INFO L225 Difference]: With dead ends: 399 [2021-11-06 11:42:06,795 INFO L226 Difference]: Without dead ends: 239 [2021-11-06 11:42:06,796 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-06 11:42:06,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-11-06 11:42:06,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2021-11-06 11:42:06,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 225 states have (on average 1.2977777777777777) internal successors, (292), 238 states have internal predecessors, (292), 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-06 11:42:06,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 292 transitions. [2021-11-06 11:42:06,804 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 292 transitions. Word has length 52 [2021-11-06 11:42:06,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:42:06,805 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 292 transitions. [2021-11-06 11:42:06,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 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-06 11:42:06,805 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 292 transitions. [2021-11-06 11:42:06,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 11:42:06,806 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:42:06,806 INFO L513 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-06 11:42:06,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-06 11:42:07,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 11:42:07,028 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:42:07,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:42:07,028 INFO L85 PathProgramCache]: Analyzing trace with hash -909602284, now seen corresponding path program 1 times [2021-11-06 11:42:07,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 11:42:07,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833680764] [2021-11-06 11:42:07,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:42:07,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 11:42:07,150 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 11:42:07,151 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [872071808] [2021-11-06 11:42:07,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:42:07,151 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 11:42:07,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 11:42:07,152 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-06 11:42:07,204 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-06 11:42:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:42:07,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 2622 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-06 11:42:07,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:42:08,418 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-06 11:42:08,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 11:42:08,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833680764] [2021-11-06 11:42:08,418 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 11:42:08,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872071808] [2021-11-06 11:42:08,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872071808] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 11:42:08,419 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:42:08,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 11:42:08,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880947635] [2021-11-06 11:42:08,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 11:42:08,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 11:42:08,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 11:42:08,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 11:42:08,420 INFO L87 Difference]: Start difference. First operand 239 states and 292 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 6 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-06 11:42:08,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:42:08,992 INFO L93 Difference]: Finished difference Result 415 states and 506 transitions. [2021-11-06 11:42:08,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 11:42:08,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 6 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-06 11:42:08,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:42:08,994 INFO L225 Difference]: With dead ends: 415 [2021-11-06 11:42:08,994 INFO L226 Difference]: Without dead ends: 239 [2021-11-06 11:42:08,995 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-11-06 11:42:08,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-11-06 11:42:09,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2021-11-06 11:42:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 225 states have (on average 1.288888888888889) internal successors, (290), 238 states have internal predecessors, (290), 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-06 11:42:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 290 transitions. [2021-11-06 11:42:09,002 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 290 transitions. Word has length 64 [2021-11-06 11:42:09,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:42:09,002 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 290 transitions. [2021-11-06 11:42:09,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 6 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-06 11:42:09,002 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 290 transitions. [2021-11-06 11:42:09,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-06 11:42:09,003 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:42:09,004 INFO L513 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-06 11:42:09,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-06 11:42:09,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 11:42:09,224 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:42:09,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:42:09,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1743581048, now seen corresponding path program 1 times [2021-11-06 11:42:09,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 11:42:09,224 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391259165] [2021-11-06 11:42:09,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:42:09,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 11:42:09,301 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 11:42:09,301 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2139178841] [2021-11-06 11:42:09,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:42:09,302 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 11:42:09,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 11:42:09,308 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-06 11:42:09,309 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-06 11:42:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:42:09,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 2717 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-06 11:42:09,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:42:10,579 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-06 11:42:10,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 11:42:10,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391259165] [2021-11-06 11:42:10,579 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 11:42:10,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139178841] [2021-11-06 11:42:10,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139178841] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 11:42:10,579 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:42:10,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 11:42:10,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328166731] [2021-11-06 11:42:10,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 11:42:10,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 11:42:10,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 11:42:10,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 11:42:10,580 INFO L87 Difference]: Start difference. First operand 239 states and 290 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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-06 11:42:10,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:42:10,893 INFO L93 Difference]: Finished difference Result 368 states and 441 transitions. [2021-11-06 11:42:10,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 11:42:10,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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-06 11:42:10,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:42:10,895 INFO L225 Difference]: With dead ends: 368 [2021-11-06 11:42:10,895 INFO L226 Difference]: Without dead ends: 239 [2021-11-06 11:42:10,896 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 11:42:10,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-11-06 11:42:10,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2021-11-06 11:42:10,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 225 states have (on average 1.28) internal successors, (288), 238 states have internal predecessors, (288), 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-06 11:42:10,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 288 transitions. [2021-11-06 11:42:10,902 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 288 transitions. Word has length 72 [2021-11-06 11:42:10,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:42:10,902 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 288 transitions. [2021-11-06 11:42:10,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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-06 11:42:10,902 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 288 transitions. [2021-11-06 11:42:10,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-06 11:42:10,903 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:42:10,904 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 11:42:10,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-06 11:42:11,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 11:42:11,124 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:42:11,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:42:11,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1843556290, now seen corresponding path program 1 times [2021-11-06 11:42:11,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 11:42:11,124 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235777901] [2021-11-06 11:42:11,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:42:11,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 11:42:11,201 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 11:42:11,202 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1010131626] [2021-11-06 11:42:11,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:42:11,202 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 11:42:11,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 11:42:11,204 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-06 11:42:11,205 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-06 11:42:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:42:12,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 2902 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 11:42:12,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:42:12,283 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-06 11:42:12,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 11:42:12,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235777901] [2021-11-06 11:42:12,283 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 11:42:12,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010131626] [2021-11-06 11:42:12,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010131626] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 11:42:12,283 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:42:12,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 11:42:12,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80067539] [2021-11-06 11:42:12,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 11:42:12,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 11:42:12,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 11:42:12,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 11:42:12,285 INFO L87 Difference]: Start difference. First operand 239 states and 288 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-06 11:42:12,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:42:12,667 INFO L93 Difference]: Finished difference Result 461 states and 561 transitions. [2021-11-06 11:42:12,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 11:42:12,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 88 [2021-11-06 11:42:12,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:42:12,669 INFO L225 Difference]: With dead ends: 461 [2021-11-06 11:42:12,669 INFO L226 Difference]: Without dead ends: 269 [2021-11-06 11:42:12,670 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 86 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-06 11:42:12,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-11-06 11:42:12,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 251. [2021-11-06 11:42:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 237 states have (on average 1.2658227848101267) internal successors, (300), 250 states have internal predecessors, (300), 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-06 11:42:12,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 300 transitions. [2021-11-06 11:42:12,678 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 300 transitions. Word has length 88 [2021-11-06 11:42:12,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:42:12,679 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 300 transitions. [2021-11-06 11:42:12,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-06 11:42:12,679 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 300 transitions. [2021-11-06 11:42:12,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-06 11:42:12,680 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:42:12,680 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 11:42:12,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-06 11:42:12,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 11:42:12,906 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:42:12,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:42:12,906 INFO L85 PathProgramCache]: Analyzing trace with hash 68548928, now seen corresponding path program 1 times [2021-11-06 11:42:12,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 11:42:12,906 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602417468] [2021-11-06 11:42:12,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:42:12,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 11:42:12,990 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 11:42:12,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1085671053] [2021-11-06 11:42:12,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:42:12,991 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 11:42:12,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 11:42:12,992 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-06 11:42:12,993 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-06 11:42:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:42:13,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 2907 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-06 11:42:13,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:42:14,176 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-06 11:42:14,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 11:42:14,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602417468] [2021-11-06 11:42:14,176 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 11:42:14,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085671053] [2021-11-06 11:42:14,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085671053] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 11:42:14,176 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:42:14,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 11:42:14,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909369035] [2021-11-06 11:42:14,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 11:42:14,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 11:42:14,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 11:42:14,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 11:42:14,178 INFO L87 Difference]: Start difference. First operand 251 states and 300 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-06 11:42:14,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:42:14,389 INFO L93 Difference]: Finished difference Result 580 states and 684 transitions. [2021-11-06 11:42:14,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 11:42:14,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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 88 [2021-11-06 11:42:14,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:42:14,392 INFO L225 Difference]: With dead ends: 580 [2021-11-06 11:42:14,392 INFO L226 Difference]: Without dead ends: 411 [2021-11-06 11:42:14,393 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 11:42:14,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2021-11-06 11:42:14,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 263. [2021-11-06 11:42:14,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 249 states have (on average 1.2690763052208835) internal successors, (316), 262 states have internal predecessors, (316), 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-06 11:42:14,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 316 transitions. [2021-11-06 11:42:14,403 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 316 transitions. Word has length 88 [2021-11-06 11:42:14,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:42:14,404 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 316 transitions. [2021-11-06 11:42:14,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-06 11:42:14,404 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 316 transitions. [2021-11-06 11:42:14,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-06 11:42:14,405 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:42:14,405 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 11:42:14,445 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-06 11:42:14,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 11:42:14,630 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:42:14,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:42:14,631 INFO L85 PathProgramCache]: Analyzing trace with hash 2117936770, now seen corresponding path program 1 times [2021-11-06 11:42:14,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 11:42:14,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141098094] [2021-11-06 11:42:14,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:42:14,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 11:42:14,699 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 11:42:14,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1390211250] [2021-11-06 11:42:14,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:42:14,700 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 11:42:14,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 11:42:14,701 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 11:42:14,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-06 11:42:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:42:15,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 2912 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-06 11:42:15,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:42:16,126 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-06 11:42:16,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 11:42:16,127 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141098094] [2021-11-06 11:42:16,127 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 11:42:16,127 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390211250] [2021-11-06 11:42:16,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390211250] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 11:42:16,127 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:42:16,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 11:42:16,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125720993] [2021-11-06 11:42:16,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 11:42:16,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 11:42:16,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 11:42:16,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 11:42:16,128 INFO L87 Difference]: Start difference. First operand 263 states and 316 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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-06 11:42:24,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:42:24,556 INFO L93 Difference]: Finished difference Result 621 states and 741 transitions. [2021-11-06 11:42:24,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 11:42:24,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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 88 [2021-11-06 11:42:24,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:42:24,558 INFO L225 Difference]: With dead ends: 621 [2021-11-06 11:42:24,558 INFO L226 Difference]: Without dead ends: 437 [2021-11-06 11:42:24,559 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-06 11:42:24,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-11-06 11:42:24,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 271. [2021-11-06 11:42:24,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 257 states have (on average 1.2684824902723735) internal successors, (326), 270 states have internal predecessors, (326), 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-06 11:42:24,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 326 transitions. [2021-11-06 11:42:24,569 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 326 transitions. Word has length 88 [2021-11-06 11:42:24,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:42:24,569 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 326 transitions. [2021-11-06 11:42:24,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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-06 11:42:24,570 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 326 transitions. [2021-11-06 11:42:24,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-06 11:42:24,570 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:42:24,570 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 11:42:24,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-11-06 11:42:24,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 11:42:24,784 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:42:24,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:42:24,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1928884032, now seen corresponding path program 1 times [2021-11-06 11:42:24,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 11:42:24,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824005362] [2021-11-06 11:42:24,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:42:24,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 11:42:24,890 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 11:42:24,890 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2078274566] [2021-11-06 11:42:24,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:42:24,890 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 11:42:24,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 11:42:24,892 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 11:42:24,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-06 11:42:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:42:25,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 2909 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 11:42:25,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:42:26,084 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-06 11:42:26,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 11:42:26,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824005362] [2021-11-06 11:42:26,084 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 11:42:26,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078274566] [2021-11-06 11:42:26,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078274566] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 11:42:26,084 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:42:26,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 11:42:26,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701131328] [2021-11-06 11:42:26,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 11:42:26,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 11:42:26,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 11:42:26,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 11:42:26,086 INFO L87 Difference]: Start difference. First operand 271 states and 326 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-06 11:42:26,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:42:26,225 INFO L93 Difference]: Finished difference Result 475 states and 568 transitions. [2021-11-06 11:42:26,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 11:42:26,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 88 [2021-11-06 11:42:26,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:42:26,227 INFO L225 Difference]: With dead ends: 475 [2021-11-06 11:42:26,227 INFO L226 Difference]: Without dead ends: 287 [2021-11-06 11:42:26,227 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 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-06 11:42:26,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-11-06 11:42:26,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 279. [2021-11-06 11:42:26,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 265 states have (on average 1.260377358490566) internal successors, (334), 278 states have internal predecessors, (334), 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-06 11:42:26,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 334 transitions. [2021-11-06 11:42:26,235 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 334 transitions. Word has length 88 [2021-11-06 11:42:26,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:42:26,235 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 334 transitions. [2021-11-06 11:42:26,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-06 11:42:26,236 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 334 transitions. [2021-11-06 11:42:26,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-06 11:42:26,236 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:42:26,237 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 11:42:26,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-06 11:42:26,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 11:42:26,443 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:42:26,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:42:26,444 INFO L85 PathProgramCache]: Analyzing trace with hash 994275966, now seen corresponding path program 1 times [2021-11-06 11:42:26,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 11:42:26,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337251599] [2021-11-06 11:42:26,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:42:26,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 11:42:26,530 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 11:42:26,530 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1900294033] [2021-11-06 11:42:26,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:42:26,530 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 11:42:26,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 11:42:26,532 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 11:42:26,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-06 11:42:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:42:27,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 2904 conjuncts, 78 conjunts are in the unsatisfiable core [2021-11-06 11:42:27,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:42:30,434 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-06 11:42:30,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 11:42:30,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337251599] [2021-11-06 11:42:30,435 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 11:42:30,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900294033] [2021-11-06 11:42:30,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900294033] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 11:42:30,435 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:42:30,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-06 11:42:30,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844866496] [2021-11-06 11:42:30,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-06 11:42:30,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 11:42:30,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-06 11:42:30,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2021-11-06 11:42:30,436 INFO L87 Difference]: Start difference. First operand 279 states and 334 transitions. Second operand has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 15 states have internal predecessors, (88), 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-06 11:42:37,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:42:37,197 INFO L93 Difference]: Finished difference Result 685 states and 814 transitions. [2021-11-06 11:42:37,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-06 11:42:37,198 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 15 states have internal predecessors, (88), 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 88 [2021-11-06 11:42:37,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:42:37,200 INFO L225 Difference]: With dead ends: 685 [2021-11-06 11:42:37,200 INFO L226 Difference]: Without dead ends: 502 [2021-11-06 11:42:37,201 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2021-11-06 11:42:37,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2021-11-06 11:42:37,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 393. [2021-11-06 11:42:37,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 379 states have (on average 1.2585751978891822) internal successors, (477), 392 states have internal predecessors, (477), 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-06 11:42:37,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 477 transitions. [2021-11-06 11:42:37,215 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 477 transitions. Word has length 88 [2021-11-06 11:42:37,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:42:37,215 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 477 transitions. [2021-11-06 11:42:37,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 15 states have internal predecessors, (88), 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-06 11:42:37,216 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 477 transitions. [2021-11-06 11:42:37,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-06 11:42:37,216 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:42:37,217 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 11:42:37,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-06 11:42:37,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-06 11:42:37,428 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:42:37,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:42:37,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1623498204, now seen corresponding path program 1 times [2021-11-06 11:42:37,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 11:42:37,429 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557895934] [2021-11-06 11:42:37,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:42:37,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 11:42:37,518 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 11:42:37,518 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [672517690] [2021-11-06 11:42:37,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:42:37,518 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 11:42:37,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 11:42:37,519 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 11:42:37,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-06 11:42:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:42:39,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 2909 conjuncts, 135 conjunts are in the unsatisfiable core [2021-11-06 11:42:39,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:42:39,975 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-06 11:42:41,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 11:42:41,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-06 11:42:41,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 11:42:41,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-06 11:42:41,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 11:42:41,326 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-06 11:42:41,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 11:42:41,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-06 11:42:41,811 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-06 11:42:41,812 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-06 11:42:42,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 11:42:42,114 INFO L354 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2021-11-06 11:42:42,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 58 [2021-11-06 11:42:42,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 11:42:42,197 INFO L354 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2021-11-06 11:42:42,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 43 [2021-11-06 11:42:43,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 11:42:43,371 INFO L354 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2021-11-06 11:42:43,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 58 [2021-11-06 11:42:43,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 11:42:43,431 INFO L354 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2021-11-06 11:42:43,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2021-11-06 11:42:44,061 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-06 11:42:44,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 11:42:44,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557895934] [2021-11-06 11:42:44,062 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 11:42:44,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672517690] [2021-11-06 11:42:44,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672517690] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 11:42:44,063 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:42:44,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-06 11:42:44,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814261239] [2021-11-06 11:42:44,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-06 11:42:44,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 11:42:44,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-06 11:42:44,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-11-06 11:42:44,064 INFO L87 Difference]: Start difference. First operand 393 states and 477 transitions. Second operand has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 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-06 11:43:04,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:43:04,891 INFO L93 Difference]: Finished difference Result 1181 states and 1432 transitions. [2021-11-06 11:43:04,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-06 11:43:04,892 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 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 90 [2021-11-06 11:43:04,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:43:04,896 INFO L225 Difference]: With dead ends: 1181 [2021-11-06 11:43:04,896 INFO L226 Difference]: Without dead ends: 957 [2021-11-06 11:43:04,897 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=196, Invalid=860, Unknown=0, NotChecked=0, Total=1056 [2021-11-06 11:43:04,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2021-11-06 11:43:04,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 633. [2021-11-06 11:43:04,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 619 states have (on average 1.2552504038772214) internal successors, (777), 632 states have internal predecessors, (777), 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-06 11:43:04,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 777 transitions. [2021-11-06 11:43:04,927 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 777 transitions. Word has length 90 [2021-11-06 11:43:04,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:43:04,928 INFO L470 AbstractCegarLoop]: Abstraction has 633 states and 777 transitions. [2021-11-06 11:43:04,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 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-06 11:43:04,928 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 777 transitions. [2021-11-06 11:43:04,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-06 11:43:04,929 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:43:04,929 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 11:43:04,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-06 11:43:05,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 11:43:05,146 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:43:05,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:43:05,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1179597530, now seen corresponding path program 1 times [2021-11-06 11:43:05,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 11:43:05,146 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231642867] [2021-11-06 11:43:05,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:43:05,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 11:43:05,260 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 11:43:05,260 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1953582097] [2021-11-06 11:43:05,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:43:05,261 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 11:43:05,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 11:43:05,275 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 11:43:05,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-06 11:43:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:43:06,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 2904 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-06 11:43:06,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:43:06,807 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-06 11:43:06,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 11:43:06,807 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231642867] [2021-11-06 11:43:06,808 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 11:43:06,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953582097] [2021-11-06 11:43:06,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953582097] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 11:43:06,808 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:43:06,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 11:43:06,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035060872] [2021-11-06 11:43:06,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 11:43:06,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 11:43:06,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 11:43:06,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 11:43:06,810 INFO L87 Difference]: Start difference. First operand 633 states and 777 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-06 11:43:12,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:43:12,769 INFO L93 Difference]: Finished difference Result 1444 states and 1765 transitions. [2021-11-06 11:43:12,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 11:43:12,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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 90 [2021-11-06 11:43:12,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:43:12,772 INFO L225 Difference]: With dead ends: 1444 [2021-11-06 11:43:12,773 INFO L226 Difference]: Without dead ends: 875 [2021-11-06 11:43:12,774 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 11:43:12,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2021-11-06 11:43:12,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 649. [2021-11-06 11:43:12,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 635 states have (on average 1.2456692913385827) internal successors, (791), 648 states have internal predecessors, (791), 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-06 11:43:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 791 transitions. [2021-11-06 11:43:12,797 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 791 transitions. Word has length 90 [2021-11-06 11:43:12,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:43:12,797 INFO L470 AbstractCegarLoop]: Abstraction has 649 states and 791 transitions. [2021-11-06 11:43:12,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-06 11:43:12,797 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 791 transitions. [2021-11-06 11:43:12,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-06 11:43:12,798 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:43:12,799 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 11:43:12,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-06 11:43:13,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-06 11:43:13,011 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:43:13,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:43:13,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1660677788, now seen corresponding path program 1 times [2021-11-06 11:43:13,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 11:43:13,012 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985156638] [2021-11-06 11:43:13,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:43:13,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 11:43:13,086 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 11:43:13,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2036837878] [2021-11-06 11:43:13,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:43:13,087 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 11:43:13,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 11:43:13,088 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 11:43:13,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-06 11:43:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:43:15,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 2909 conjuncts, 139 conjunts are in the unsatisfiable core [2021-11-06 11:43:15,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:43:15,300 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-06 11:43:16,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 11:43:16,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-06 11:43:16,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 11:43:16,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-06 11:43:16,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 11:43:16,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-06 11:43:16,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 11:43:16,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-06 11:43:16,927 INFO L354 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-11-06 11:43:16,927 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 6 case distinctions, treesize of input 29 treesize of output 33 [2021-11-06 11:43:17,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 11:43:17,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 63 treesize of output 54 [2021-11-06 11:43:17,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 11:43:17,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 48 treesize of output 39 [2021-11-06 11:43:18,133 INFO L354 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2021-11-06 11:43:18,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 33 [2021-11-06 11:43:18,989 INFO L354 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2021-11-06 11:43:18,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 25 treesize of output 29 [2021-11-06 11:43:19,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 11:43:19,496 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-06 11:43:19,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 58 [2021-11-06 11:43:19,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 11:43:19,543 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-06 11:43:19,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 43 [2021-11-06 11:43:21,433 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-06 11:43:21,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 11:43:21,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985156638] [2021-11-06 11:43:21,433 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 11:43:21,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036837878] [2021-11-06 11:43:21,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036837878] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 11:43:21,433 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:43:21,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-06 11:43:21,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604260371] [2021-11-06 11:43:21,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-06 11:43:21,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 11:43:21,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-06 11:43:21,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2021-11-06 11:43:21,435 INFO L87 Difference]: Start difference. First operand 649 states and 791 transitions. Second operand has 21 states, 21 states have (on average 4.285714285714286) internal successors, (90), 21 states have internal predecessors, (90), 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-06 11:43:48,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:43:48,152 INFO L93 Difference]: Finished difference Result 1297 states and 1566 transitions. [2021-11-06 11:43:48,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-06 11:43:48,153 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.285714285714286) internal successors, (90), 21 states have internal predecessors, (90), 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 90 [2021-11-06 11:43:48,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:43:48,156 INFO L225 Difference]: With dead ends: 1297 [2021-11-06 11:43:48,156 INFO L226 Difference]: Without dead ends: 1019 [2021-11-06 11:43:48,158 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2021-11-06 11:43:48,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2021-11-06 11:43:48,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 745. [2021-11-06 11:43:48,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 731 states have (on average 1.2448700410396716) internal successors, (910), 744 states have internal predecessors, (910), 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-06 11:43:48,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 910 transitions. [2021-11-06 11:43:48,198 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 910 transitions. Word has length 90 [2021-11-06 11:43:48,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:43:48,199 INFO L470 AbstractCegarLoop]: Abstraction has 745 states and 910 transitions. [2021-11-06 11:43:48,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.285714285714286) internal successors, (90), 21 states have internal predecessors, (90), 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-06 11:43:48,200 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 910 transitions. [2021-11-06 11:43:48,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-06 11:43:48,201 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:43:48,201 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 11:43:48,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-06 11:43:48,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-06 11:43:48,414 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:43:48,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:43:48,415 INFO L85 PathProgramCache]: Analyzing trace with hash 913664384, now seen corresponding path program 1 times [2021-11-06 11:43:48,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 11:43:48,415 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000212614] [2021-11-06 11:43:48,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:43:48,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 11:43:48,515 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 11:43:48,519 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [26872034] [2021-11-06 11:43:48,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:43:48,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 11:43:48,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 11:43:48,536 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 11:43:48,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-06 11:47:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:47:33,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 2931 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-06 11:47:33,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:47:34,085 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-06 11:47:34,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 73 treesize of output 55 [2021-11-06 11:47:34,738 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-06 11:47:34,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 11:47:34,738 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000212614] [2021-11-06 11:47:34,738 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 11:47:34,738 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26872034] [2021-11-06 11:47:34,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26872034] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 11:47:34,738 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:47:34,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 11:47:34,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991344550] [2021-11-06 11:47:34,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 11:47:34,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 11:47:34,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 11:47:34,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 11:47:34,739 INFO L87 Difference]: Start difference. First operand 745 states and 910 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-06 11:47:35,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:47:35,442 INFO L93 Difference]: Finished difference Result 1810 states and 2197 transitions. [2021-11-06 11:47:35,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 11:47:35,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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 91 [2021-11-06 11:47:35,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:47:35,448 INFO L225 Difference]: With dead ends: 1810 [2021-11-06 11:47:35,448 INFO L226 Difference]: Without dead ends: 1285 [2021-11-06 11:47:35,451 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-06 11:47:35,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2021-11-06 11:47:35,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 751. [2021-11-06 11:47:35,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 737 states have (on average 1.242876526458616) internal successors, (916), 750 states have internal predecessors, (916), 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-06 11:47:35,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 916 transitions. [2021-11-06 11:47:35,488 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 916 transitions. Word has length 91 [2021-11-06 11:47:35,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:47:35,489 INFO L470 AbstractCegarLoop]: Abstraction has 751 states and 916 transitions. [2021-11-06 11:47:35,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-06 11:47:35,489 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 916 transitions. [2021-11-06 11:47:35,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-06 11:47:35,490 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:47:35,490 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 11:47:35,703 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forcibly destroying the process [2021-11-06 11:47:35,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 137 [2021-11-06 11:47:35,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-06 11:47:35,753 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:47:35,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:47:35,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1666608842, now seen corresponding path program 1 times [2021-11-06 11:47:35,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 11:47:35,754 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403994028] [2021-11-06 11:47:35,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:47:35,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 11:47:35,850 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 11:47:35,850 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1076202351] [2021-11-06 11:47:35,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:47:35,850 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 11:47:35,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 11:47:35,852 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 11:47:35,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-06 11:47:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:47:37,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 2934 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-06 11:47:37,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:47:37,538 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-06 11:47:37,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 11:47:37,538 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403994028] [2021-11-06 11:47:37,538 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 11:47:37,538 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076202351] [2021-11-06 11:47:37,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076202351] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 11:47:37,538 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:47:37,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 11:47:37,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710537760] [2021-11-06 11:47:37,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 11:47:37,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 11:47:37,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 11:47:37,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 11:47:37,539 INFO L87 Difference]: Start difference. First operand 751 states and 916 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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-06 11:47:37,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:47:37,975 INFO L93 Difference]: Finished difference Result 1335 states and 1608 transitions. [2021-11-06 11:47:37,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 11:47:37,976 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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 91 [2021-11-06 11:47:37,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:47:37,978 INFO L225 Difference]: With dead ends: 1335 [2021-11-06 11:47:37,978 INFO L226 Difference]: Without dead ends: 814 [2021-11-06 11:47:37,979 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-11-06 11:47:37,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2021-11-06 11:47:38,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 751. [2021-11-06 11:47:38,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 737 states have (on average 1.2360922659430122) internal successors, (911), 750 states have internal predecessors, (911), 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-06 11:47:38,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 911 transitions. [2021-11-06 11:47:38,015 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 911 transitions. Word has length 91 [2021-11-06 11:47:38,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:47:38,015 INFO L470 AbstractCegarLoop]: Abstraction has 751 states and 911 transitions. [2021-11-06 11:47:38,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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-06 11:47:38,015 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 911 transitions. [2021-11-06 11:47:38,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-06 11:47:38,016 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:47:38,016 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 11:47:38,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-06 11:47:38,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-06 11:47:38,243 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:47:38,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:47:38,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1825168090, now seen corresponding path program 1 times [2021-11-06 11:47:38,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 11:47:38,244 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604220841] [2021-11-06 11:47:38,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:47:38,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 11:47:38,326 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 11:47:38,326 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [887182916] [2021-11-06 11:47:38,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:47:38,326 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 11:47:38,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 11:47:38,327 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 11:47:38,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-06 11:47:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:47:40,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 2926 conjuncts, 137 conjunts are in the unsatisfiable core [2021-11-06 11:47:40,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:47:40,533 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-06 11:47:41,462 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-06 11:47:41,462 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 17 treesize of output 21 [2021-11-06 11:47:41,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 11:47:41,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2021-11-06 11:47:41,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 11:47:41,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2021-11-06 11:47:42,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 11:47:42,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2021-11-06 11:47:42,450 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-06 11:47:42,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2021-11-06 11:47:42,653 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-11-06 11:47:42,653 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 30 treesize of output 29 [2021-11-06 11:47:47,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 11:47:47,814 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604220841] [2021-11-06 11:47:47,814 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 11:47:47,814 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887182916] [2021-11-06 11:47:47,814 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [ULTIMATE.start_aws_mul_u64_checked_~r.base, ULTIMATE.start_aws_mul_u64_checked_~r.offset] [2021-11-06 11:47:47,814 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:47:47,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-06 11:47:47,814 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-11-06 11:47:47,814 INFO L627 BasicCegarLoop]: Counterexample might be feasible [2021-11-06 11:47:47,819 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 11:47:47,821 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 11:47:47,822 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 11:47:47,822 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 11:47:47,822 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 11:47:47,822 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 11:47:47,822 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 11:47:47,822 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 11:47:47,822 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 11:47:47,823 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 11:47:47,823 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 11:47:47,823 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 11:47:47,823 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 11:47:47,823 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 11:47:47,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-06 11:47:48,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 11:47:48,046 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 11:47:48,048 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-06 11:47:48,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:47:48 BoogieIcfgContainer [2021-11-06 11:47:48,093 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-06 11:47:48,093 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-06 11:47:48,093 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-06 11:47:48,094 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-06 11:47:48,094 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:42:02" (3/4) ... [2021-11-06 11:47:48,096 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-06 11:47:48,099 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-06 11:47:48,100 INFO L168 Benchmark]: Toolchain (without parser) took 354896.27 ms. Allocated memory was 88.1 MB in the beginning and 645.9 MB in the end (delta: 557.8 MB). Free memory was 53.1 MB in the beginning and 319.6 MB in the end (delta: -266.5 MB). Peak memory consumption was 290.6 MB. Max. memory is 16.1 GB. [2021-11-06 11:47:48,100 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 88.1 MB. Free memory is still 47.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-06 11:47:48,100 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1632.59 ms. Allocated memory was 88.1 MB in the beginning and 146.8 MB in the end (delta: 58.7 MB). Free memory was 52.9 MB in the beginning and 79.2 MB in the end (delta: -26.3 MB). Peak memory consumption was 52.1 MB. Max. memory is 16.1 GB. [2021-11-06 11:47:48,100 INFO L168 Benchmark]: Boogie Procedure Inliner took 189.50 ms. Allocated memory is still 146.8 MB. Free memory was 79.2 MB in the beginning and 65.9 MB in the end (delta: 13.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-06 11:47:48,100 INFO L168 Benchmark]: Boogie Preprocessor took 157.44 ms. Allocated memory is still 146.8 MB. Free memory was 65.9 MB in the beginning and 93.1 MB in the end (delta: -27.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-06 11:47:48,101 INFO L168 Benchmark]: RCFGBuilder took 7716.58 ms. Allocated memory was 146.8 MB in the beginning and 308.3 MB in the end (delta: 161.5 MB). Free memory was 93.1 MB in the beginning and 131.1 MB in the end (delta: -38.0 MB). Peak memory consumption was 187.2 MB. Max. memory is 16.1 GB. [2021-11-06 11:47:48,101 INFO L168 Benchmark]: TraceAbstraction took 345188.82 ms. Allocated memory was 308.3 MB in the beginning and 645.9 MB in the end (delta: 337.6 MB). Free memory was 130.0 MB in the beginning and 319.6 MB in the end (delta: -189.6 MB). Peak memory consumption was 148.1 MB. Max. memory is 16.1 GB. [2021-11-06 11:47:48,101 INFO L168 Benchmark]: Witness Printer took 5.65 ms. Allocated memory is still 645.9 MB. Free memory is still 319.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-06 11:47:48,102 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.18 ms. Allocated memory is still 88.1 MB. Free memory is still 47.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1632.59 ms. Allocated memory was 88.1 MB in the beginning and 146.8 MB in the end (delta: 58.7 MB). Free memory was 52.9 MB in the beginning and 79.2 MB in the end (delta: -26.3 MB). Peak memory consumption was 52.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 189.50 ms. Allocated memory is still 146.8 MB. Free memory was 79.2 MB in the beginning and 65.9 MB in the end (delta: 13.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 157.44 ms. Allocated memory is still 146.8 MB. Free memory was 65.9 MB in the beginning and 93.1 MB in the end (delta: -27.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 7716.58 ms. Allocated memory was 146.8 MB in the beginning and 308.3 MB in the end (delta: 161.5 MB). Free memory was 93.1 MB in the beginning and 131.1 MB in the end (delta: -38.0 MB). Peak memory consumption was 187.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 345188.82 ms. Allocated memory was 308.3 MB in the beginning and 645.9 MB in the end (delta: 337.6 MB). Free memory was 130.0 MB in the beginning and 319.6 MB in the end (delta: -189.6 MB). Peak memory consumption was 148.1 MB. Max. memory is 16.1 GB. * Witness Printer took 5.65 ms. Allocated memory is still 645.9 MB. Free memory is still 319.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint, overapproximation of large string literal at line 7720. Possible FailurePath: [L2762-L2767] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7310] static __thread int tl_last_error = 0; [L7719-L7867] static struct aws_error_info errors[] = { [(AWS_ERROR_SUCCESS)-0x0000] = { .literal_name = "AWS_ERROR_SUCCESS", .error_code = (AWS_ERROR_SUCCESS), .error_str = ("Success."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SUCCESS" ", " "Success.", } , [(AWS_ERROR_OOM)-0x0000] = { .literal_name = "AWS_ERROR_OOM", .error_code = (AWS_ERROR_OOM), .error_str = ("Out of memory."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_OOM" ", " "Out of memory.", } , [(AWS_ERROR_UNKNOWN)-0x0000] = { .literal_name = "AWS_ERROR_UNKNOWN", .error_code = (AWS_ERROR_UNKNOWN), .error_str = ("Unknown error."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNKNOWN" ", " "Unknown error.", } , [(AWS_ERROR_SHORT_BUFFER)-0x0000] = { .literal_name = "AWS_ERROR_SHORT_BUFFER", .error_code = (AWS_ERROR_SHORT_BUFFER), .error_str = ("Buffer is not large enough to hold result."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SHORT_BUFFER" ", " "Buffer is not large enough to hold result.", } , [(AWS_ERROR_OVERFLOW_DETECTED)-0x0000] = { .literal_name = "AWS_ERROR_OVERFLOW_DETECTED", .error_code = (AWS_ERROR_OVERFLOW_DETECTED), .error_str = ("Fixed size value overflow was detected."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_OVERFLOW_DETECTED" ", " "Fixed size value overflow was detected.", } , [(AWS_ERROR_UNSUPPORTED_OPERATION)-0x0000] = { .literal_name = "AWS_ERROR_UNSUPPORTED_OPERATION", .error_code = (AWS_ERROR_UNSUPPORTED_OPERATION), .error_str = ("Unsupported operation."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNSUPPORTED_OPERATION" ", " "Unsupported operation.", } , [(AWS_ERROR_INVALID_BUFFER_SIZE)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_BUFFER_SIZE", .error_code = (AWS_ERROR_INVALID_BUFFER_SIZE), .error_str = ("Invalid buffer size."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_BUFFER_SIZE" ", " "Invalid buffer size.", } , [(AWS_ERROR_INVALID_HEX_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_HEX_STR", .error_code = (AWS_ERROR_INVALID_HEX_STR), .error_str = ("Invalid hex string."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_HEX_STR" ", " "Invalid hex string.", } , [(AWS_ERROR_INVALID_BASE64_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_BASE64_STR", .error_code = (AWS_ERROR_INVALID_BASE64_STR), .error_str = ("Invalid base64 string."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_BASE64_STR" ", " "Invalid base64 string.", } , [(AWS_ERROR_INVALID_INDEX)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_INDEX", .error_code = (AWS_ERROR_INVALID_INDEX), .error_str = ("Invalid index for list access."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_INDEX" ", " "Invalid index for list access.", } , [(AWS_ERROR_THREAD_INVALID_SETTINGS)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_INVALID_SETTINGS", .error_code = (AWS_ERROR_THREAD_INVALID_SETTINGS), .error_str = ("Invalid thread settings."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_INVALID_SETTINGS" ", " "Invalid thread settings.", } , [(AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE", .error_code = (AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE), .error_str = ("Insufficent resources for thread."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE" ", " "Insufficent resources for thread.", } , [(AWS_ERROR_THREAD_NO_PERMISSIONS)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NO_PERMISSIONS", .error_code = (AWS_ERROR_THREAD_NO_PERMISSIONS), .error_str = ("Insufficient permissions for thread operation."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NO_PERMISSIONS" ", " "Insufficient permissions for thread operation.", } , [(AWS_ERROR_THREAD_NOT_JOINABLE)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NOT_JOINABLE", .error_code = (AWS_ERROR_THREAD_NOT_JOINABLE), .error_str = ("Thread not joinable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NOT_JOINABLE" ", " "Thread not joinable.", } , [(AWS_ERROR_THREAD_NO_SUCH_THREAD_ID)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NO_SUCH_THREAD_ID", .error_code = (AWS_ERROR_THREAD_NO_SUCH_THREAD_ID), .error_str = ("No such thread ID."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NO_SUCH_THREAD_ID" ", " "No such thread ID.", } , [(AWS_ERROR_THREAD_DEADLOCK_DETECTED)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_DEADLOCK_DETECTED", .error_code = (AWS_ERROR_THREAD_DEADLOCK_DETECTED), .error_str = ("Deadlock detected in thread."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_DEADLOCK_DETECTED" ", " "Deadlock detected in thread.", } , [(AWS_ERROR_MUTEX_NOT_INIT)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_NOT_INIT", .error_code = (AWS_ERROR_MUTEX_NOT_INIT), .error_str = ("Mutex not initialized."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_NOT_INIT" ", " "Mutex not initialized.", } , [(AWS_ERROR_MUTEX_TIMEOUT)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_TIMEOUT", .error_code = (AWS_ERROR_MUTEX_TIMEOUT), .error_str = ("Mutex operation timed out."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_TIMEOUT" ", " "Mutex operation timed out.", } , [(AWS_ERROR_MUTEX_CALLER_NOT_OWNER)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_CALLER_NOT_OWNER", .error_code = (AWS_ERROR_MUTEX_CALLER_NOT_OWNER), .error_str = ("The caller of a mutex operation was not the owner."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_CALLER_NOT_OWNER" ", " "The caller of a mutex operation was not the owner.", } , [(AWS_ERROR_MUTEX_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_FAILED", .error_code = (AWS_ERROR_MUTEX_FAILED), .error_str = ("Mutex operation failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_FAILED" ", " "Mutex operation failed.", } , [(AWS_ERROR_COND_VARIABLE_INIT_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_INIT_FAILED", .error_code = (AWS_ERROR_COND_VARIABLE_INIT_FAILED), .error_str = ("Condition variable initialization failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_INIT_FAILED" ", " "Condition variable initialization failed.", } , [(AWS_ERROR_COND_VARIABLE_TIMED_OUT)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_TIMED_OUT", .error_code = (AWS_ERROR_COND_VARIABLE_TIMED_OUT), .error_str = ("Condition variable wait timed out."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_TIMED_OUT" ", " "Condition variable wait timed out.", } , [(AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN", .error_code = (AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN), .error_str = ("Condition variable unknown error."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN" ", " "Condition variable unknown error.", } , [(AWS_ERROR_CLOCK_FAILURE)-0x0000] = { .literal_name = "AWS_ERROR_CLOCK_FAILURE", .error_code = (AWS_ERROR_CLOCK_FAILURE), .error_str = ("Clock operation failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_CLOCK_FAILURE" ", " "Clock operation failed.", } , [(AWS_ERROR_LIST_EMPTY)-0x0000] = { .literal_name = "AWS_ERROR_LIST_EMPTY", .error_code = (AWS_ERROR_LIST_EMPTY), .error_str = ("Empty list."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_EMPTY" ", " "Empty list.", } , [(AWS_ERROR_DEST_COPY_TOO_SMALL)-0x0000] = { .literal_name = "AWS_ERROR_DEST_COPY_TOO_SMALL", .error_code = (AWS_ERROR_DEST_COPY_TOO_SMALL), .error_str = ("Destination of copy is too small."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_DEST_COPY_TOO_SMALL" ", " "Destination of copy is too small.", } , [(AWS_ERROR_LIST_EXCEEDS_MAX_SIZE)-0x0000] = { .literal_name = "AWS_ERROR_LIST_EXCEEDS_MAX_SIZE", .error_code = (AWS_ERROR_LIST_EXCEEDS_MAX_SIZE), .error_str = ("A requested operation on a list would exceed it's max size."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_EXCEEDS_MAX_SIZE" ", " "A requested operation on a list would exceed it's max size.", } , [(AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK)-0x0000] = { .literal_name = "AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK", .error_code = (AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK), .error_str = ("Attempt to shrink a list in static mode."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK" ", " "Attempt to shrink a list in static mode.", } , [(AWS_ERROR_PRIORITY_QUEUE_FULL)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_FULL", .error_code = (AWS_ERROR_PRIORITY_QUEUE_FULL), .error_str = ("Attempt to add items to a full preallocated queue in static mode."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_FULL" ", " "Attempt to add items to a full preallocated queue in static mode.", } , [(AWS_ERROR_PRIORITY_QUEUE_EMPTY)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_EMPTY", .error_code = (AWS_ERROR_PRIORITY_QUEUE_EMPTY), .error_str = ("Attempt to pop an item from an empty queue."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_EMPTY" ", " "Attempt to pop an item from an empty queue.", } , [(AWS_ERROR_PRIORITY_QUEUE_BAD_NODE)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_BAD_NODE", .error_code = (AWS_ERROR_PRIORITY_QUEUE_BAD_NODE), .error_str = ("Bad node handle passed to remove."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_BAD_NODE" ", " "Bad node handle passed to remove.", } , [(AWS_ERROR_HASHTBL_ITEM_NOT_FOUND)-0x0000] = { .literal_name = "AWS_ERROR_HASHTBL_ITEM_NOT_FOUND", .error_code = (AWS_ERROR_HASHTBL_ITEM_NOT_FOUND), .error_str = ("Item not found in hash table."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_HASHTBL_ITEM_NOT_FOUND" ", " "Item not found in hash table.", } , [(AWS_ERROR_INVALID_DATE_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_DATE_STR", .error_code = (AWS_ERROR_INVALID_DATE_STR), .error_str = ("Date string is invalid and cannot be parsed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_DATE_STR" ", " "Date string is invalid and cannot be parsed.", } , [(AWS_ERROR_INVALID_ARGUMENT)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_ARGUMENT", .error_code = (AWS_ERROR_INVALID_ARGUMENT), .error_str = ("An invalid argument was passed to a function."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_ARGUMENT" ", " "An invalid argument was passed to a function.", } , [(AWS_ERROR_RANDOM_GEN_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_RANDOM_GEN_FAILED", .error_code = (AWS_ERROR_RANDOM_GEN_FAILED), .error_str = ("A call to the random number generator failed. Retry later."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_RANDOM_GEN_FAILED" ", " "A call to the random number generator failed. Retry later.", } , [(AWS_ERROR_MALFORMED_INPUT_STRING)-0x0000] = { .literal_name = "AWS_ERROR_MALFORMED_INPUT_STRING", .error_code = (AWS_ERROR_MALFORMED_INPUT_STRING), .error_str = ("An input string was passed to a parser and the string was incorrectly formatted."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MALFORMED_INPUT_STRING" ", " "An input string was passed to a parser and the string was incorrectly formatted.", } , [(AWS_ERROR_UNIMPLEMENTED)-0x0000] = { .literal_name = "AWS_ERROR_UNIMPLEMENTED", .error_code = (AWS_ERROR_UNIMPLEMENTED), .error_str = ("A function was called, but is not implemented."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNIMPLEMENTED" ", " "A function was called, but is not implemented.", } , [(AWS_ERROR_INVALID_STATE)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_STATE", .error_code = (AWS_ERROR_INVALID_STATE), .error_str = ("An invalid state was encountered."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_STATE" ", " "An invalid state was encountered.", } , [(AWS_ERROR_ENVIRONMENT_GET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_GET", .error_code = (AWS_ERROR_ENVIRONMENT_GET), .error_str = ("System call failure when getting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_GET" ", " "System call failure when getting an environment variable.", } , [(AWS_ERROR_ENVIRONMENT_SET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_SET", .error_code = (AWS_ERROR_ENVIRONMENT_SET), .error_str = ("System call failure when setting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_SET" ", " "System call failure when setting an environment variable.", } , [(AWS_ERROR_ENVIRONMENT_UNSET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_UNSET", .error_code = (AWS_ERROR_ENVIRONMENT_UNSET), .error_str = ("System call failure when unsetting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_UNSET" ", " "System call failure when unsetting an environment variable.", } , [(AWS_ERROR_SYS_CALL_FAILURE)-0x0000] = { .literal_name = "AWS_ERROR_SYS_CALL_FAILURE", .error_code = (AWS_ERROR_SYS_CALL_FAILURE), .error_str = ("System call failure"), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SYS_CALL_FAILURE" ", " "System call failure", } , [(AWS_ERROR_FILE_INVALID_PATH)-0x0000] = { .literal_name = "AWS_ERROR_FILE_INVALID_PATH", .error_code = (AWS_ERROR_FILE_INVALID_PATH), .error_str = ("Invalid file path."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_FILE_INVALID_PATH" ", " "Invalid file path.", } , [(AWS_ERROR_MAX_FDS_EXCEEDED)-0x0000] = { .literal_name = "AWS_ERROR_MAX_FDS_EXCEEDED", .error_code = (AWS_ERROR_MAX_FDS_EXCEEDED), .error_str = ("The maximum number of fds has been exceeded."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MAX_FDS_EXCEEDED" ", " "The maximum number of fds has been exceeded.", } , [(AWS_ERROR_NO_PERMISSION)-0x0000] = { .literal_name = "AWS_ERROR_NO_PERMISSION", .error_code = (AWS_ERROR_NO_PERMISSION), .error_str = ("User does not have permission to perform the requested action."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_NO_PERMISSION" ", " "User does not have permission to perform the requested action.", } , [(AWS_ERROR_STREAM_UNSEEKABLE)-0x0000] = { .literal_name = "AWS_ERROR_STREAM_UNSEEKABLE", .error_code = (AWS_ERROR_STREAM_UNSEEKABLE), .error_str = ("Stream does not support seek operations"), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_STREAM_UNSEEKABLE" ", " "Stream does not support seek operations", } , }; [L7870-L7873] static struct aws_error_info_list s_list = { .error_list = errors, .count = (sizeof(errors) / sizeof((errors)[0])), }; [L7875-L7884] static struct aws_log_subject_info s_common_log_subject_infos[] = { { .subject_id = (AWS_LS_COMMON_GENERAL), .subject_name = ("aws-c-common"), .subject_description = ("Subject for aws-c-common logging that doesn't belong to any particular category") } , { .subject_id = (AWS_LS_COMMON_TASK_SCHEDULER), .subject_name = ("task-scheduler"), .subject_description = ("Subject for task scheduler or task specific logging.") } , }; [L7886-L7889] static struct aws_log_subject_info_list s_common_log_subject_list = { .subject_list = s_common_log_subject_infos, .count = (sizeof(s_common_log_subject_infos) / sizeof((s_common_log_subject_infos)[0])), }; [L7891-L7895] static _Bool s_common_library_initialized = 0 ; [L7909] struct aws_priority_queue queue; [L6956] EXPR list->item_size [L6955-L6956] _Bool item_size_is_bounded = list->item_size <= max_item_size; [L6959] EXPR list->length [L6958-L6959] _Bool length_is_bounded = list->length <= max_initial_item_allocation; [L6960] return item_size_is_bounded && length_is_bounded; [L7010-L7012] _Bool container_is_bounded = aws_array_list_is_bounded(&queue->container, max_initial_item_allocation, max_item_size); [L6956] EXPR list->item_size [L6955-L6956] _Bool item_size_is_bounded = list->item_size <= max_item_size; [L6959] EXPR list->length [L6958-L6959] _Bool length_is_bounded = list->length <= max_initial_item_allocation; [L6960] return item_size_is_bounded && length_is_bounded; [L7018-L7020] _Bool backpointers_list_is_bounded = aws_array_list_is_bounded( &queue->backpointers, max_initial_item_allocation, sizeof(struct aws_priority_queue_node *)); [L7021] return container_is_bounded && backpointers_list_is_bounded; [L211] COND FALSE !(!cond) [L6964] EXPR list->current_size [L6964] list->current_size == 0 && list->length == 0 [L6964] EXPR list->length [L6964] list->current_size == 0 && list->length == 0 [L6964] COND TRUE list->current_size == 0 && list->length == 0 [L6965] list->data [L211] COND FALSE !(!cond) [L2786] return &s_can_fail_allocator_static; [L6968] list->alloc = can_fail_allocator() [L6964] EXPR list->current_size [L6964] list->current_size == 0 && list->length == 0 [L6964] EXPR list->length [L6964] list->current_size == 0 && list->length == 0 [L6964] COND FALSE !(list->current_size == 0 && list->length == 0) [L6970] EXPR list->current_size [L211] COND FALSE !(!cond) [L2782] return malloc(size); [L6970] list->data = bounded_malloc(list->current_size) [L261] return __VERIFIER_nondet_bool(); [L6971-L6973] EXPR nondet_bool() ? ((void *)0) : can_fail_allocator() [L6971-L6973] list->alloc = nondet_bool() ? ((void *)0) : can_fail_allocator() [L7027] queue->pred = nondet_compare [L7501] COND FALSE !(!queue) [L7508] EXPR queue->pred [L7507-L7510] _Bool pred_is_valid = (queue->pred != ((void *)0) ); [L3263] COND FALSE !(!list) [L3268] size_t required_size = 0; [L3272] EXPR list->length [L3272] EXPR list->item_size [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L3270-L3272] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L3275] EXPR list->current_size [L3275] EXPR \read(required_size) [L3274-L3275] _Bool current_size_is_valid = (list->current_size >= required_size); [L3279] EXPR list->current_size [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279] EXPR list->data [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279-L3281] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L3277-L3281] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L3284] EXPR list->item_size [L3283-L3284] _Bool item_size_is_valid = (list->item_size != 0); [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L3268] size_t required_size = 0; [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L7512-L7513] _Bool container_is_valid = aws_array_list_is_valid(&queue->container); [L7442] COND FALSE !(!queue) [L3263] COND FALSE !(!list) [L3268] size_t required_size = 0; [L3272] EXPR list->length [L3272] EXPR list->item_size [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L3270-L3272] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L3275] EXPR list->current_size [L3275] EXPR \read(required_size) [L3274-L3275] _Bool current_size_is_valid = (list->current_size >= required_size); [L3279] EXPR list->current_size [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279] EXPR list->data [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279-L3281] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L3281] EXPR list->current_size [L3281] EXPR (((list->current_size)) == 0) || ((list->data)) [L3279-L3281] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L3277-L3281] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L3284] EXPR list->item_size [L3283-L3284] _Bool item_size_is_valid = (list->item_size != 0); [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L3268] size_t required_size = 0; [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L7452] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) [L7452] EXPR queue->backpointers.current_size [L7452] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) [L7452-L7455] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) && (queue->backpointers.data != ((void *)0) ) [L7453] EXPR queue->backpointers.data [L7452-L7455] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) && (queue->backpointers.data != ((void *)0) ) [L7450-L7455] _Bool backpointer_list_is_valid = ((aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) && (queue->backpointers.data != ((void *)0) ))); [L7463] EXPR queue->backpointers.item_size [L7462-L7463] _Bool backpointer_list_item_size = queue->backpointers.item_size == sizeof(struct aws_priority_queue_node *); [L7466] EXPR queue->backpointers.length [L7466] EXPR queue->container.length [L7465-L7466] _Bool lists_equal_lengths = queue->backpointers.length == queue->container.length; [L7469] EXPR queue->backpointers.current_size [L7468-L7469] _Bool backpointers_non_zero_current_size = queue->backpointers.current_size > 0; [L7477-L7480] _Bool backpointers_valid_deep = 1 ; [L7485] EXPR queue->backpointers.current_size [L7485] EXPR queue->backpointers.current_size == 0 && queue->backpointers.length == 0 [L7485-L7486] EXPR queue->backpointers.current_size == 0 && queue->backpointers.length == 0 && queue->backpointers.data == ((void *)0) [L7483-L7487] _Bool backpointers_zero = (queue->backpointers.current_size == 0 && queue->backpointers.length == 0 && queue->backpointers.data == ((void *)0) ); [L7489-L7492] _Bool backpointer_struct_is_valid = backpointers_zero || (backpointer_list_item_size && lists_equal_lengths && backpointers_non_zero_current_size && backpointers_valid_deep); [L7494] EXPR (backpointer_list_is_valid && backpointer_struct_is_valid) || aws_is_mem_zeroed(&(queue->backpointers), sizeof(queue->backpointers)) [L7494] return ((backpointer_list_is_valid && backpointer_struct_is_valid) || aws_is_mem_zeroed(&(queue->backpointers), sizeof(queue->backpointers))); [L7516-L7517] _Bool backpointers_valid = aws_priority_queue_backpointers_valid(queue); [L7518] return pred_is_valid && container_is_valid && backpointers_valid; [L211] COND FALSE !(!cond) [L7917] struct aws_array_list old_container = queue.container; [L7918] struct store_byte_from_buffer old_byte_container; [L7919] old_container.data [L7919] old_container.current_size [L7134] COND FALSE !(size > 0 && array && storage) [L7922] struct aws_array_list old_backpointers = queue.backpointers; [L7923] struct store_byte_from_buffer old_byte_backpointers; [L7924] old_backpointers.data [L7924] old_backpointers.current_size [L7134] COND FALSE !(size > 0 && array && storage) [L3475] EXPR list->length [L3475] !list->length || list->data [L211] COND FALSE !(!cond) [L3263] COND FALSE !(!list) [L3268] size_t required_size = 0; [L3272] EXPR list->length [L3272] EXPR list->item_size [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L3270-L3272] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L3275] EXPR list->current_size [L3275] EXPR \read(required_size) [L3274-L3275] _Bool current_size_is_valid = (list->current_size >= required_size); [L3279] EXPR list->current_size [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279] EXPR list->data [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279-L3281] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L3277-L3281] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L3284] EXPR list->item_size [L3283-L3284] _Bool item_size_is_valid = (list->item_size != 0); [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L3268] size_t required_size = 0; [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L211] COND FALSE !(!cond) [L3477] EXPR list->length [L3477] size_t len = list->length; [L3263] COND FALSE !(!list) [L3268] size_t required_size = 0; [L3272] EXPR list->length [L3272] EXPR list->item_size [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2496] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2498] *r = a * b [L2499] return (0); [L2588] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L3270-L3272] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L3275] EXPR list->current_size [L3275] EXPR \read(required_size) [L3274-L3275] _Bool current_size_is_valid = (list->current_size >= required_size); [L3279] EXPR list->current_size [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279] EXPR list->data [L3279-L3280] EXPR list->current_size == 0 && list->data == ((void *)0) [L3279-L3281] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L3277-L3281] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L3284] EXPR list->item_size [L3283-L3284] _Bool item_size_is_valid = (list->item_size != 0); [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L3268] size_t required_size = 0; [L3285] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L223] COND TRUE !cond [L223] reach_error() - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 246 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 345.0s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 72.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 4992 SDtfs, 9888 SDslu, 14886 SDs, 0 SdLazy, 5000 SolverSat, 601 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 52.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1169 GetRequests, 994 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 20.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=751occurred in iteration=15, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 1949 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.7s SsaConstructionTime, 235.9s SatisfiabilityAnalysisTime, 26.3s InterpolantComputationTime, 1297 NumberOfCodeBlocks, 1297 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1188 ConstructedInterpolants, 11 QuantifiedInterpolants, 5527 SizeOfPredicates, 185 NumberOfNonLiveVariables, 39958 ConjunctsInSsa, 632 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-06 11:47:48,343 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-06 11:47:48,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_priority_queue_size_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 1baae56bade188786b6c048f5a5545dd6165460ea50e58a0310e4360c89d1838 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 11:47:50,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 11:47:50,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 11:47:50,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 11:47:50,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 11:47:50,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 11:47:50,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 11:47:50,180 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 11:47:50,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 11:47:50,187 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 11:47:50,188 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 11:47:50,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 11:47:50,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 11:47:50,193 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 11:47:50,194 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 11:47:50,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 11:47:50,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 11:47:50,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 11:47:50,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 11:47:50,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 11:47:50,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 11:47:50,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 11:47:50,208 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 11:47:50,209 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 11:47:50,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 11:47:50,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 11:47:50,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 11:47:50,215 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 11:47:50,215 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 11:47:50,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 11:47:50,216 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 11:47:50,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 11:47:50,218 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 11:47:50,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 11:47:50,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 11:47:50,220 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 11:47:50,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 11:47:50,221 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 11:47:50,221 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 11:47:50,222 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 11:47:50,222 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 11:47:50,223 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-06 11:47:50,252 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 11:47:50,253 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 11:47:50,254 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 11:47:50,254 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 11:47:50,255 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 11:47:50,256 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 11:47:50,256 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 11:47:50,256 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 11:47:50,256 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 11:47:50,256 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 11:47:50,257 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 11:47:50,257 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 11:47:50,257 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-06 11:47:50,257 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-06 11:47:50,258 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 11:47:50,258 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 11:47:50,258 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 11:47:50,258 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 11:47:50,258 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 11:47:50,264 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 11:47:50,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 11:47:50,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 11:47:50,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 11:47:50,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 11:47:50,265 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-06 11:47:50,265 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-06 11:47:50,265 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 11:47:50,265 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 11:47:50,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 11:47:50,266 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 11:47:50,266 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-06 11:47:50,266 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 1baae56bade188786b6c048f5a5545dd6165460ea50e58a0310e4360c89d1838 [2021-11-06 11:47:50,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 11:47:50,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 11:47:50,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 11:47:50,637 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 11:47:50,637 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 11:47:50,638 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i [2021-11-06 11:47:50,693 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed526e878/014bd9ad1cd54d2080db5382aa4cdb72/FLAGa6ccf6307 [2021-11-06 11:47:51,318 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 11:47:51,318 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i [2021-11-06 11:47:51,342 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed526e878/014bd9ad1cd54d2080db5382aa4cdb72/FLAGa6ccf6307 [2021-11-06 11:47:51,678 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed526e878/014bd9ad1cd54d2080db5382aa4cdb72 [2021-11-06 11:47:51,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 11:47:51,681 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 11:47:51,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 11:47:51,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 11:47:51,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 11:47:51,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:47:51" (1/1) ... [2021-11-06 11:47:51,686 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3481c075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:47:51, skipping insertion in model container [2021-11-06 11:47:51,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:47:51" (1/1) ... [2021-11-06 11:47:51,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 11:47:51,760 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 11:47:51,996 WARN L228 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_priority_queue_size_harness.i[4497,4510] [2021-11-06 11:47:52,001 WARN L228 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_priority_queue_size_harness.i[4557,4570] [2021-11-06 11:47:52,014 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 11:47:52,019 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 11:47:52,494 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 11:47:52,560 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:47:52,561 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:47:52,561 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:47:52,562 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:47:52,564 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:47:52,586 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:47:52,588 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:47:52,589 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:47:52,589 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:47:52,937 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 11:47:52,938 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 11:47:52,939 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 11:47:52,944 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 11:47:52,945 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 11:47:52,946 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 11:47:52,947 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 11:47:52,947 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 11:47:52,948 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 11:47:52,948 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 11:47:53,048 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:47:53,049 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:47:53,079 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 11:47:53,121 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 11:47:53,130 WARN L228 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_priority_queue_size_harness.i[4497,4510] [2021-11-06 11:47:53,131 WARN L228 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_priority_queue_size_harness.i[4557,4570] [2021-11-06 11:47:53,132 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 11:47:53,133 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 11:47:53,151 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 11:47:53,159 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:47:53,160 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:47:53,160 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:47:53,161 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:47:53,161 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:47:53,166 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:47:53,166 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:47:53,167 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:47:53,167 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:47:53,190 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 11:47:53,191 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 11:47:53,191 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 11:47:53,192 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 11:47:53,192 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 11:47:53,193 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 11:47:53,193 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 11:47:53,193 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 11:47:53,194 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 11:47:53,194 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 11:47:53,275 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:47:53,275 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 11:47:53,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 11:47:53,519 INFO L208 MainTranslator]: Completed translation [2021-11-06 11:47:53,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:47:53 WrapperNode [2021-11-06 11:47:53,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 11:47:53,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 11:47:53,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 11:47:53,521 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 11:47:53,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:47:53" (1/1) ... [2021-11-06 11:47:53,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:47:53" (1/1) ... [2021-11-06 11:47:53,718 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 11:47:53,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 11:47:53,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 11:47:53,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 11:47:53,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:47:53" (1/1) ... [2021-11-06 11:47:53,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:47:53" (1/1) ... [2021-11-06 11:47:53,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:47:53" (1/1) ... [2021-11-06 11:47:53,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:47:53" (1/1) ... [2021-11-06 11:47:53,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:47:53" (1/1) ... [2021-11-06 11:47:53,806 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:47:53" (1/1) ... [2021-11-06 11:47:53,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:47:53" (1/1) ... [2021-11-06 11:47:53,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 11:47:53,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 11:47:53,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 11:47:53,826 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 11:47:53,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:47:53" (1/1) ... [2021-11-06 11:47:53,831 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 11:47:53,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 11:47:53,860 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-06 11:47:53,919 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-06 11:47:53,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 11:47:53,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-06 11:47:53,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-06 11:47:53,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-06 11:47:53,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 11:47:53,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 11:47:53,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 11:47:53,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 11:47:53,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-06 11:47:53,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-06 11:47:53,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 11:47:53,939 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-06 11:47:53,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 11:47:53,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-06 11:47:53,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-06 11:47:53,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 11:48:04,055 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 11:48:04,058 INFO L299 CfgBuilder]: Removed 188 assume(true) statements. [2021-11-06 11:48:04,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:48:04 BoogieIcfgContainer [2021-11-06 11:48:04,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 11:48:04,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 11:48:04,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 11:48:04,067 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 11:48:04,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:47:51" (1/3) ... [2021-11-06 11:48:04,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18849cd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:48:04, skipping insertion in model container [2021-11-06 11:48:04,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:47:53" (2/3) ... [2021-11-06 11:48:04,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18849cd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:48:04, skipping insertion in model container [2021-11-06 11:48:04,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:48:04" (3/3) ... [2021-11-06 11:48:04,069 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_priority_queue_size_harness.i [2021-11-06 11:48:04,073 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 11:48:04,074 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2021-11-06 11:48:04,125 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 11:48:04,134 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-06 11:48:04,134 INFO L340 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2021-11-06 11:48:04,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 246 states, 231 states have (on average 1.4458874458874458) internal successors, (334), 245 states have internal predecessors, (334), 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-06 11:48:04,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-06 11:48:04,163 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:48:04,164 INFO L513 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] [2021-11-06 11:48:04,164 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:48:04,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:48:04,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1385932008, now seen corresponding path program 1 times [2021-11-06 11:48:04,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 11:48:04,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520945616] [2021-11-06 11:48:04,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:48:04,187 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 11:48:04,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 11:48:04,189 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 11:48:04,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-06 11:48:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:48:06,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 1450 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-06 11:48:06,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:48:06,548 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-06 11:48:06,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 11:48:06,681 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-06 11:48:06,682 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 11:48:06,682 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520945616] [2021-11-06 11:48:06,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [520945616] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 11:48:06,682 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:48:06,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-06 11:48:06,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572849552] [2021-11-06 11:48:06,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 11:48:06,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 11:48:06,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 11:48:06,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 11:48:06,697 INFO L87 Difference]: Start difference. First operand has 246 states, 231 states have (on average 1.4458874458874458) internal successors, (334), 245 states have internal predecessors, (334), 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 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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-06 11:48:06,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:48:06,718 INFO L93 Difference]: Finished difference Result 486 states and 661 transitions. [2021-11-06 11:48:06,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 11:48:06,720 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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 40 [2021-11-06 11:48:06,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:48:06,726 INFO L225 Difference]: With dead ends: 486 [2021-11-06 11:48:06,727 INFO L226 Difference]: Without dead ends: 239 [2021-11-06 11:48:06,729 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 78 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-06 11:48:06,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-11-06 11:48:06,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2021-11-06 11:48:06,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 225 states have (on average 1.3244444444444445) internal successors, (298), 238 states have internal predecessors, (298), 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-06 11:48:06,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 298 transitions. [2021-11-06 11:48:06,759 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 298 transitions. Word has length 40 [2021-11-06 11:48:06,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:48:06,759 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 298 transitions. [2021-11-06 11:48:06,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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-06 11:48:06,760 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 298 transitions. [2021-11-06 11:48:06,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-06 11:48:06,761 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:48:06,761 INFO L513 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] [2021-11-06 11:48:06,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-06 11:48:06,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 11:48:06,988 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:48:06,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:48:06,988 INFO L85 PathProgramCache]: Analyzing trace with hash 577264856, now seen corresponding path program 1 times [2021-11-06 11:48:06,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 11:48:06,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367727606] [2021-11-06 11:48:06,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:48:06,994 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 11:48:06,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 11:48:06,996 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 11:48:06,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-06 11:48:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:48:09,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 1450 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 11:48:09,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:48:09,595 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-06 11:48:09,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 11:48:09,835 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-06 11:48:09,835 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 11:48:09,835 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367727606] [2021-11-06 11:48:09,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367727606] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 11:48:09,835 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:48:09,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-06 11:48:09,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180764174] [2021-11-06 11:48:09,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 11:48:09,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 11:48:09,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 11:48:09,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 11:48:09,837 INFO L87 Difference]: Start difference. First operand 239 states and 298 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-06 11:48:09,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:48:09,975 INFO L93 Difference]: Finished difference Result 398 states and 491 transitions. [2021-11-06 11:48:09,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 11:48:09,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2021-11-06 11:48:09,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:48:09,977 INFO L225 Difference]: With dead ends: 398 [2021-11-06 11:48:09,977 INFO L226 Difference]: Without dead ends: 239 [2021-11-06 11:48:09,978 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 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-06 11:48:09,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-11-06 11:48:09,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2021-11-06 11:48:09,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 225 states have (on average 1.3155555555555556) internal successors, (296), 238 states have internal predecessors, (296), 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-06 11:48:09,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 296 transitions. [2021-11-06 11:48:09,991 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 296 transitions. Word has length 40 [2021-11-06 11:48:09,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:48:09,992 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 296 transitions. [2021-11-06 11:48:09,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-06 11:48:09,992 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 296 transitions. [2021-11-06 11:48:09,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-06 11:48:09,994 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:48:09,995 INFO L513 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] [2021-11-06 11:48:10,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-06 11:48:10,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 11:48:10,219 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:48:10,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:48:10,220 INFO L85 PathProgramCache]: Analyzing trace with hash -252060921, now seen corresponding path program 1 times [2021-11-06 11:48:10,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 11:48:10,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897024776] [2021-11-06 11:48:10,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:48:10,223 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 11:48:10,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 11:48:10,226 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 11:48:10,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-06 11:48:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:48:12,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 1466 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-06 11:48:12,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:48:12,860 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-06 11:48:12,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 11:48:13,184 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-06 11:48:13,184 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 11:48:13,185 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897024776] [2021-11-06 11:48:13,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897024776] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 11:48:13,185 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:48:13,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-06 11:48:13,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461288162] [2021-11-06 11:48:13,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 11:48:13,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 11:48:13,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 11:48:13,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-06 11:48:13,187 INFO L87 Difference]: Start difference. First operand 239 states and 296 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 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-06 11:48:13,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:48:13,868 INFO L93 Difference]: Finished difference Result 509 states and 617 transitions. [2021-11-06 11:48:13,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 11:48:13,870 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 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 44 [2021-11-06 11:48:13,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:48:13,871 INFO L225 Difference]: With dead ends: 509 [2021-11-06 11:48:13,871 INFO L226 Difference]: Without dead ends: 318 [2021-11-06 11:48:13,872 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-06 11:48:13,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-11-06 11:48:13,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 239. [2021-11-06 11:48:13,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 225 states have (on average 1.3066666666666666) internal successors, (294), 238 states have internal predecessors, (294), 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-06 11:48:13,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 294 transitions. [2021-11-06 11:48:13,881 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 294 transitions. Word has length 44 [2021-11-06 11:48:13,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:48:13,881 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 294 transitions. [2021-11-06 11:48:13,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 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-06 11:48:13,882 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 294 transitions. [2021-11-06 11:48:13,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-06 11:48:13,883 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:48:13,883 INFO L513 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] [2021-11-06 11:48:13,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-06 11:48:14,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 11:48:14,100 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:48:14,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:48:14,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1945926435, now seen corresponding path program 1 times [2021-11-06 11:48:14,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 11:48:14,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734201248] [2021-11-06 11:48:14,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:48:14,103 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 11:48:14,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 11:48:14,110 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 11:48:14,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-06 11:48:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:48:16,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-06 11:48:16,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:48:16,984 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-06 11:48:16,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 11:48:17,270 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-06 11:48:17,271 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 11:48:17,271 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734201248] [2021-11-06 11:48:17,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1734201248] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 11:48:17,271 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:48:17,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-06 11:48:17,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837324832] [2021-11-06 11:48:17,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 11:48:17,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 11:48:17,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 11:48:17,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 11:48:17,273 INFO L87 Difference]: Start difference. First operand 239 states and 294 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-06 11:48:17,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:48:17,529 INFO L93 Difference]: Finished difference Result 399 states and 486 transitions. [2021-11-06 11:48:17,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 11:48:17,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 52 [2021-11-06 11:48:17,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:48:17,532 INFO L225 Difference]: With dead ends: 399 [2021-11-06 11:48:17,532 INFO L226 Difference]: Without dead ends: 239 [2021-11-06 11:48:17,532 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 11:48:17,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-11-06 11:48:17,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2021-11-06 11:48:17,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 225 states have (on average 1.2977777777777777) internal successors, (292), 238 states have internal predecessors, (292), 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-06 11:48:17,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 292 transitions. [2021-11-06 11:48:17,560 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 292 transitions. Word has length 52 [2021-11-06 11:48:17,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:48:17,562 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 292 transitions. [2021-11-06 11:48:17,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-06 11:48:17,562 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 292 transitions. [2021-11-06 11:48:17,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 11:48:17,565 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:48:17,566 INFO L513 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-06 11:48:17,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-06 11:48:17,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 11:48:17,775 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:48:17,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:48:17,776 INFO L85 PathProgramCache]: Analyzing trace with hash -909602284, now seen corresponding path program 1 times [2021-11-06 11:48:17,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 11:48:17,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932985268] [2021-11-06 11:48:17,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:48:17,779 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 11:48:17,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 11:48:17,780 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 11:48:17,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-06 11:48:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:48:20,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 1551 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-06 11:48:20,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:48:20,739 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-06 11:48:20,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 11:48:21,084 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-06 11:48:21,084 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 11:48:21,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932985268] [2021-11-06 11:48:21,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932985268] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 11:48:21,084 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:48:21,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2021-11-06 11:48:21,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121482924] [2021-11-06 11:48:21,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 11:48:21,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 11:48:21,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 11:48:21,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 11:48:21,086 INFO L87 Difference]: Start difference. First operand 239 states and 292 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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-06 11:48:21,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:48:21,706 INFO L93 Difference]: Finished difference Result 415 states and 506 transitions. [2021-11-06 11:48:21,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 11:48:21,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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-06 11:48:21,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:48:21,708 INFO L225 Difference]: With dead ends: 415 [2021-11-06 11:48:21,708 INFO L226 Difference]: Without dead ends: 239 [2021-11-06 11:48:21,709 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-06 11:48:21,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-11-06 11:48:21,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2021-11-06 11:48:21,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 225 states have (on average 1.288888888888889) internal successors, (290), 238 states have internal predecessors, (290), 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-06 11:48:21,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 290 transitions. [2021-11-06 11:48:21,722 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 290 transitions. Word has length 64 [2021-11-06 11:48:21,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:48:21,723 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 290 transitions. [2021-11-06 11:48:21,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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-06 11:48:21,723 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 290 transitions. [2021-11-06 11:48:21,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-06 11:48:21,727 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:48:21,727 INFO L513 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-06 11:48:21,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-06 11:48:21,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 11:48:21,932 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:48:21,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:48:21,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1743581048, now seen corresponding path program 1 times [2021-11-06 11:48:21,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 11:48:21,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [545575732] [2021-11-06 11:48:21,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:48:21,935 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 11:48:21,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 11:48:21,936 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 11:48:21,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-06 11:48:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:48:24,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 1604 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 11:48:24,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:48:24,913 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-06 11:48:24,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 11:48:25,114 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-06 11:48:25,114 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 11:48:25,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [545575732] [2021-11-06 11:48:25,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [545575732] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 11:48:25,114 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:48:25,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-06 11:48:25,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245169324] [2021-11-06 11:48:25,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 11:48:25,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 11:48:25,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 11:48:25,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 11:48:25,116 INFO L87 Difference]: Start difference. First operand 239 states and 290 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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-06 11:48:25,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:48:25,337 INFO L93 Difference]: Finished difference Result 554 states and 664 transitions. [2021-11-06 11:48:25,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 11:48:25,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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-06 11:48:25,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:48:25,340 INFO L225 Difference]: With dead ends: 554 [2021-11-06 11:48:25,340 INFO L226 Difference]: Without dead ends: 393 [2021-11-06 11:48:25,342 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 11:48:25,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2021-11-06 11:48:25,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 251. [2021-11-06 11:48:25,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 237 states have (on average 1.2911392405063291) internal successors, (306), 250 states have internal predecessors, (306), 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-06 11:48:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 306 transitions. [2021-11-06 11:48:25,355 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 306 transitions. Word has length 72 [2021-11-06 11:48:25,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:48:25,357 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 306 transitions. [2021-11-06 11:48:25,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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-06 11:48:25,360 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 306 transitions. [2021-11-06 11:48:25,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-06 11:48:25,360 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:48:25,360 INFO L513 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-06 11:48:25,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-06 11:48:25,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 11:48:25,576 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:48:25,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:48:25,576 INFO L85 PathProgramCache]: Analyzing trace with hash -2041913158, now seen corresponding path program 1 times [2021-11-06 11:48:25,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 11:48:25,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282154067] [2021-11-06 11:48:25,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:48:25,579 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 11:48:25,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 11:48:25,582 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 11:48:25,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-06 11:48:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:48:28,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 1607 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-06 11:48:28,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:48:29,056 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-06 11:48:29,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 11:48:29,386 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-06 11:48:29,386 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 11:48:29,386 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282154067] [2021-11-06 11:48:29,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282154067] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 11:48:29,387 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:48:29,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2021-11-06 11:48:29,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327204185] [2021-11-06 11:48:29,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 11:48:29,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 11:48:29,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 11:48:29,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-06 11:48:29,388 INFO L87 Difference]: Start difference. First operand 251 states and 306 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 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-06 11:48:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:48:40,628 INFO L93 Difference]: Finished difference Result 579 states and 697 transitions. [2021-11-06 11:48:40,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-06 11:48:40,630 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 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-06 11:48:40,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:48:40,631 INFO L225 Difference]: With dead ends: 579 [2021-11-06 11:48:40,632 INFO L226 Difference]: Without dead ends: 403 [2021-11-06 11:48:40,632 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-11-06 11:48:40,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-11-06 11:48:40,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 251. [2021-11-06 11:48:40,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 237 states have (on average 1.2827004219409284) internal successors, (304), 250 states have internal predecessors, (304), 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-06 11:48:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 304 transitions. [2021-11-06 11:48:40,640 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 304 transitions. Word has length 72 [2021-11-06 11:48:40,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:48:40,641 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 304 transitions. [2021-11-06 11:48:40,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 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-06 11:48:40,641 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 304 transitions. [2021-11-06 11:48:40,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-06 11:48:40,641 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:48:40,641 INFO L513 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-06 11:48:40,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-11-06 11:48:40,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 11:48:40,866 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:48:40,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:48:40,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1979873544, now seen corresponding path program 1 times [2021-11-06 11:48:40,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 11:48:40,869 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283054341] [2021-11-06 11:48:40,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:48:40,869 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 11:48:40,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 11:48:40,871 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 11:48:40,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-06 11:48:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:48:43,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 1605 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-06 11:48:43,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:48:44,310 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-06 11:48:44,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 11:48:44,711 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-06 11:48:44,711 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 11:48:44,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283054341] [2021-11-06 11:48:44,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283054341] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 11:48:44,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:48:44,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2021-11-06 11:48:44,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593807619] [2021-11-06 11:48:44,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 11:48:44,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 11:48:44,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 11:48:44,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-06 11:48:44,713 INFO L87 Difference]: Start difference. First operand 251 states and 304 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 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-06 11:48:53,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:48:53,772 INFO L93 Difference]: Finished difference Result 581 states and 695 transitions. [2021-11-06 11:48:53,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 11:48:53,774 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 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-06 11:48:53,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:48:53,775 INFO L225 Difference]: With dead ends: 581 [2021-11-06 11:48:53,775 INFO L226 Difference]: Without dead ends: 405 [2021-11-06 11:48:53,776 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-11-06 11:48:53,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2021-11-06 11:48:53,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 255. [2021-11-06 11:48:53,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 241 states have (on average 1.2697095435684647) internal successors, (306), 254 states have internal predecessors, (306), 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-06 11:48:53,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 306 transitions. [2021-11-06 11:48:53,783 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 306 transitions. Word has length 72 [2021-11-06 11:48:53,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:48:53,783 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 306 transitions. [2021-11-06 11:48:53,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 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-06 11:48:53,783 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 306 transitions. [2021-11-06 11:48:53,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-06 11:48:53,784 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:48:53,784 INFO L513 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-06 11:48:53,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-11-06 11:48:53,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 11:48:53,991 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:48:53,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:48:53,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2113887050, now seen corresponding path program 1 times [2021-11-06 11:48:53,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 11:48:53,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658590269] [2021-11-06 11:48:53,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:48:53,995 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 11:48:53,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 11:48:53,996 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 11:48:53,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-06 11:48:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:48:56,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 1602 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-06 11:48:56,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:48:59,390 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-06 11:48:59,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 133 treesize of output 113 [2021-11-06 11:48:59,555 INFO L354 Elim1Store]: treesize reduction 44, result has 36.2 percent of original size [2021-11-06 11:48:59,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 107 treesize of output 83 [2021-11-06 11:48:59,567 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-06 11:48:59,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 83 treesize of output 63 [2021-11-06 11:48:59,852 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-06 11:48:59,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 11:49:06,967 INFO L354 Elim1Store]: treesize reduction 21, result has 54.3 percent of original size [2021-11-06 11:49:06,968 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 141 [2021-11-06 11:49:07,193 INFO L354 Elim1Store]: treesize reduction 21, result has 54.3 percent of original size [2021-11-06 11:49:07,193 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 137 [2021-11-06 11:49:10,017 INFO L354 Elim1Store]: treesize reduction 122, result has 43.8 percent of original size [2021-11-06 11:49:10,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 103 treesize of output 137 [2021-11-06 11:49:12,031 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-06 11:49:12,032 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 11:49:12,032 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658590269] [2021-11-06 11:49:12,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658590269] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 11:49:12,032 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:49:12,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 21 [2021-11-06 11:49:12,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926107076] [2021-11-06 11:49:12,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-06 11:49:12,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 11:49:12,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-06 11:49:12,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=352, Unknown=1, NotChecked=0, Total=420 [2021-11-06 11:49:12,033 INFO L87 Difference]: Start difference. First operand 255 states and 306 transitions. Second operand has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 21 states have internal predecessors, (130), 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-06 11:49:42,868 WARN L207 SmtUtils]: Spent 15.98 s on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2021-11-06 11:49:50,053 WARN L207 SmtUtils]: Spent 6.34 s on a formula simplification that was a NOOP. DAG size: 82 [2021-11-06 11:50:36,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:50:36,722 INFO L93 Difference]: Finished difference Result 995 states and 1159 transitions. [2021-11-06 11:50:36,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-06 11:50:36,724 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 21 states have internal predecessors, (130), 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-06 11:50:36,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:50:36,728 INFO L225 Difference]: With dead ends: 995 [2021-11-06 11:50:36,728 INFO L226 Difference]: Without dead ends: 840 [2021-11-06 11:50:36,729 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 49.1s TimeCoverageRelationStatistics Valid=596, Invalid=1953, Unknown=1, NotChecked=0, Total=2550 [2021-11-06 11:50:36,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2021-11-06 11:50:36,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 263. [2021-11-06 11:50:36,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 249 states have (on average 1.2650602409638554) internal successors, (315), 262 states have internal predecessors, (315), 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-06 11:50:36,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 315 transitions. [2021-11-06 11:50:36,749 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 315 transitions. Word has length 72 [2021-11-06 11:50:36,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:50:36,750 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 315 transitions. [2021-11-06 11:50:36,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 21 states have internal predecessors, (130), 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-06 11:50:36,750 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 315 transitions. [2021-11-06 11:50:36,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-06 11:50:36,750 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:50:36,750 INFO L513 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, 1, 1, 1] [2021-11-06 11:50:36,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-11-06 11:50:36,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 11:50:36,964 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:50:36,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:50:36,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1649090632, now seen corresponding path program 1 times [2021-11-06 11:50:36,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 11:50:36,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740737123] [2021-11-06 11:50:36,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:50:36,967 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 11:50:36,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 11:50:36,968 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 11:50:36,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-06 11:50:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:50:39,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 1617 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 11:50:39,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:50:40,076 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-06 11:50:40,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 11:50:40,270 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-06 11:50:40,270 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 11:50:40,270 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740737123] [2021-11-06 11:50:40,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1740737123] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 11:50:40,270 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:50:40,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 11:50:40,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288175575] [2021-11-06 11:50:40,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 11:50:40,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 11:50:40,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 11:50:40,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 11:50:40,271 INFO L87 Difference]: Start difference. First operand 263 states and 315 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-06 11:50:40,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:50:40,373 INFO L93 Difference]: Finished difference Result 774 states and 918 transitions. [2021-11-06 11:50:40,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 11:50:40,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 75 [2021-11-06 11:50:40,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:50:40,375 INFO L225 Difference]: With dead ends: 774 [2021-11-06 11:50:40,375 INFO L226 Difference]: Without dead ends: 603 [2021-11-06 11:50:40,376 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 11:50:40,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2021-11-06 11:50:40,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 271. [2021-11-06 11:50:40,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 257 states have (on average 1.264591439688716) internal successors, (325), 270 states have internal predecessors, (325), 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-06 11:50:40,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 325 transitions. [2021-11-06 11:50:40,392 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 325 transitions. Word has length 75 [2021-11-06 11:50:40,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:50:40,392 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 325 transitions. [2021-11-06 11:50:40,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-06 11:50:40,392 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 325 transitions. [2021-11-06 11:50:40,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-06 11:50:40,393 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:50:40,393 INFO L513 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, 1, 1, 1] [2021-11-06 11:50:40,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-06 11:50:40,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 11:50:40,607 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:50:40,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:50:40,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1143681902, now seen corresponding path program 1 times [2021-11-06 11:50:40,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 11:50:40,611 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703605372] [2021-11-06 11:50:40,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:50:40,611 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 11:50:40,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 11:50:40,612 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 11:50:40,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-06 11:50:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:50:43,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 1619 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-06 11:50:43,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:50:44,084 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-06 11:50:44,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 11:50:44,272 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-06 11:50:44,272 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 11:50:44,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703605372] [2021-11-06 11:50:44,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703605372] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 11:50:44,273 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:50:44,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2021-11-06 11:50:44,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953855062] [2021-11-06 11:50:44,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 11:50:44,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 11:50:44,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 11:50:44,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 11:50:44,274 INFO L87 Difference]: Start difference. First operand 271 states and 325 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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-06 11:50:44,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:50:44,731 INFO L93 Difference]: Finished difference Result 508 states and 595 transitions. [2021-11-06 11:50:44,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 11:50:44,731 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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 75 [2021-11-06 11:50:44,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:50:44,732 INFO L225 Difference]: With dead ends: 508 [2021-11-06 11:50:44,732 INFO L226 Difference]: Without dead ends: 334 [2021-11-06 11:50:44,733 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-11-06 11:50:44,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-11-06 11:50:44,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 271. [2021-11-06 11:50:44,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 257 states have (on average 1.2568093385214008) internal successors, (323), 270 states have internal predecessors, (323), 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-06 11:50:44,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 323 transitions. [2021-11-06 11:50:44,746 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 323 transitions. Word has length 75 [2021-11-06 11:50:44,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:50:44,747 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 323 transitions. [2021-11-06 11:50:44,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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-06 11:50:44,748 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 323 transitions. [2021-11-06 11:50:44,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-06 11:50:44,748 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:50:44,748 INFO L513 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, 1, 1, 1] [2021-11-06 11:50:44,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-06 11:50:44,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 11:50:44,958 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:50:44,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:50:44,958 INFO L85 PathProgramCache]: Analyzing trace with hash -18397150, now seen corresponding path program 1 times [2021-11-06 11:50:44,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 11:50:44,961 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982252363] [2021-11-06 11:50:44,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:50:44,961 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 11:50:44,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 11:50:44,962 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 11:50:44,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-06 11:50:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:50:48,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 1614 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-06 11:50:48,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:50:48,645 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-06 11:50:48,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 11:50:49,203 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-06 11:50:49,203 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 11:50:49,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982252363] [2021-11-06 11:50:49,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982252363] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 11:50:49,203 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:50:49,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-06 11:50:49,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192228903] [2021-11-06 11:50:49,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 11:50:49,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 11:50:49,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 11:50:49,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 11:50:49,204 INFO L87 Difference]: Start difference. First operand 271 states and 323 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-06 11:50:49,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:50:49,739 INFO L93 Difference]: Finished difference Result 412 states and 487 transitions. [2021-11-06 11:50:49,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 11:50:49,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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 75 [2021-11-06 11:50:49,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:50:49,742 INFO L225 Difference]: With dead ends: 412 [2021-11-06 11:50:49,742 INFO L226 Difference]: Without dead ends: 271 [2021-11-06 11:50:49,742 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 11:50:49,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-11-06 11:50:49,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2021-11-06 11:50:49,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 257 states have (on average 1.2490272373540856) internal successors, (321), 270 states have internal predecessors, (321), 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-06 11:50:49,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 321 transitions. [2021-11-06 11:50:49,757 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 321 transitions. Word has length 75 [2021-11-06 11:50:49,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:50:49,757 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 321 transitions. [2021-11-06 11:50:49,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-06 11:50:49,757 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 321 transitions. [2021-11-06 11:50:49,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-06 11:50:49,758 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:50:49,758 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 11:50:49,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-11-06 11:50:49,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 11:50:49,967 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:50:49,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:50:49,968 INFO L85 PathProgramCache]: Analyzing trace with hash -973458324, now seen corresponding path program 1 times [2021-11-06 11:50:49,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 11:50:49,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655835184] [2021-11-06 11:50:49,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:50:49,971 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 11:50:49,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 11:50:49,972 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 11:50:49,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-06 11:50:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:50:53,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 1717 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 11:50:53,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:50:53,685 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-06 11:50:53,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 11:50:53,825 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-06 11:50:53,826 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 11:50:53,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655835184] [2021-11-06 11:50:53,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655835184] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 11:50:53,826 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:50:53,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-06 11:50:53,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661307584] [2021-11-06 11:50:53,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 11:50:53,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 11:50:53,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 11:50:53,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 11:50:53,827 INFO L87 Difference]: Start difference. First operand 271 states and 321 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-06 11:50:54,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:50:54,312 INFO L93 Difference]: Finished difference Result 525 states and 627 transitions. [2021-11-06 11:50:54,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 11:50:54,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 91 [2021-11-06 11:50:54,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:50:54,322 INFO L225 Difference]: With dead ends: 525 [2021-11-06 11:50:54,322 INFO L226 Difference]: Without dead ends: 301 [2021-11-06 11:50:54,323 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 179 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-06 11:50:54,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-11-06 11:50:54,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 283. [2021-11-06 11:50:54,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 269 states have (on average 1.237918215613383) internal successors, (333), 282 states have internal predecessors, (333), 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-06 11:50:54,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 333 transitions. [2021-11-06 11:50:54,365 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 333 transitions. Word has length 91 [2021-11-06 11:50:54,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:50:54,365 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 333 transitions. [2021-11-06 11:50:54,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-06 11:50:54,365 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 333 transitions. [2021-11-06 11:50:54,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-06 11:50:54,366 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:50:54,366 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 11:50:54,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-11-06 11:50:54,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 11:50:54,579 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:50:54,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:50:54,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1546501610, now seen corresponding path program 1 times [2021-11-06 11:50:54,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 11:50:54,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615376795] [2021-11-06 11:50:54,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:50:54,583 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 11:50:54,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 11:50:54,585 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 11:50:54,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-06 11:51:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:51:12,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 1720 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-06 11:51:12,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:51:14,117 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-06 11:51:14,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 11:51:14,982 INFO L354 Elim1Store]: treesize reduction 49, result has 42.4 percent of original size [2021-11-06 11:51:14,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 47 [2021-11-06 11:51:16,040 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-06 11:51:16,040 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 11:51:16,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615376795] [2021-11-06 11:51:16,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615376795] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 11:51:16,041 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:51:16,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 7] imperfect sequences [] total 14 [2021-11-06 11:51:16,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352863019] [2021-11-06 11:51:16,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-06 11:51:16,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 11:51:16,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-06 11:51:16,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-06 11:51:16,043 INFO L87 Difference]: Start difference. First operand 283 states and 333 transitions. Second operand has 14 states, 14 states have (on average 9.5) internal successors, (133), 14 states have internal predecessors, (133), 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-06 11:51:24,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:51:24,754 INFO L93 Difference]: Finished difference Result 687 states and 806 transitions. [2021-11-06 11:51:24,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-06 11:51:24,756 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.5) internal successors, (133), 14 states have internal predecessors, (133), 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 91 [2021-11-06 11:51:24,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:51:24,757 INFO L225 Difference]: With dead ends: 687 [2021-11-06 11:51:24,757 INFO L226 Difference]: Without dead ends: 483 [2021-11-06 11:51:24,758 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=201, Invalid=501, Unknown=0, NotChecked=0, Total=702 [2021-11-06 11:51:24,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2021-11-06 11:51:24,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 297. [2021-11-06 11:51:24,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 283 states have (on average 1.2402826855123674) internal successors, (351), 296 states have internal predecessors, (351), 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-06 11:51:24,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 351 transitions. [2021-11-06 11:51:24,774 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 351 transitions. Word has length 91 [2021-11-06 11:51:24,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:51:24,775 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 351 transitions. [2021-11-06 11:51:24,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.5) internal successors, (133), 14 states have internal predecessors, (133), 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-06 11:51:24,775 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 351 transitions. [2021-11-06 11:51:24,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-06 11:51:24,776 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:51:24,776 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 11:51:24,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-06 11:51:24,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 11:51:24,991 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:51:24,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:51:24,992 INFO L85 PathProgramCache]: Analyzing trace with hash -801928638, now seen corresponding path program 1 times [2021-11-06 11:51:24,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 11:51:24,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113100767] [2021-11-06 11:51:24,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:51:24,994 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 11:51:24,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 11:51:24,996 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 11:51:24,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-06 11:51:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:51:28,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 1721 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-06 11:51:28,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:51:29,049 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-06 11:51:29,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 11:51:29,452 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-06 11:51:29,453 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 11:51:29,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113100767] [2021-11-06 11:51:29,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113100767] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 11:51:29,453 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:51:29,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2021-11-06 11:51:29,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079489474] [2021-11-06 11:51:29,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 11:51:29,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 11:51:29,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 11:51:29,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 11:51:29,454 INFO L87 Difference]: Start difference. First operand 297 states and 351 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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-06 11:51:34,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:51:34,585 INFO L93 Difference]: Finished difference Result 688 states and 803 transitions. [2021-11-06 11:51:34,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 11:51:34,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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 93 [2021-11-06 11:51:34,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:51:34,588 INFO L225 Difference]: With dead ends: 688 [2021-11-06 11:51:34,588 INFO L226 Difference]: Without dead ends: 439 [2021-11-06 11:51:34,589 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-11-06 11:51:34,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2021-11-06 11:51:34,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 301. [2021-11-06 11:51:34,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 287 states have (on average 1.2299651567944252) internal successors, (353), 300 states have internal predecessors, (353), 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-06 11:51:34,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 353 transitions. [2021-11-06 11:51:34,606 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 353 transitions. Word has length 93 [2021-11-06 11:51:34,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:51:34,607 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 353 transitions. [2021-11-06 11:51:34,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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-06 11:51:34,607 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 353 transitions. [2021-11-06 11:51:34,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-06 11:51:34,609 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:51:34,609 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 11:51:34,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-06 11:51:34,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 11:51:34,835 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 11:51:34,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:51:34,836 INFO L85 PathProgramCache]: Analyzing trace with hash -358027964, now seen corresponding path program 1 times [2021-11-06 11:51:34,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 11:51:34,839 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746786552] [2021-11-06 11:51:34,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:51:34,839 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 11:51:34,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 11:51:34,840 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 11:51:34,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process Killed by 15