./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_priority_queue_push_ref_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fcb8e130 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_priority_queue_push_ref_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 00eefb20b1e97d60d3c6a842acdb225be14d327e18edfa8146d29fe131145042 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 20:32:49,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 20:32:49,934 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 20:32:49,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 20:32:49,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 20:32:49,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 20:32:49,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 20:32:49,971 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 20:32:49,972 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 20:32:49,975 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 20:32:49,976 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 20:32:49,977 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 20:32:49,977 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 20:32:49,979 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 20:32:49,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 20:32:49,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 20:32:49,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 20:32:49,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 20:32:49,985 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 20:32:49,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 20:32:49,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 20:32:49,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 20:32:49,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 20:32:49,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 20:32:49,997 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 20:32:49,997 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 20:32:49,997 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 20:32:49,998 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 20:32:49,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 20:32:49,999 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 20:32:49,999 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 20:32:50,000 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 20:32:50,001 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 20:32:50,002 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 20:32:50,003 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 20:32:50,003 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 20:32:50,003 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 20:32:50,004 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 20:32:50,004 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 20:32:50,004 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 20:32:50,005 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 20:32:50,006 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-22 20:32:50,030 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 20:32:50,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 20:32:50,030 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 20:32:50,030 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 20:32:50,032 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 20:32:50,032 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 20:32:50,032 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 20:32:50,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 20:32:50,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 20:32:50,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 20:32:50,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 20:32:50,033 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 20:32:50,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 20:32:50,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 20:32:50,033 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 20:32:50,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 20:32:50,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 20:32:50,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 20:32:50,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 20:32:50,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 20:32:50,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 20:32:50,034 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 20:32:50,034 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 20:32:50,035 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 20:32:50,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 20:32:50,035 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 20:32:50,035 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 20:32:50,035 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 20:32:50,035 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 20:32:50,035 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 -> 00eefb20b1e97d60d3c6a842acdb225be14d327e18edfa8146d29fe131145042 [2021-11-22 20:32:50,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 20:32:50,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 20:32:50,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 20:32:50,211 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 20:32:50,211 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 20:32:50,212 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_push_ref_harness.i [2021-11-22 20:32:50,262 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0101b3ee6/5fb8f776e15849efbce629775994fb5f/FLAG179745e4e [2021-11-22 20:32:50,831 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 20:32:50,832 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_push_ref_harness.i [2021-11-22 20:32:50,857 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0101b3ee6/5fb8f776e15849efbce629775994fb5f/FLAG179745e4e [2021-11-22 20:32:51,283 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0101b3ee6/5fb8f776e15849efbce629775994fb5f [2021-11-22 20:32:51,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 20:32:51,290 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 20:32:51,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 20:32:51,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 20:32:51,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 20:32:51,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:32:51" (1/1) ... [2021-11-22 20:32:51,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c98db56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:32:51, skipping insertion in model container [2021-11-22 20:32:51,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:32:51" (1/1) ... [2021-11-22 20:32:51,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 20:32:51,367 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 20:32:51,545 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_push_ref_harness.i[4501,4514] [2021-11-22 20:32:51,550 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_push_ref_harness.i[4561,4574] [2021-11-22 20:32:52,026 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,027 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,027 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,027 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,028 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,036 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,040 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,041 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,043 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,044 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,045 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,045 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,045 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,265 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 20:32:52,266 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 20:32:52,267 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 20:32:52,269 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 20:32:52,270 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 20:32:52,270 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 20:32:52,271 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 20:32:52,271 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 20:32:52,275 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 20:32:52,276 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 20:32:52,363 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 20:32:52,379 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,383 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,424 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,425 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,425 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,426 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,426 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,427 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,428 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,428 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,430 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,430 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,430 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,431 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,431 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,433 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,433 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,434 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,434 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,437 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,437 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,442 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,442 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,443 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,451 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 20:32:52,473 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 20:32:52,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_push_ref_harness.i[4501,4514] [2021-11-22 20:32:52,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_push_ref_harness.i[4561,4574] [2021-11-22 20:32:52,526 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,528 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,529 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,529 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,529 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,533 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,535 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,548 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,548 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,548 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,549 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,549 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,549 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,601 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 20:32:52,602 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 20:32:52,602 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 20:32:52,603 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 20:32:52,603 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 20:32:52,604 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 20:32:52,604 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 20:32:52,605 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 20:32:52,605 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 20:32:52,605 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 20:32:52,652 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 20:32:52,683 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,686 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,721 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,722 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,722 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,722 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,722 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,723 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,723 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,724 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,724 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,724 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,724 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,724 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,724 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,726 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,726 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,726 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,727 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,730 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,730 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,734 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,734 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,735 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:32:52,745 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 20:32:52,868 INFO L208 MainTranslator]: Completed translation [2021-11-22 20:32:52,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:32:52 WrapperNode [2021-11-22 20:32:52,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 20:32:52,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 20:32:52,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 20:32:52,870 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 20:32:52,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:32:52" (1/1) ... [2021-11-22 20:32:52,956 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:32:52" (1/1) ... [2021-11-22 20:32:53,183 INFO L137 Inliner]: procedures = 697, calls = 1880, calls flagged for inlining = 787, calls inlined = 931, statements flattened = 12386 [2021-11-22 20:32:53,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 20:32:53,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 20:32:53,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 20:32:53,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 20:32:53,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:32:52" (1/1) ... [2021-11-22 20:32:53,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:32:52" (1/1) ... [2021-11-22 20:32:53,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:32:52" (1/1) ... [2021-11-22 20:32:53,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:32:52" (1/1) ... [2021-11-22 20:32:53,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:32:52" (1/1) ... [2021-11-22 20:32:53,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:32:52" (1/1) ... [2021-11-22 20:32:53,471 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:32:52" (1/1) ... [2021-11-22 20:32:53,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 20:32:53,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 20:32:53,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 20:32:53,507 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 20:32:53,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:32:52" (1/1) ... [2021-11-22 20:32:53,512 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 20:32:53,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:32:53,528 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-22 20:32:53,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-22 20:32:53,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 20:32:53,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 20:32:53,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 20:32:53,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 20:32:53,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 20:32:53,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 20:32:53,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 20:32:53,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 20:32:53,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 20:32:53,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 20:32:53,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 20:32:53,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 20:32:53,868 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 20:32:53,870 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 20:32:57,332 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 20:32:57,352 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 20:32:57,352 INFO L301 CfgBuilder]: Removed 21 assume(true) statements. [2021-11-22 20:32:57,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:32:57 BoogieIcfgContainer [2021-11-22 20:32:57,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 20:32:57,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 20:32:57,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 20:32:57,360 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 20:32:57,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 08:32:51" (1/3) ... [2021-11-22 20:32:57,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f12bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:32:57, skipping insertion in model container [2021-11-22 20:32:57,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:32:52" (2/3) ... [2021-11-22 20:32:57,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f12bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:32:57, skipping insertion in model container [2021-11-22 20:32:57,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:32:57" (3/3) ... [2021-11-22 20:32:57,365 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_priority_queue_push_ref_harness.i [2021-11-22 20:32:57,369 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 20:32:57,369 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 63 error locations. [2021-11-22 20:32:57,409 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 20:32:57,414 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-22 20:32:57,414 INFO L340 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2021-11-22 20:32:57,448 INFO L276 IsEmpty]: Start isEmpty. Operand has 2321 states, 2257 states have (on average 1.412051395657953) internal successors, (3187), 2320 states have internal predecessors, (3187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:32:57,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-22 20:32:57,454 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:32:57,455 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:32:57,455 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:32:57,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:32:57,459 INFO L85 PathProgramCache]: Analyzing trace with hash -966206977, now seen corresponding path program 1 times [2021-11-22 20:32:57,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:32:57,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811280565] [2021-11-22 20:32:57,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:32:57,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:32:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:32:57,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:32:57,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:32:57,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811280565] [2021-11-22 20:32:57,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811280565] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:32:57,806 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:32:57,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 20:32:57,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056289364] [2021-11-22 20:32:57,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:32:57,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-22 20:32:57,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:32:57,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-22 20:32:57,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 20:32:57,840 INFO L87 Difference]: Start difference. First operand has 2321 states, 2257 states have (on average 1.412051395657953) internal successors, (3187), 2320 states have internal predecessors, (3187), 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 32.0) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:32:57,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:32:57,909 INFO L93 Difference]: Finished difference Result 4635 states and 6366 transitions. [2021-11-22 20:32:57,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-22 20:32:57,911 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-22 20:32:57,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:32:57,926 INFO L225 Difference]: With dead ends: 4635 [2021-11-22 20:32:57,926 INFO L226 Difference]: Without dead ends: 2315 [2021-11-22 20:32:57,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 20:32:57,935 INFO L933 BasicCegarLoop]: 2989 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2989 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:32:57,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2989 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:32:57,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2021-11-22 20:32:58,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2315. [2021-11-22 20:32:58,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2315 states, 2252 states have (on average 1.325044404973357) internal successors, (2984), 2314 states have internal predecessors, (2984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:32:58,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 2984 transitions. [2021-11-22 20:32:58,011 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 2984 transitions. Word has length 64 [2021-11-22 20:32:58,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:32:58,012 INFO L470 AbstractCegarLoop]: Abstraction has 2315 states and 2984 transitions. [2021-11-22 20:32:58,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:32:58,012 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 2984 transitions. [2021-11-22 20:32:58,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-22 20:32:58,014 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:32:58,014 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:32:58,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 20:32:58,015 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:32:58,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:32:58,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1823598091, now seen corresponding path program 1 times [2021-11-22 20:32:58,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:32:58,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664659495] [2021-11-22 20:32:58,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:32:58,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:32:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:32:58,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:32:58,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:32:58,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664659495] [2021-11-22 20:32:58,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664659495] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:32:58,140 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:32:58,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:32:58,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473487082] [2021-11-22 20:32:58,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:32:58,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:32:58,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:32:58,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:32:58,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:32:58,142 INFO L87 Difference]: Start difference. First operand 2315 states and 2984 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:32:58,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:32:58,272 INFO L93 Difference]: Finished difference Result 4550 states and 5863 transitions. [2021-11-22 20:32:58,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:32:58,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-22 20:32:58,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:32:58,278 INFO L225 Difference]: With dead ends: 4550 [2021-11-22 20:32:58,279 INFO L226 Difference]: Without dead ends: 2315 [2021-11-22 20:32:58,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:32:58,282 INFO L933 BasicCegarLoop]: 2969 mSDtfsCounter, 4659 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4659 SdHoareTripleChecker+Valid, 4221 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:32:58,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4659 Valid, 4221 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:32:58,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2021-11-22 20:32:58,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2315. [2021-11-22 20:32:58,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2315 states, 2252 states have (on average 1.3237122557726466) internal successors, (2981), 2314 states have internal predecessors, (2981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:32:58,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 2981 transitions. [2021-11-22 20:32:58,320 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 2981 transitions. Word has length 64 [2021-11-22 20:32:58,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:32:58,321 INFO L470 AbstractCegarLoop]: Abstraction has 2315 states and 2981 transitions. [2021-11-22 20:32:58,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:32:58,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 2981 transitions. [2021-11-22 20:32:58,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-22 20:32:58,328 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:32:58,328 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:32:58,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 20:32:58,329 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:32:58,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:32:58,329 INFO L85 PathProgramCache]: Analyzing trace with hash 998964115, now seen corresponding path program 1 times [2021-11-22 20:32:58,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:32:58,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383677802] [2021-11-22 20:32:58,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:32:58,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:32:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:32:58,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:32:58,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:32:58,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383677802] [2021-11-22 20:32:58,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383677802] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:32:58,510 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:32:58,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:32:58,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397761998] [2021-11-22 20:32:58,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:32:58,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:32:58,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:32:58,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:32:58,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:32:58,512 INFO L87 Difference]: Start difference. First operand 2315 states and 2981 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-22 20:32:59,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:32:59,309 INFO L93 Difference]: Finished difference Result 5249 states and 6726 transitions. [2021-11-22 20:32:59,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:32:59,309 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-22 20:32:59,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:32:59,317 INFO L225 Difference]: With dead ends: 5249 [2021-11-22 20:32:59,317 INFO L226 Difference]: Without dead ends: 2982 [2021-11-22 20:32:59,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:32:59,321 INFO L933 BasicCegarLoop]: 2948 mSDtfsCounter, 6382 mSDsluCounter, 3064 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6382 SdHoareTripleChecker+Valid, 6012 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-22 20:32:59,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6382 Valid, 6012 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-22 20:32:59,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2021-11-22 20:32:59,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2315. [2021-11-22 20:32:59,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2315 states, 2252 states have (on average 1.322380106571936) internal successors, (2978), 2314 states have internal predecessors, (2978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:32:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 2978 transitions. [2021-11-22 20:32:59,362 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 2978 transitions. Word has length 72 [2021-11-22 20:32:59,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:32:59,363 INFO L470 AbstractCegarLoop]: Abstraction has 2315 states and 2978 transitions. [2021-11-22 20:32:59,363 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-22 20:32:59,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 2978 transitions. [2021-11-22 20:32:59,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-22 20:32:59,364 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:32:59,364 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:32:59,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 20:32:59,365 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:32:59,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:32:59,365 INFO L85 PathProgramCache]: Analyzing trace with hash -984193973, now seen corresponding path program 1 times [2021-11-22 20:32:59,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:32:59,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824786295] [2021-11-22 20:32:59,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:32:59,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:32:59,409 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:32:59,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1198018877] [2021-11-22 20:32:59,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:32:59,410 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:32:59,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:32:59,411 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:32:59,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-22 20:32:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:32:59,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 2454 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-22 20:32:59,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:33:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:33:00,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:33:00,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:33:00,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824786295] [2021-11-22 20:33:00,024 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:33:00,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198018877] [2021-11-22 20:33:00,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198018877] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:33:00,024 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:33:00,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:33:00,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274836074] [2021-11-22 20:33:00,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:33:00,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:33:00,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:33:00,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:33:00,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:33:00,025 INFO L87 Difference]: Start difference. First operand 2315 states and 2978 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) 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-22 20:33:00,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:33:00,476 INFO L93 Difference]: Finished difference Result 5257 states and 6741 transitions. [2021-11-22 20:33:00,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 20:33:00,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) 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-22 20:33:00,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:33:00,484 INFO L225 Difference]: With dead ends: 5257 [2021-11-22 20:33:00,484 INFO L226 Difference]: Without dead ends: 3021 [2021-11-22 20:33:00,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-22 20:33:00,487 INFO L933 BasicCegarLoop]: 2830 mSDtfsCounter, 11995 mSDsluCounter, 2354 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11995 SdHoareTripleChecker+Valid, 5184 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:33:00,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11995 Valid, 5184 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 20:33:00,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2021-11-22 20:33:00,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 2315. [2021-11-22 20:33:00,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2315 states, 2252 states have (on average 1.3210479573712255) internal successors, (2975), 2314 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 2975 transitions. [2021-11-22 20:33:00,539 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 2975 transitions. Word has length 88 [2021-11-22 20:33:00,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:33:00,539 INFO L470 AbstractCegarLoop]: Abstraction has 2315 states and 2975 transitions. [2021-11-22 20:33:00,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) 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-22 20:33:00,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 2975 transitions. [2021-11-22 20:33:00,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-22 20:33:00,540 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:33:00,541 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:33:00,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-22 20:33:00,757 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-22 20:33:00,757 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:33:00,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:33:00,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1935115155, now seen corresponding path program 1 times [2021-11-22 20:33:00,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:33:00,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110491430] [2021-11-22 20:33:00,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:00,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:33:00,800 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:33:00,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [521533656] [2021-11-22 20:33:00,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:00,801 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:33:00,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:33:00,802 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:33:00,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-22 20:33:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:33:01,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 2556 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-22 20:33:01,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:33:01,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:33:01,362 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:33:01,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:33:01,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110491430] [2021-11-22 20:33:01,363 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:33:01,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521533656] [2021-11-22 20:33:01,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521533656] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:33:01,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:33:01,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:33:01,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110956578] [2021-11-22 20:33:01,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:33:01,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:33:01,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:33:01,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:33:01,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:33:01,365 INFO L87 Difference]: Start difference. First operand 2315 states and 2975 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:01,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:33:01,579 INFO L93 Difference]: Finished difference Result 4599 states and 5910 transitions. [2021-11-22 20:33:01,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:33:01,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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 112 [2021-11-22 20:33:01,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:33:01,585 INFO L225 Difference]: With dead ends: 4599 [2021-11-22 20:33:01,585 INFO L226 Difference]: Without dead ends: 2355 [2021-11-22 20:33:01,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:33:01,588 INFO L933 BasicCegarLoop]: 2971 mSDtfsCounter, 21 mSDsluCounter, 5840 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8811 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:33:01,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 8811 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:33:01,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2355 states. [2021-11-22 20:33:01,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2355 to 2335. [2021-11-22 20:33:01,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2335 states, 2272 states have (on average 1.3182218309859155) internal successors, (2995), 2334 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:01,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 2995 transitions. [2021-11-22 20:33:01,633 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 2995 transitions. Word has length 112 [2021-11-22 20:33:01,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:33:01,633 INFO L470 AbstractCegarLoop]: Abstraction has 2335 states and 2995 transitions. [2021-11-22 20:33:01,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:01,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 2995 transitions. [2021-11-22 20:33:01,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-22 20:33:01,634 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:33:01,634 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:33:01,669 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-22 20:33:01,870 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-22 20:33:01,870 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:33:01,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:33:01,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1660355541, now seen corresponding path program 1 times [2021-11-22 20:33:01,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:33:01,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200800027] [2021-11-22 20:33:01,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:01,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:33:01,913 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:33:01,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [258553944] [2021-11-22 20:33:01,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:01,913 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:33:01,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:33:01,915 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:33:01,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-22 20:33:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:33:02,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 2551 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-22 20:33:02,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:33:02,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:33:02,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:33:02,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:33:02,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200800027] [2021-11-22 20:33:02,498 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:33:02,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258553944] [2021-11-22 20:33:02,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258553944] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:33:02,498 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:33:02,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:33:02,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174782422] [2021-11-22 20:33:02,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:33:02,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 20:33:02,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:33:02,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 20:33:02,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:33:02,499 INFO L87 Difference]: Start difference. First operand 2335 states and 2995 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:04,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:33:04,494 INFO L93 Difference]: Finished difference Result 5313 states and 6799 transitions. [2021-11-22 20:33:04,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 20:33:04,495 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 6 states have internal predecessors, (112), 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 112 [2021-11-22 20:33:04,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:33:04,503 INFO L225 Difference]: With dead ends: 5313 [2021-11-22 20:33:04,503 INFO L226 Difference]: Without dead ends: 3041 [2021-11-22 20:33:04,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-11-22 20:33:04,514 INFO L933 BasicCegarLoop]: 2797 mSDtfsCounter, 12193 mSDsluCounter, 4393 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12193 SdHoareTripleChecker+Valid, 7190 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-22 20:33:04,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12193 Valid, 7190 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-22 20:33:04,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3041 states. [2021-11-22 20:33:04,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3041 to 2335. [2021-11-22 20:33:04,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2335 states, 2272 states have (on average 1.3169014084507042) internal successors, (2992), 2334 states have internal predecessors, (2992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:04,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 2992 transitions. [2021-11-22 20:33:04,587 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 2992 transitions. Word has length 112 [2021-11-22 20:33:04,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:33:04,588 INFO L470 AbstractCegarLoop]: Abstraction has 2335 states and 2992 transitions. [2021-11-22 20:33:04,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:04,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 2992 transitions. [2021-11-22 20:33:04,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-11-22 20:33:04,589 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:33:04,589 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:33:04,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-22 20:33:04,807 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-22 20:33:04,808 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:33:04,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:33:04,808 INFO L85 PathProgramCache]: Analyzing trace with hash 485350515, now seen corresponding path program 1 times [2021-11-22 20:33:04,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:33:04,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353322326] [2021-11-22 20:33:04,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:04,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:33:04,865 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:33:04,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [676806564] [2021-11-22 20:33:04,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:04,866 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:33:04,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:33:04,868 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:33:04,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-22 20:33:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:33:05,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 2781 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-22 20:33:05,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:33:05,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:33:05,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:33:05,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:33:05,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353322326] [2021-11-22 20:33:05,572 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:33:05,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676806564] [2021-11-22 20:33:05,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676806564] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:33:05,573 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:33:05,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:33:05,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841094318] [2021-11-22 20:33:05,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:33:05,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:33:05,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:33:05,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:33:05,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:33:05,574 INFO L87 Difference]: Start difference. First operand 2335 states and 2992 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:06,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:33:06,561 INFO L93 Difference]: Finished difference Result 4499 states and 5768 transitions. [2021-11-22 20:33:06,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:33:06,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 5 states have internal predecessors, (128), 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 128 [2021-11-22 20:33:06,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:33:06,568 INFO L225 Difference]: With dead ends: 4499 [2021-11-22 20:33:06,568 INFO L226 Difference]: Without dead ends: 2335 [2021-11-22 20:33:06,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:33:06,573 INFO L933 BasicCegarLoop]: 2821 mSDtfsCounter, 8752 mSDsluCounter, 2262 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8752 SdHoareTripleChecker+Valid, 5083 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-22 20:33:06,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8752 Valid, 5083 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-22 20:33:06,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2021-11-22 20:33:06,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 2335. [2021-11-22 20:33:06,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2335 states, 2272 states have (on average 1.315580985915493) internal successors, (2989), 2334 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:06,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 2989 transitions. [2021-11-22 20:33:06,632 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 2989 transitions. Word has length 128 [2021-11-22 20:33:06,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:33:06,633 INFO L470 AbstractCegarLoop]: Abstraction has 2335 states and 2989 transitions. [2021-11-22 20:33:06,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:06,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 2989 transitions. [2021-11-22 20:33:06,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-22 20:33:06,636 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:33:06,636 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:33:06,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-22 20:33:06,857 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-22 20:33:06,858 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:33:06,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:33:06,859 INFO L85 PathProgramCache]: Analyzing trace with hash -451771305, now seen corresponding path program 1 times [2021-11-22 20:33:06,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:33:06,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343302535] [2021-11-22 20:33:06,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:06,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:33:06,935 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:33:06,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1200988587] [2021-11-22 20:33:06,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:06,936 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:33:06,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:33:06,937 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:33:06,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-22 20:33:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:33:07,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 2896 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-22 20:33:07,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:33:07,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:33:07,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:33:07,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:33:07,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343302535] [2021-11-22 20:33:07,664 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:33:07,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200988587] [2021-11-22 20:33:07,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200988587] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:33:07,664 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:33:07,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 20:33:07,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870465385] [2021-11-22 20:33:07,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:33:07,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 20:33:07,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:33:07,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 20:33:07,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:33:07,665 INFO L87 Difference]: Start difference. First operand 2335 states and 2989 transitions. Second operand has 8 states, 8 states have (on average 17.0) internal successors, (136), 7 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:08,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:33:08,792 INFO L93 Difference]: Finished difference Result 4833 states and 6199 transitions. [2021-11-22 20:33:08,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 20:33:08,793 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.0) internal successors, (136), 7 states have internal predecessors, (136), 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 136 [2021-11-22 20:33:08,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:33:08,801 INFO L225 Difference]: With dead ends: 4833 [2021-11-22 20:33:08,801 INFO L226 Difference]: Without dead ends: 2693 [2021-11-22 20:33:08,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2021-11-22 20:33:08,806 INFO L933 BasicCegarLoop]: 2752 mSDtfsCounter, 15148 mSDsluCounter, 3991 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15148 SdHoareTripleChecker+Valid, 6743 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:33:08,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15148 Valid, 6743 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-22 20:33:08,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2021-11-22 20:33:08,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 2335. [2021-11-22 20:33:08,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2335 states, 2272 states have (on average 1.3116197183098592) internal successors, (2980), 2334 states have internal predecessors, (2980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 2980 transitions. [2021-11-22 20:33:08,859 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 2980 transitions. Word has length 136 [2021-11-22 20:33:08,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:33:08,859 INFO L470 AbstractCegarLoop]: Abstraction has 2335 states and 2980 transitions. [2021-11-22 20:33:08,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.0) internal successors, (136), 7 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:08,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 2980 transitions. [2021-11-22 20:33:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-11-22 20:33:08,860 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:33:08,860 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:33:08,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-11-22 20:33:09,081 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-22 20:33:09,081 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:33:09,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:33:09,082 INFO L85 PathProgramCache]: Analyzing trace with hash 957929247, now seen corresponding path program 1 times [2021-11-22 20:33:09,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:33:09,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671697093] [2021-11-22 20:33:09,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:09,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:33:09,138 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:33:09,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1554208917] [2021-11-22 20:33:09,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:09,139 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:33:09,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:33:09,142 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-22 20:33:09,175 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-22 20:33:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:33:09,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 3126 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-22 20:33:09,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:33:09,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:33:09,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:33:09,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:33:09,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671697093] [2021-11-22 20:33:09,927 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:33:09,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554208917] [2021-11-22 20:33:09,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554208917] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:33:09,927 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:33:09,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:33:09,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441443391] [2021-11-22 20:33:09,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:33:09,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:33:09,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:33:09,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:33:09,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:33:09,929 INFO L87 Difference]: Start difference. First operand 2335 states and 2980 transitions. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:10,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:33:10,211 INFO L93 Difference]: Finished difference Result 11267 states and 14394 transitions. [2021-11-22 20:33:10,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-22 20:33:10,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 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 152 [2021-11-22 20:33:10,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:33:10,249 INFO L225 Difference]: With dead ends: 11267 [2021-11-22 20:33:10,249 INFO L226 Difference]: Without dead ends: 9032 [2021-11-22 20:33:10,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-11-22 20:33:10,257 INFO L933 BasicCegarLoop]: 2947 mSDtfsCounter, 11303 mSDsluCounter, 11769 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11303 SdHoareTripleChecker+Valid, 14716 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:33:10,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11303 Valid, 14716 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:33:10,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9032 states. [2021-11-22 20:33:10,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9032 to 2345. [2021-11-22 20:33:10,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2345 states, 2282 states have (on average 1.310692375109553) internal successors, (2991), 2344 states have internal predecessors, (2991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:10,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 2991 transitions. [2021-11-22 20:33:10,365 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 2991 transitions. Word has length 152 [2021-11-22 20:33:10,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:33:10,365 INFO L470 AbstractCegarLoop]: Abstraction has 2345 states and 2991 transitions. [2021-11-22 20:33:10,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:10,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 2991 transitions. [2021-11-22 20:33:10,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-11-22 20:33:10,367 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:33:10,367 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:33:10,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-22 20:33:10,580 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-22 20:33:10,581 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:33:10,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:33:10,582 INFO L85 PathProgramCache]: Analyzing trace with hash -36764451, now seen corresponding path program 1 times [2021-11-22 20:33:10,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:33:10,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494795977] [2021-11-22 20:33:10,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:10,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:33:10,644 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:33:10,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1089408356] [2021-11-22 20:33:10,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:10,644 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:33:10,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:33:10,645 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-22 20:33:10,679 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-22 20:33:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:33:11,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 3123 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-22 20:33:11,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:33:11,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:33:11,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:33:11,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:33:11,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494795977] [2021-11-22 20:33:11,574 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:33:11,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089408356] [2021-11-22 20:33:11,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089408356] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:33:11,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:33:11,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:33:11,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031929205] [2021-11-22 20:33:11,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:33:11,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:33:11,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:33:11,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:33:11,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:33:11,578 INFO L87 Difference]: Start difference. First operand 2345 states and 2991 transitions. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:11,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:33:11,743 INFO L93 Difference]: Finished difference Result 6763 states and 8635 transitions. [2021-11-22 20:33:11,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 20:33:11,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 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 152 [2021-11-22 20:33:11,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:33:11,752 INFO L225 Difference]: With dead ends: 6763 [2021-11-22 20:33:11,752 INFO L226 Difference]: Without dead ends: 4583 [2021-11-22 20:33:11,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:33:11,756 INFO L933 BasicCegarLoop]: 2952 mSDtfsCounter, 5641 mSDsluCounter, 11808 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5641 SdHoareTripleChecker+Valid, 14760 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:33:11,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5641 Valid, 14760 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:33:11,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4583 states. [2021-11-22 20:33:11,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4583 to 2400. [2021-11-22 20:33:11,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2400 states, 2337 states have (on average 1.3097988874625588) internal successors, (3061), 2399 states have internal predecessors, (3061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:11,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 3061 transitions. [2021-11-22 20:33:11,834 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 3061 transitions. Word has length 152 [2021-11-22 20:33:11,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:33:11,835 INFO L470 AbstractCegarLoop]: Abstraction has 2400 states and 3061 transitions. [2021-11-22 20:33:11,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:11,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 3061 transitions. [2021-11-22 20:33:11,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-11-22 20:33:11,836 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:33:11,836 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:33:11,860 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-22 20:33:12,049 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-22 20:33:12,049 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:33:12,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:33:12,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1902397595, now seen corresponding path program 1 times [2021-11-22 20:33:12,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:33:12,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444881205] [2021-11-22 20:33:12,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:12,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:33:12,105 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:33:12,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [222439916] [2021-11-22 20:33:12,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:12,106 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:33:12,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:33:12,107 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-22 20:33:12,108 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-22 20:33:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:33:12,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 3120 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-22 20:33:12,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:33:12,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:33:12,923 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:33:12,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:33:12,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444881205] [2021-11-22 20:33:12,923 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:33:12,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222439916] [2021-11-22 20:33:12,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222439916] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:33:12,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:33:12,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:33:12,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027196687] [2021-11-22 20:33:12,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:33:12,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:33:12,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:33:12,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:33:12,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:33:12,926 INFO L87 Difference]: Start difference. First operand 2400 states and 3061 transitions. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:13,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:33:13,157 INFO L93 Difference]: Finished difference Result 6743 states and 8609 transitions. [2021-11-22 20:33:13,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 20:33:13,158 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 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 152 [2021-11-22 20:33:13,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:33:13,175 INFO L225 Difference]: With dead ends: 6743 [2021-11-22 20:33:13,175 INFO L226 Difference]: Without dead ends: 4583 [2021-11-22 20:33:13,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:33:13,178 INFO L933 BasicCegarLoop]: 2952 mSDtfsCounter, 5529 mSDsluCounter, 11810 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5529 SdHoareTripleChecker+Valid, 14762 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:33:13,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5529 Valid, 14762 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:33:13,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4583 states. [2021-11-22 20:33:13,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4583 to 2420. [2021-11-22 20:33:13,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2420 states, 2357 states have (on average 1.308867204072974) internal successors, (3085), 2419 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:13,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 3085 transitions. [2021-11-22 20:33:13,257 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 3085 transitions. Word has length 152 [2021-11-22 20:33:13,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:33:13,257 INFO L470 AbstractCegarLoop]: Abstraction has 2420 states and 3085 transitions. [2021-11-22 20:33:13,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:13,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3085 transitions. [2021-11-22 20:33:13,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-11-22 20:33:13,258 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:33:13,259 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:33:13,281 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-22 20:33:13,471 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-22 20:33:13,471 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:33:13,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:33:13,472 INFO L85 PathProgramCache]: Analyzing trace with hash -2117810087, now seen corresponding path program 1 times [2021-11-22 20:33:13,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:33:13,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745571236] [2021-11-22 20:33:13,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:13,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:33:13,574 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:33:13,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1959601753] [2021-11-22 20:33:13,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:13,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:33:13,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:33:13,594 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-22 20:33:13,617 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-22 20:33:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:33:14,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 3117 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-22 20:33:14,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:33:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:33:14,325 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:33:14,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:33:14,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745571236] [2021-11-22 20:33:14,326 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:33:14,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959601753] [2021-11-22 20:33:14,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959601753] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:33:14,326 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:33:14,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:33:14,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128209413] [2021-11-22 20:33:14,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:33:14,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:33:14,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:33:14,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:33:14,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:33:14,327 INFO L87 Difference]: Start difference. First operand 2420 states and 3085 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:14,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:33:14,573 INFO L93 Difference]: Finished difference Result 4600 states and 5869 transitions. [2021-11-22 20:33:14,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:33:14,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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 152 [2021-11-22 20:33:14,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:33:14,577 INFO L225 Difference]: With dead ends: 4600 [2021-11-22 20:33:14,577 INFO L226 Difference]: Without dead ends: 2355 [2021-11-22 20:33:14,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:33:14,580 INFO L933 BasicCegarLoop]: 2959 mSDtfsCounter, 1 mSDsluCounter, 5688 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 8647 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:33:14,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 8647 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 20:33:14,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2355 states. [2021-11-22 20:33:14,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2355 to 2355. [2021-11-22 20:33:14,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2355 states, 2292 states have (on average 1.3097731239092496) internal successors, (3002), 2354 states have internal predecessors, (3002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:14,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2355 states and 3002 transitions. [2021-11-22 20:33:14,651 INFO L78 Accepts]: Start accepts. Automaton has 2355 states and 3002 transitions. Word has length 152 [2021-11-22 20:33:14,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:33:14,651 INFO L470 AbstractCegarLoop]: Abstraction has 2355 states and 3002 transitions. [2021-11-22 20:33:14,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:14,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 3002 transitions. [2021-11-22 20:33:14,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-11-22 20:33:14,652 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:33:14,652 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:33:14,674 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-22 20:33:14,870 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-22 20:33:14,870 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:33:14,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:33:14,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1484791415, now seen corresponding path program 1 times [2021-11-22 20:33:14,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:33:14,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105001786] [2021-11-22 20:33:14,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:14,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:33:14,922 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:33:14,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [112270424] [2021-11-22 20:33:14,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:14,922 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:33:14,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:33:14,923 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-22 20:33:14,929 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-22 20:33:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:33:15,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 3152 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-22 20:33:15,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:33:15,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:33:15,686 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:33:15,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:33:15,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105001786] [2021-11-22 20:33:15,687 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:33:15,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112270424] [2021-11-22 20:33:15,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112270424] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:33:15,687 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:33:15,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:33:15,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682377903] [2021-11-22 20:33:15,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:33:15,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:33:15,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:33:15,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:33:15,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:33:15,688 INFO L87 Difference]: Start difference. First operand 2355 states and 3002 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:16,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:33:16,049 INFO L93 Difference]: Finished difference Result 6756 states and 8592 transitions. [2021-11-22 20:33:16,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:33:16,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 155 [2021-11-22 20:33:16,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:33:16,055 INFO L225 Difference]: With dead ends: 6756 [2021-11-22 20:33:16,055 INFO L226 Difference]: Without dead ends: 4481 [2021-11-22 20:33:16,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 151 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-22 20:33:16,059 INFO L933 BasicCegarLoop]: 5548 mSDtfsCounter, 2680 mSDsluCounter, 13766 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2680 SdHoareTripleChecker+Valid, 19314 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:33:16,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2680 Valid, 19314 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 20:33:16,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4481 states. [2021-11-22 20:33:16,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4481 to 2435. [2021-11-22 20:33:16,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2435 states, 2372 states have (on average 1.3077571669477235) internal successors, (3102), 2434 states have internal predecessors, (3102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:16,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 3102 transitions. [2021-11-22 20:33:16,159 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 3102 transitions. Word has length 155 [2021-11-22 20:33:16,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:33:16,160 INFO L470 AbstractCegarLoop]: Abstraction has 2435 states and 3102 transitions. [2021-11-22 20:33:16,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:16,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 3102 transitions. [2021-11-22 20:33:16,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-11-22 20:33:16,161 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:33:16,161 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:33:16,182 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-22 20:33:16,382 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-22 20:33:16,383 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:33:16,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:33:16,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1162812939, now seen corresponding path program 1 times [2021-11-22 20:33:16,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:33:16,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093142060] [2021-11-22 20:33:16,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:16,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:33:16,432 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:33:16,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [510565834] [2021-11-22 20:33:16,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:16,433 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:33:16,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:33:16,449 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-22 20:33:16,450 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-22 20:33:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:33:17,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 3157 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-22 20:33:17,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:33:17,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:33:17,305 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:33:17,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:33:17,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093142060] [2021-11-22 20:33:17,305 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:33:17,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510565834] [2021-11-22 20:33:17,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510565834] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:33:17,306 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:33:17,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:33:17,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167684861] [2021-11-22 20:33:17,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:33:17,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:33:17,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:33:17,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:33:17,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:33:17,308 INFO L87 Difference]: Start difference. First operand 2435 states and 3102 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:21,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:33:21,424 INFO L93 Difference]: Finished difference Result 6814 states and 8654 transitions. [2021-11-22 20:33:21,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 20:33:21,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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 155 [2021-11-22 20:33:21,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:33:21,430 INFO L225 Difference]: With dead ends: 6814 [2021-11-22 20:33:21,430 INFO L226 Difference]: Without dead ends: 4458 [2021-11-22 20:33:21,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:33:21,447 INFO L933 BasicCegarLoop]: 4737 mSDtfsCounter, 2411 mSDsluCounter, 15161 mSDsCounter, 0 mSdLazyCounter, 4288 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2411 SdHoareTripleChecker+Valid, 19898 SdHoareTripleChecker+Invalid, 4363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 4288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2021-11-22 20:33:21,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2411 Valid, 19898 Invalid, 4363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 4288 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2021-11-22 20:33:21,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4458 states. [2021-11-22 20:33:21,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4458 to 2475. [2021-11-22 20:33:21,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2475 states, 2412 states have (on average 1.306799336650083) internal successors, (3152), 2474 states have internal predecessors, (3152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:21,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3152 transitions. [2021-11-22 20:33:21,621 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3152 transitions. Word has length 155 [2021-11-22 20:33:21,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:33:21,622 INFO L470 AbstractCegarLoop]: Abstraction has 2475 states and 3152 transitions. [2021-11-22 20:33:21,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:21,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3152 transitions. [2021-11-22 20:33:21,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-11-22 20:33:21,623 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:33:21,623 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:33:21,663 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-22 20:33:21,843 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-22 20:33:21,844 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:33:21,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:33:21,844 INFO L85 PathProgramCache]: Analyzing trace with hash -48290695, now seen corresponding path program 1 times [2021-11-22 20:33:21,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:33:21,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658672590] [2021-11-22 20:33:21,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:21,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:33:21,924 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:33:21,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [872548556] [2021-11-22 20:33:21,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:21,925 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:33:21,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:33:21,926 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-22 20:33:21,927 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-22 20:33:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:33:22,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 3149 conjuncts, 66 conjunts are in the unsatisfiable core [2021-11-22 20:33:22,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:33:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:33:22,945 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:33:22,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:33:22,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658672590] [2021-11-22 20:33:22,945 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:33:22,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872548556] [2021-11-22 20:33:22,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872548556] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:33:22,945 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:33:22,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-22 20:33:22,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427805498] [2021-11-22 20:33:22,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:33:22,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 20:33:22,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:33:22,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 20:33:22,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-22 20:33:22,947 INFO L87 Difference]: Start difference. First operand 2475 states and 3152 transitions. Second operand has 13 states, 13 states have (on average 11.923076923076923) internal successors, (155), 13 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:30,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:33:30,247 INFO L93 Difference]: Finished difference Result 12239 states and 15434 transitions. [2021-11-22 20:33:30,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-22 20:33:30,248 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.923076923076923) internal successors, (155), 13 states have internal predecessors, (155), 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 155 [2021-11-22 20:33:30,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:33:30,258 INFO L225 Difference]: With dead ends: 12239 [2021-11-22 20:33:30,258 INFO L226 Difference]: Without dead ends: 9856 [2021-11-22 20:33:30,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=369, Invalid=1353, Unknown=0, NotChecked=0, Total=1722 [2021-11-22 20:33:30,261 INFO L933 BasicCegarLoop]: 7341 mSDtfsCounter, 17462 mSDsluCounter, 51491 mSDsCounter, 0 mSdLazyCounter, 10318 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17462 SdHoareTripleChecker+Valid, 58832 SdHoareTripleChecker+Invalid, 10626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 10318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:33:30,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17462 Valid, 58832 Invalid, 10626 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [308 Valid, 10318 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2021-11-22 20:33:30,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9856 states. [2021-11-22 20:33:30,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9856 to 2508. [2021-11-22 20:33:30,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2508 states, 2445 states have (on average 1.3075664621676892) internal successors, (3197), 2507 states have internal predecessors, (3197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:30,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2508 states to 2508 states and 3197 transitions. [2021-11-22 20:33:30,369 INFO L78 Accepts]: Start accepts. Automaton has 2508 states and 3197 transitions. Word has length 155 [2021-11-22 20:33:30,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:33:30,370 INFO L470 AbstractCegarLoop]: Abstraction has 2508 states and 3197 transitions. [2021-11-22 20:33:30,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.923076923076923) internal successors, (155), 13 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:30,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2508 states and 3197 transitions. [2021-11-22 20:33:30,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-11-22 20:33:30,371 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:33:30,371 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:33:30,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-11-22 20:33:30,587 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-22 20:33:30,587 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:33:30,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:33:30,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1188047161, now seen corresponding path program 1 times [2021-11-22 20:33:30,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:33:30,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219698880] [2021-11-22 20:33:30,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:30,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:33:30,635 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:33:30,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1836598887] [2021-11-22 20:33:30,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:30,636 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:33:30,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:33:30,637 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-22 20:33:30,679 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-22 20:33:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:33:31,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 3139 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-22 20:33:31,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:33:31,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:33:31,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:33:31,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:33:31,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219698880] [2021-11-22 20:33:31,384 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:33:31,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836598887] [2021-11-22 20:33:31,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836598887] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:33:31,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:33:31,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:33:31,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112322797] [2021-11-22 20:33:31,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:33:31,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:33:31,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:33:31,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:33:31,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:33:31,385 INFO L87 Difference]: Start difference. First operand 2508 states and 3197 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:32,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:33:32,768 INFO L93 Difference]: Finished difference Result 5428 states and 6979 transitions. [2021-11-22 20:33:32,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:33:32,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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 155 [2021-11-22 20:33:32,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:33:32,772 INFO L225 Difference]: With dead ends: 5428 [2021-11-22 20:33:32,772 INFO L226 Difference]: Without dead ends: 2967 [2021-11-22 20:33:32,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:33:32,775 INFO L933 BasicCegarLoop]: 3261 mSDtfsCounter, 683 mSDsluCounter, 4628 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 7889 SdHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:33:32,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [683 Valid, 7889 Invalid, 1732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-22 20:33:32,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2021-11-22 20:33:32,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 2688. [2021-11-22 20:33:32,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2688 states, 2625 states have (on average 1.2853333333333334) internal successors, (3374), 2687 states have internal predecessors, (3374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:32,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2688 states to 2688 states and 3374 transitions. [2021-11-22 20:33:32,869 INFO L78 Accepts]: Start accepts. Automaton has 2688 states and 3374 transitions. Word has length 155 [2021-11-22 20:33:32,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:33:32,870 INFO L470 AbstractCegarLoop]: Abstraction has 2688 states and 3374 transitions. [2021-11-22 20:33:32,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:32,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2688 states and 3374 transitions. [2021-11-22 20:33:32,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-11-22 20:33:32,871 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:33:32,872 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:33:32,894 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-22 20:33:33,087 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-22 20:33:33,088 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:33:33,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:33:33,088 INFO L85 PathProgramCache]: Analyzing trace with hash 708247065, now seen corresponding path program 1 times [2021-11-22 20:33:33,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:33:33,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428545245] [2021-11-22 20:33:33,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:33,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:33:33,132 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:33:33,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [563225785] [2021-11-22 20:33:33,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:33,132 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:33:33,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:33:33,133 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-22 20:33:33,134 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-22 20:33:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:33:33,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 3159 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-22 20:33:33,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:33:34,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:33:34,069 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:33:34,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:33:34,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428545245] [2021-11-22 20:33:34,069 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:33:34,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563225785] [2021-11-22 20:33:34,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563225785] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:33:34,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:33:34,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 20:33:34,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392600408] [2021-11-22 20:33:34,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:33:34,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 20:33:34,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:33:34,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 20:33:34,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-22 20:33:34,071 INFO L87 Difference]: Start difference. First operand 2688 states and 3374 transitions. Second operand has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:44,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:33:44,314 INFO L93 Difference]: Finished difference Result 9599 states and 11916 transitions. [2021-11-22 20:33:44,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-22 20:33:44,315 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 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 159 [2021-11-22 20:33:44,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:33:44,321 INFO L225 Difference]: With dead ends: 9599 [2021-11-22 20:33:44,322 INFO L226 Difference]: Without dead ends: 6993 [2021-11-22 20:33:44,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2021-11-22 20:33:44,325 INFO L933 BasicCegarLoop]: 4720 mSDtfsCounter, 13642 mSDsluCounter, 21704 mSDsCounter, 0 mSdLazyCounter, 6620 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13642 SdHoareTripleChecker+Valid, 26424 SdHoareTripleChecker+Invalid, 6799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 6620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2021-11-22 20:33:44,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13642 Valid, 26424 Invalid, 6799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 6620 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2021-11-22 20:33:44,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6993 states. [2021-11-22 20:33:44,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6993 to 2654. [2021-11-22 20:33:44,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2654 states, 2591 states have (on average 1.2774990351215747) internal successors, (3310), 2653 states have internal predecessors, (3310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:44,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 3310 transitions. [2021-11-22 20:33:44,448 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 3310 transitions. Word has length 159 [2021-11-22 20:33:44,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:33:44,449 INFO L470 AbstractCegarLoop]: Abstraction has 2654 states and 3310 transitions. [2021-11-22 20:33:44,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:44,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 3310 transitions. [2021-11-22 20:33:44,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-11-22 20:33:44,453 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:33:44,453 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:33:44,491 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-22 20:33:44,667 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-22 20:33:44,667 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:33:44,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:33:44,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1305892647, now seen corresponding path program 1 times [2021-11-22 20:33:44,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:33:44,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518404927] [2021-11-22 20:33:44,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:44,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:33:44,714 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:33:44,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1436170973] [2021-11-22 20:33:44,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:44,715 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:33:44,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:33:44,716 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:33:44,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-22 20:33:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:33:45,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 3169 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-22 20:33:45,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:33:45,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-22 20:33:45,579 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:33:45,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:33:45,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518404927] [2021-11-22 20:33:45,580 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:33:45,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436170973] [2021-11-22 20:33:45,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436170973] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:33:45,580 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:33:45,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:33:45,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677121057] [2021-11-22 20:33:45,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:33:45,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:33:45,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:33:45,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:33:45,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:33:45,581 INFO L87 Difference]: Start difference. First operand 2654 states and 3310 transitions. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:53,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:33:53,404 INFO L93 Difference]: Finished difference Result 6965 states and 8545 transitions. [2021-11-22 20:33:53,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:33:53,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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 159 [2021-11-22 20:33:53,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:33:53,408 INFO L225 Difference]: With dead ends: 6965 [2021-11-22 20:33:53,408 INFO L226 Difference]: Without dead ends: 4359 [2021-11-22 20:33:53,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:33:53,411 INFO L933 BasicCegarLoop]: 3322 mSDtfsCounter, 2612 mSDsluCounter, 7257 mSDsCounter, 0 mSdLazyCounter, 4967 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2612 SdHoareTripleChecker+Valid, 10579 SdHoareTripleChecker+Invalid, 5423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 4967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2021-11-22 20:33:53,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2612 Valid, 10579 Invalid, 5423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 4967 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2021-11-22 20:33:53,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4359 states. [2021-11-22 20:33:53,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4359 to 2747. [2021-11-22 20:33:53,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2747 states, 2684 states have (on average 1.2678837555886737) internal successors, (3403), 2746 states have internal predecessors, (3403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:53,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2747 states to 2747 states and 3403 transitions. [2021-11-22 20:33:53,513 INFO L78 Accepts]: Start accepts. Automaton has 2747 states and 3403 transitions. Word has length 159 [2021-11-22 20:33:53,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:33:53,513 INFO L470 AbstractCegarLoop]: Abstraction has 2747 states and 3403 transitions. [2021-11-22 20:33:53,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:33:53,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2747 states and 3403 transitions. [2021-11-22 20:33:53,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-11-22 20:33:53,514 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:33:53,514 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:33:53,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-22 20:33:53,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-22 20:33:53,719 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:33:53,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:33:53,720 INFO L85 PathProgramCache]: Analyzing trace with hash 446039577, now seen corresponding path program 1 times [2021-11-22 20:33:53,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:33:53,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391733735] [2021-11-22 20:33:53,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:53,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:33:53,764 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:33:53,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1669041205] [2021-11-22 20:33:53,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:33:53,764 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:33:53,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:33:53,765 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:33:53,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-22 20:33:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:33:54,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 3159 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-22 20:33:54,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:33:54,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 20:33:54,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:33:54,765 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 25 treesize of output 24 [2021-11-22 20:33:54,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:33:54,789 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-22 20:33:54,866 INFO L354 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2021-11-22 20:33:54,866 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 6 case distinctions, treesize of input 29 treesize of output 37 [2021-11-22 20:33:54,910 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 16 treesize of output 18 [2021-11-22 20:33:54,993 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-11-22 20:33:54,993 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 21 treesize of output 21 [2021-11-22 20:33:55,032 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 20:33:55,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-22 20:33:55,066 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:33:55,067 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 20 treesize of output 22 [2021-11-22 20:33:55,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:33:55,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:33:55,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:33:55,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391733735] [2021-11-22 20:33:55,257 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:33:55,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669041205] [2021-11-22 20:33:55,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669041205] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:33:55,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:33:55,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-22 20:33:55,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295914238] [2021-11-22 20:33:55,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:33:55,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-22 20:33:55,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:33:55,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-22 20:33:55,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-11-22 20:33:55,259 INFO L87 Difference]: Start difference. First operand 2747 states and 3403 transitions. Second operand has 16 states, 16 states have (on average 9.9375) internal successors, (159), 16 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:34:00,331 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2021-11-22 20:34:00,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:34:00,433 INFO L93 Difference]: Finished difference Result 5547 states and 6865 transitions. [2021-11-22 20:34:00,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-22 20:34:00,434 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.9375) internal successors, (159), 16 states have internal predecessors, (159), 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 159 [2021-11-22 20:34:00,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:34:00,437 INFO L225 Difference]: With dead ends: 5547 [2021-11-22 20:34:00,437 INFO L226 Difference]: Without dead ends: 2888 [2021-11-22 20:34:00,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2021-11-22 20:34:00,439 INFO L933 BasicCegarLoop]: 2916 mSDtfsCounter, 464 mSDsluCounter, 13138 mSDsCounter, 0 mSdLazyCounter, 2135 mSolverCounterSat, 96 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 16054 SdHoareTripleChecker+Invalid, 2232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2135 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2021-11-22 20:34:00,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [464 Valid, 16054 Invalid, 2232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2135 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2021-11-22 20:34:00,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2021-11-22 20:34:00,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 2789. [2021-11-22 20:34:00,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2789 states, 2726 states have (on average 1.2674247982391782) internal successors, (3455), 2788 states have internal predecessors, (3455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:34:00,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 3455 transitions. [2021-11-22 20:34:00,538 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 3455 transitions. Word has length 159 [2021-11-22 20:34:00,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:34:00,539 INFO L470 AbstractCegarLoop]: Abstraction has 2789 states and 3455 transitions. [2021-11-22 20:34:00,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.9375) internal successors, (159), 16 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:34:00,539 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 3455 transitions. [2021-11-22 20:34:00,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-22 20:34:00,540 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:34:00,540 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:34:00,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-22 20:34:00,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:34:00,756 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:34:00,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:34:00,756 INFO L85 PathProgramCache]: Analyzing trace with hash 562446205, now seen corresponding path program 1 times [2021-11-22 20:34:00,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:34:00,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999765185] [2021-11-22 20:34:00,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:34:00,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:34:00,798 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:34:00,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1038003996] [2021-11-22 20:34:00,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:34:00,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:34:00,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:34:00,800 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:34:00,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-22 20:34:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:34:01,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 3181 conjuncts, 139 conjunts are in the unsatisfiable core [2021-11-22 20:34:01,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:34:01,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 20:34:01,696 INFO L354 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2021-11-22 20:34:01,696 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 6 case distinctions, treesize of input 29 treesize of output 37 [2021-11-22 20:34:01,811 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-11-22 20:34:01,811 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 21 treesize of output 21 [2021-11-22 20:34:01,859 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 20:34:01,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-22 20:34:01,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2021-11-22 20:34:02,164 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-22 20:34:02,164 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-22 20:34:02,166 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 16 treesize of output 15 [2021-11-22 20:34:02,223 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 20:34:02,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-22 20:34:02,286 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-22 20:34:02,465 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-22 20:34:02,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:34:02,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:34:02,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:34:02,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999765185] [2021-11-22 20:34:02,662 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:34:02,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038003996] [2021-11-22 20:34:02,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038003996] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:34:02,662 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:34:02,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-22 20:34:02,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088518873] [2021-11-22 20:34:02,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:34:02,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-22 20:34:02,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:34:02,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-22 20:34:02,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-11-22 20:34:02,664 INFO L87 Difference]: Start difference. First operand 2789 states and 3455 transitions. Second operand has 18 states, 18 states have (on average 8.88888888888889) internal successors, (160), 18 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:34:20,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:34:20,967 INFO L93 Difference]: Finished difference Result 8999 states and 11118 transitions. [2021-11-22 20:34:20,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-22 20:34:20,968 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.88888888888889) internal successors, (160), 18 states have internal predecessors, (160), 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 160 [2021-11-22 20:34:20,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:34:20,975 INFO L225 Difference]: With dead ends: 8999 [2021-11-22 20:34:20,975 INFO L226 Difference]: Without dead ends: 6346 [2021-11-22 20:34:20,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 143 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=556, Invalid=1994, Unknown=0, NotChecked=0, Total=2550 [2021-11-22 20:34:20,979 INFO L933 BasicCegarLoop]: 4828 mSDtfsCounter, 14372 mSDsluCounter, 35756 mSDsCounter, 0 mSdLazyCounter, 10911 mSolverCounterSat, 1206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14372 SdHoareTripleChecker+Valid, 40584 SdHoareTripleChecker+Invalid, 12447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1206 IncrementalHoareTripleChecker+Valid, 10911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 330 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2021-11-22 20:34:20,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14372 Valid, 40584 Invalid, 12447 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1206 Valid, 10911 Invalid, 0 Unknown, 330 Unchecked, 16.4s Time] [2021-11-22 20:34:20,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6346 states. [2021-11-22 20:34:21,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6346 to 5586. [2021-11-22 20:34:21,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5586 states, 5523 states have (on average 1.2721347093970667) internal successors, (7026), 5585 states have internal predecessors, (7026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:34:21,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5586 states to 5586 states and 7026 transitions. [2021-11-22 20:34:21,266 INFO L78 Accepts]: Start accepts. Automaton has 5586 states and 7026 transitions. Word has length 160 [2021-11-22 20:34:21,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:34:21,266 INFO L470 AbstractCegarLoop]: Abstraction has 5586 states and 7026 transitions. [2021-11-22 20:34:21,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.88888888888889) internal successors, (160), 18 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:34:21,267 INFO L276 IsEmpty]: Start isEmpty. Operand 5586 states and 7026 transitions. [2021-11-22 20:34:21,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-11-22 20:34:21,268 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:34:21,268 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:34:21,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-22 20:34:21,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:34:21,493 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:34:21,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:34:21,493 INFO L85 PathProgramCache]: Analyzing trace with hash -36795248, now seen corresponding path program 1 times [2021-11-22 20:34:21,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:34:21,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82052802] [2021-11-22 20:34:21,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:34:21,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:34:21,535 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:34:21,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1774918475] [2021-11-22 20:34:21,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:34:21,536 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:34:21,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:34:21,552 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:34:21,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-22 20:34:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:34:22,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 3195 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-22 20:34:22,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:34:22,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:34:22,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:34:22,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:34:22,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82052802] [2021-11-22 20:34:22,463 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:34:22,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774918475] [2021-11-22 20:34:22,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774918475] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:34:22,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:34:22,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:34:22,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855630947] [2021-11-22 20:34:22,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:34:22,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:34:22,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:34:22,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:34:22,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:34:22,464 INFO L87 Difference]: Start difference. First operand 5586 states and 7026 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:34:34,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:34:34,804 INFO L93 Difference]: Finished difference Result 15780 states and 19848 transitions. [2021-11-22 20:34:34,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 20:34:34,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2021-11-22 20:34:34,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:34:34,816 INFO L225 Difference]: With dead ends: 15780 [2021-11-22 20:34:34,816 INFO L226 Difference]: Without dead ends: 10333 [2021-11-22 20:34:34,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:34:34,821 INFO L933 BasicCegarLoop]: 4793 mSDtfsCounter, 2360 mSDsluCounter, 15326 mSDsCounter, 0 mSdLazyCounter, 4265 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2360 SdHoareTripleChecker+Valid, 20119 SdHoareTripleChecker+Invalid, 4340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 4265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2021-11-22 20:34:34,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2360 Valid, 20119 Invalid, 4340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 4265 Invalid, 0 Unknown, 0 Unchecked, 11.7s Time] [2021-11-22 20:34:34,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10333 states. [2021-11-22 20:34:35,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10333 to 5634. [2021-11-22 20:34:35,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5634 states, 5571 states have (on average 1.2697899838449112) internal successors, (7074), 5633 states have internal predecessors, (7074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:34:35,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5634 states to 5634 states and 7074 transitions. [2021-11-22 20:34:35,091 INFO L78 Accepts]: Start accepts. Automaton has 5634 states and 7074 transitions. Word has length 161 [2021-11-22 20:34:35,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:34:35,092 INFO L470 AbstractCegarLoop]: Abstraction has 5634 states and 7074 transitions. [2021-11-22 20:34:35,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:34:35,092 INFO L276 IsEmpty]: Start isEmpty. Operand 5634 states and 7074 transitions. [2021-11-22 20:34:35,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-11-22 20:34:35,093 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:34:35,093 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:34:35,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-22 20:34:35,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:34:35,295 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:34:35,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:34:35,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1735897612, now seen corresponding path program 1 times [2021-11-22 20:34:35,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:34:35,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435617339] [2021-11-22 20:34:35,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:34:35,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:34:35,336 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:34:35,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [132691447] [2021-11-22 20:34:35,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:34:35,336 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:34:35,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:34:35,337 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:34:35,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-22 20:34:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:34:38,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 3203 conjuncts, 136 conjunts are in the unsatisfiable core [2021-11-22 20:34:38,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:34:38,794 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:34:38,795 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-22 20:34:38,968 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 20:34:38,968 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-22 20:34:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:34:39,315 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:34:39,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:34:39,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435617339] [2021-11-22 20:34:39,316 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:34:39,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132691447] [2021-11-22 20:34:39,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132691447] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:34:39,316 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:34:39,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 20:34:39,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262304738] [2021-11-22 20:34:39,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:34:39,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 20:34:39,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:34:39,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 20:34:39,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-22 20:34:39,317 INFO L87 Difference]: Start difference. First operand 5634 states and 7074 transitions. Second operand has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:34:44,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:34:44,429 INFO L93 Difference]: Finished difference Result 20040 states and 24870 transitions. [2021-11-22 20:34:44,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-22 20:34:44,429 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2021-11-22 20:34:44,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:34:44,447 INFO L225 Difference]: With dead ends: 20040 [2021-11-22 20:34:44,447 INFO L226 Difference]: Without dead ends: 14567 [2021-11-22 20:34:44,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2021-11-22 20:34:44,457 INFO L933 BasicCegarLoop]: 5076 mSDtfsCounter, 16269 mSDsluCounter, 18327 mSDsCounter, 0 mSdLazyCounter, 2739 mSolverCounterSat, 759 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16269 SdHoareTripleChecker+Valid, 23403 SdHoareTripleChecker+Invalid, 3498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 759 IncrementalHoareTripleChecker+Valid, 2739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:34:44,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16269 Valid, 23403 Invalid, 3498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [759 Valid, 2739 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2021-11-22 20:34:44,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14567 states. [2021-11-22 20:34:44,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14567 to 6371. [2021-11-22 20:34:44,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6371 states, 6308 states have (on average 1.265852885225111) internal successors, (7985), 6370 states have internal predecessors, (7985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:34:44,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6371 states to 6371 states and 7985 transitions. [2021-11-22 20:34:44,867 INFO L78 Accepts]: Start accepts. Automaton has 6371 states and 7985 transitions. Word has length 161 [2021-11-22 20:34:44,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:34:44,867 INFO L470 AbstractCegarLoop]: Abstraction has 6371 states and 7985 transitions. [2021-11-22 20:34:44,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:34:44,868 INFO L276 IsEmpty]: Start isEmpty. Operand 6371 states and 7985 transitions. [2021-11-22 20:34:44,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-11-22 20:34:44,869 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:34:44,869 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:34:44,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-11-22 20:34:45,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:34:45,095 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:34:45,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:34:45,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1747581704, now seen corresponding path program 1 times [2021-11-22 20:34:45,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:34:45,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180723939] [2021-11-22 20:34:45,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:34:45,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:34:45,146 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:34:45,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1198072434] [2021-11-22 20:34:45,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:34:45,147 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:34:45,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:34:45,147 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:34:45,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-22 20:34:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:34:45,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 3209 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-22 20:34:45,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:34:46,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:34:46,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 20:34:46,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:34:46,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180723939] [2021-11-22 20:34:46,035 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:34:46,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198072434] [2021-11-22 20:34:46,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198072434] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:34:46,035 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:34:46,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 20:34:46,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693467230] [2021-11-22 20:34:46,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:34:46,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 20:34:46,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:34:46,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 20:34:46,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:34:46,036 INFO L87 Difference]: Start difference. First operand 6371 states and 7985 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:34:47,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:34:47,220 INFO L93 Difference]: Finished difference Result 16976 states and 21265 transitions. [2021-11-22 20:34:47,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 20:34:47,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2021-11-22 20:34:47,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:34:47,231 INFO L225 Difference]: With dead ends: 16976 [2021-11-22 20:34:47,231 INFO L226 Difference]: Without dead ends: 10704 [2021-11-22 20:34:47,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-11-22 20:34:47,238 INFO L933 BasicCegarLoop]: 4199 mSDtfsCounter, 3179 mSDsluCounter, 18572 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3179 SdHoareTripleChecker+Valid, 22771 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 20:34:47,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3179 Valid, 22771 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-22 20:34:47,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10704 states. [2021-11-22 20:34:47,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10704 to 5122. [2021-11-22 20:34:47,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5122 states, 5059 states have (on average 1.2646768135995257) internal successors, (6398), 5121 states have internal predecessors, (6398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:34:47,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5122 states to 5122 states and 6398 transitions. [2021-11-22 20:34:47,497 INFO L78 Accepts]: Start accepts. Automaton has 5122 states and 6398 transitions. Word has length 161 [2021-11-22 20:34:47,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:34:47,497 INFO L470 AbstractCegarLoop]: Abstraction has 5122 states and 6398 transitions. [2021-11-22 20:34:47,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:34:47,497 INFO L276 IsEmpty]: Start isEmpty. Operand 5122 states and 6398 transitions. [2021-11-22 20:34:47,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-11-22 20:34:47,498 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:34:47,499 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:34:47,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-22 20:34:47,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-22 20:34:47,721 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:34:47,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:34:47,722 INFO L85 PathProgramCache]: Analyzing trace with hash -717901991, now seen corresponding path program 1 times [2021-11-22 20:34:47,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:34:47,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339376340] [2021-11-22 20:34:47,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:34:47,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:34:47,763 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 20:34:47,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [365912203] [2021-11-22 20:34:47,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:34:47,764 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:34:47,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:34:47,765 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:34:47,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-22 20:34:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:34:53,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 3189 conjuncts, 495 conjunts are in the unsatisfiable core [2021-11-22 20:34:53,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:34:53,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 20:34:53,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-22 20:34:53,892 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:34:53,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 17 [2021-11-22 20:34:53,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-22 20:34:53,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-11-22 20:34:53,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-22 20:34:54,078 INFO L354 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2021-11-22 20:34:54,078 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 6 case distinctions, treesize of input 32 treesize of output 40 [2021-11-22 20:34:54,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-22 20:34:54,655 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-11-22 20:34:54,656 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 153 treesize of output 153 [2021-11-22 20:34:55,446 INFO L354 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2021-11-22 20:34:55,447 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 6 case distinctions, treesize of input 29 treesize of output 37 [2021-11-22 20:34:55,906 INFO L354 Elim1Store]: treesize reduction 18, result has 50.0 percent of original size [2021-11-22 20:34:55,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 92 treesize of output 99 [2021-11-22 20:34:55,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:34:55,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339376340] [2021-11-22 20:34:55,911 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 20:34:55,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365912203] [2021-11-22 20:34:55,911 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-11-22 20:34:55,911 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:34:55,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-22 20:34:55,911 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-11-22 20:34:55,911 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-22 20:34:55,917 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (62 of 63 remaining) [2021-11-22 20:34:55,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (61 of 63 remaining) [2021-11-22 20:34:55,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (60 of 63 remaining) [2021-11-22 20:34:55,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (59 of 63 remaining) [2021-11-22 20:34:55,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (58 of 63 remaining) [2021-11-22 20:34:55,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (57 of 63 remaining) [2021-11-22 20:34:55,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (56 of 63 remaining) [2021-11-22 20:34:55,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (55 of 63 remaining) [2021-11-22 20:34:55,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (54 of 63 remaining) [2021-11-22 20:34:55,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (53 of 63 remaining) [2021-11-22 20:34:55,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (52 of 63 remaining) [2021-11-22 20:34:55,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (51 of 63 remaining) [2021-11-22 20:34:55,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (50 of 63 remaining) [2021-11-22 20:34:55,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (49 of 63 remaining) [2021-11-22 20:34:55,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (48 of 63 remaining) [2021-11-22 20:34:55,921 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (47 of 63 remaining) [2021-11-22 20:34:55,921 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (46 of 63 remaining) [2021-11-22 20:34:55,921 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (45 of 63 remaining) [2021-11-22 20:34:55,921 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (44 of 63 remaining) [2021-11-22 20:34:55,921 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (43 of 63 remaining) [2021-11-22 20:34:55,921 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (42 of 63 remaining) [2021-11-22 20:34:55,921 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (41 of 63 remaining) [2021-11-22 20:34:55,921 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (40 of 63 remaining) [2021-11-22 20:34:55,922 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION (39 of 63 remaining) [2021-11-22 20:34:55,922 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (38 of 63 remaining) [2021-11-22 20:34:55,922 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION (37 of 63 remaining) [2021-11-22 20:34:55,922 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION (36 of 63 remaining) [2021-11-22 20:34:55,922 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION (35 of 63 remaining) [2021-11-22 20:34:55,923 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION (34 of 63 remaining) [2021-11-22 20:34:55,923 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION (33 of 63 remaining) [2021-11-22 20:34:55,923 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION (32 of 63 remaining) [2021-11-22 20:34:55,923 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION (31 of 63 remaining) [2021-11-22 20:34:55,923 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION (30 of 63 remaining) [2021-11-22 20:34:55,924 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION (29 of 63 remaining) [2021-11-22 20:34:55,924 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION (28 of 63 remaining) [2021-11-22 20:34:55,924 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION (27 of 63 remaining) [2021-11-22 20:34:55,924 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION (26 of 63 remaining) [2021-11-22 20:34:55,924 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION (25 of 63 remaining) [2021-11-22 20:34:55,924 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION (24 of 63 remaining) [2021-11-22 20:34:55,924 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION (23 of 63 remaining) [2021-11-22 20:34:55,924 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION (22 of 63 remaining) [2021-11-22 20:34:55,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION (21 of 63 remaining) [2021-11-22 20:34:55,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION (20 of 63 remaining) [2021-11-22 20:34:55,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION (19 of 63 remaining) [2021-11-22 20:34:55,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION (18 of 63 remaining) [2021-11-22 20:34:55,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION (17 of 63 remaining) [2021-11-22 20:34:55,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION (16 of 63 remaining) [2021-11-22 20:34:55,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION (15 of 63 remaining) [2021-11-22 20:34:55,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION (14 of 63 remaining) [2021-11-22 20:34:55,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION (13 of 63 remaining) [2021-11-22 20:34:55,926 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION (12 of 63 remaining) [2021-11-22 20:34:55,926 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (11 of 63 remaining) [2021-11-22 20:34:55,926 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION (10 of 63 remaining) [2021-11-22 20:34:55,926 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION (9 of 63 remaining) [2021-11-22 20:34:55,926 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONERROR_FUNCTION (8 of 63 remaining) [2021-11-22 20:34:55,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONERROR_FUNCTION (7 of 63 remaining) [2021-11-22 20:34:55,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONERROR_FUNCTION (6 of 63 remaining) [2021-11-22 20:34:55,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONERROR_FUNCTION (5 of 63 remaining) [2021-11-22 20:34:55,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONERROR_FUNCTION (4 of 63 remaining) [2021-11-22 20:34:55,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONERROR_FUNCTION (3 of 63 remaining) [2021-11-22 20:34:55,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION (2 of 63 remaining) [2021-11-22 20:34:55,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONERROR_FUNCTION (1 of 63 remaining) [2021-11-22 20:34:55,928 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONERROR_FUNCTION (0 of 63 remaining) [2021-11-22 20:34:55,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2021-11-22 20:34:56,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-11-22 20:34:56,132 INFO L732 BasicCegarLoop]: Path program 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] [2021-11-22 20:34:56,134 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-22 20:34:56,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 08:34:56 BoogieIcfgContainer [2021-11-22 20:34:56,177 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-22 20:34:56,177 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 20:34:56,177 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 20:34:56,178 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 20:34:56,178 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:32:57" (3/4) ... [2021-11-22 20:34:56,180 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-22 20:34:56,180 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 20:34:56,180 INFO L158 Benchmark]: Toolchain (without parser) took 124890.28ms. Allocated memory was 98.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 60.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 211.2MB. Max. memory is 16.1GB. [2021-11-22 20:34:56,181 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 98.6MB. Free memory was 55.2MB in the beginning and 55.2MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 20:34:56,181 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1575.77ms. Allocated memory was 98.6MB in the beginning and 130.0MB in the end (delta: 31.5MB). Free memory was 60.0MB in the beginning and 49.8MB in the end (delta: 10.2MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. [2021-11-22 20:34:56,181 INFO L158 Benchmark]: Boogie Procedure Inliner took 314.72ms. Allocated memory was 130.0MB in the beginning and 184.5MB in the end (delta: 54.5MB). Free memory was 49.8MB in the beginning and 105.3MB in the end (delta: -55.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2021-11-22 20:34:56,181 INFO L158 Benchmark]: Boogie Preprocessor took 320.44ms. Allocated memory is still 184.5MB. Free memory was 105.3MB in the beginning and 89.2MB in the end (delta: 16.1MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. [2021-11-22 20:34:56,181 INFO L158 Benchmark]: RCFGBuilder took 3849.82ms. Allocated memory was 184.5MB in the beginning and 518.0MB in the end (delta: 333.4MB). Free memory was 89.2MB in the beginning and 374.8MB in the end (delta: -285.6MB). Peak memory consumption was 166.6MB. Max. memory is 16.1GB. [2021-11-22 20:34:56,182 INFO L158 Benchmark]: TraceAbstraction took 118819.37ms. Allocated memory was 518.0MB in the beginning and 1.4GB in the end (delta: 901.8MB). Free memory was 374.8MB in the beginning and 1.2GB in the end (delta: -794.6MB). Peak memory consumption was 107.2MB. Max. memory is 16.1GB. [2021-11-22 20:34:56,182 INFO L158 Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 1.4GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 20:34:56,185 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 98.6MB. Free memory was 55.2MB in the beginning and 55.2MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1575.77ms. Allocated memory was 98.6MB in the beginning and 130.0MB in the end (delta: 31.5MB). Free memory was 60.0MB in the beginning and 49.8MB in the end (delta: 10.2MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 314.72ms. Allocated memory was 130.0MB in the beginning and 184.5MB in the end (delta: 54.5MB). Free memory was 49.8MB in the beginning and 105.3MB in the end (delta: -55.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 320.44ms. Allocated memory is still 184.5MB. Free memory was 105.3MB in the beginning and 89.2MB in the end (delta: 16.1MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. * RCFGBuilder took 3849.82ms. Allocated memory was 184.5MB in the beginning and 518.0MB in the end (delta: 333.4MB). Free memory was 89.2MB in the beginning and 374.8MB in the end (delta: -285.6MB). Peak memory consumption was 166.6MB. Max. memory is 16.1GB. * TraceAbstraction took 118819.37ms. Allocated memory was 518.0MB in the beginning and 1.4GB in the end (delta: 901.8MB). Free memory was 374.8MB in the beginning and 1.2GB in the end (delta: -794.6MB). Peak memory consumption was 107.2MB. Max. memory is 16.1GB. * Witness Printer took 2.81ms. Allocated memory is still 1.4GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 7788, overapproximation of __builtin_umull_overflow at line 255. Possible FailurePath: [L6915-L6920] 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, }; [L7360] static __thread int tl_last_error = 0; [L7787-L7935] 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", } , }; [L7938-L7941] static struct aws_error_info_list s_list = { .error_list = errors, .count = (sizeof(errors) / sizeof((errors)[0])), }; [L7943-L7952] 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.") } , }; [L7954-L7957] 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])), }; [L7959-L7963] static _Bool s_common_library_initialized = 0 ; [L8468] CALL aws_priority_queue_push_ref_harness() [L8450] struct aws_priority_queue queue; [L8453] CALL, EXPR aws_priority_queue_is_bounded(&queue, 9223372036854775808U, 2) [L6791] CALL, EXPR aws_array_list_is_bounded(&queue->container, max_initial_item_allocation, max_item_size) [L6735] EXPR list->item_size [L6734-L6735] _Bool item_size_is_bounded = list->item_size <= max_item_size; [L6738] EXPR list->length [L6737-L6738] _Bool length_is_bounded = list->length <= max_initial_item_allocation; [L6739] return item_size_is_bounded && length_is_bounded; [L6791] RET, EXPR aws_array_list_is_bounded(&queue->container, max_initial_item_allocation, max_item_size) [L6789-L6791] _Bool container_is_bounded = aws_array_list_is_bounded(&queue->container, max_initial_item_allocation, max_item_size); [L6798-L6799] CALL, EXPR aws_array_list_is_bounded( &queue->backpointers, max_initial_item_allocation, sizeof(struct aws_priority_queue_node *)) [L6735] EXPR list->item_size [L6734-L6735] _Bool item_size_is_bounded = list->item_size <= max_item_size; [L6738] EXPR list->length [L6737-L6738] _Bool length_is_bounded = list->length <= max_initial_item_allocation; [L6739] return item_size_is_bounded && length_is_bounded; [L6798-L6799] RET, EXPR aws_array_list_is_bounded( &queue->backpointers, max_initial_item_allocation, sizeof(struct aws_priority_queue_node *)) [L6797-L6799] _Bool backpointers_list_is_bounded = aws_array_list_is_bounded( &queue->backpointers, max_initial_item_allocation, sizeof(struct aws_priority_queue_node *)); [L6800] return container_is_bounded && backpointers_list_is_bounded; [L8453] RET, EXPR aws_priority_queue_is_bounded(&queue, 9223372036854775808U, 2) [L8453] CALL assume_abort_if_not(aws_priority_queue_is_bounded(&queue, 9223372036854775808U, 2)) [L211] COND FALSE !(!cond) [L8453] RET assume_abort_if_not(aws_priority_queue_is_bounded(&queue, 9223372036854775808U, 2)) [L8454] CALL ensure_priority_queue_has_allocated_members(&queue) [L6804] CALL ensure_array_list_has_allocated_data_member(&queue->container) [L6743] EXPR list->current_size [L6743] list->current_size == 0 && list->length == 0 [L6743] EXPR list->length [L6743] list->current_size == 0 && list->length == 0 [L6743] COND TRUE list->current_size == 0 && list->length == 0 [L6744] EXPR list->data [L6744-L6746] CALL assume_abort_if_not(list->data == ((void *)0) ) [L211] COND FALSE !(!cond) [L6744-L6746] RET assume_abort_if_not(list->data == ((void *)0) ) [L6747] CALL, EXPR can_fail_allocator() [L6939] return &s_can_fail_allocator_static; [L6747] RET, EXPR can_fail_allocator() [L6747] list->alloc = can_fail_allocator() [L6804] RET ensure_array_list_has_allocated_data_member(&queue->container) [L6805] CALL ensure_array_list_has_allocated_data_member(&queue->backpointers) [L6743] EXPR list->current_size [L6743] list->current_size == 0 && list->length == 0 [L6743] COND FALSE !(list->current_size == 0 && list->length == 0) [L6749] EXPR list->current_size [L6749] CALL, EXPR bounded_malloc(list->current_size) [L6932-L6934] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) [L211] COND FALSE !(!cond) [L6932-L6934] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) [L6935] return malloc(size); [L6749] RET, EXPR bounded_malloc(list->current_size) [L6749] list->data = bounded_malloc(list->current_size) [L6750] CALL, EXPR nondet_bool() [L261] return __VERIFIER_nondet_bool(); [L6750] RET, EXPR nondet_bool() [L6750-L6752] EXPR nondet_bool() ? ((void *)0) : can_fail_allocator() [L6750-L6752] list->alloc = nondet_bool() ? ((void *)0) : can_fail_allocator() [L6805] RET ensure_array_list_has_allocated_data_member(&queue->backpointers) [L6806] queue->pred = nondet_compare [L8454] RET ensure_priority_queue_has_allocated_members(&queue) [L8455] CALL, EXPR aws_priority_queue_is_valid(&queue) [L8279] COND FALSE !(!queue) [L8286] EXPR queue->pred [L8285-L8288] _Bool pred_is_valid = (queue->pred != ((void *)0) ); [L8291] CALL, EXPR aws_array_list_is_valid(&queue->container) [L2939] COND FALSE !(!list) [L2944] size_t required_size = 0; [L2948] EXPR list->length [L2948] EXPR list->item_size [L2948] CALL, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2590] CALL, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2498] CALL __CPROVER_overflow_mult(a, b) [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2498] RET __CPROVER_overflow_mult(a, b) [L2498] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2500] *r = a * b [L2501] return (0); [L2590] RET, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2590] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L2948] RET, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2946-L2948] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L2951] EXPR list->current_size [L2951] EXPR \read(required_size) [L2950-L2951] _Bool current_size_is_valid = (list->current_size >= required_size); [L2955] EXPR list->current_size [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955] EXPR list->data [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955-L2957] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L2953-L2957] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L2960] EXPR list->item_size [L2959-L2960] _Bool item_size_is_valid = (list->item_size != 0); [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L2944] size_t required_size = 0; [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L8291] RET, EXPR aws_array_list_is_valid(&queue->container) [L8290-L8291] _Bool container_is_valid = aws_array_list_is_valid(&queue->container); [L8295] CALL, EXPR aws_priority_queue_backpointers_valid(queue) [L8220] COND FALSE !(!queue) [L8230] CALL, EXPR aws_array_list_is_valid(&queue->backpointers) [L2939] COND FALSE !(!list) [L2944] size_t required_size = 0; [L2948] EXPR list->length [L2948] EXPR list->item_size [L2948] CALL, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2590] CALL, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2498] CALL __CPROVER_overflow_mult(a, b) [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2498] RET __CPROVER_overflow_mult(a, b) [L2498] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2500] *r = a * b [L2501] return (0); [L2590] RET, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2590] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L2948] RET, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2946-L2948] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L2951] EXPR list->current_size [L2951] EXPR \read(required_size) [L2950-L2951] _Bool current_size_is_valid = (list->current_size >= required_size); [L2955] EXPR list->current_size [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955-L2957] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L2957] EXPR list->current_size [L2957] EXPR (((list->current_size)) == 0) || ((list->data)) [L2957] EXPR list->data [L2957] EXPR (((list->current_size)) == 0) || ((list->data)) [L2955-L2957] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L2953-L2957] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L2960] EXPR list->item_size [L2959-L2960] _Bool item_size_is_valid = (list->item_size != 0); [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L2944] size_t required_size = 0; [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L8230] RET, EXPR aws_array_list_is_valid(&queue->backpointers) [L8230] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) [L8230] EXPR queue->backpointers.current_size [L8230] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) [L8230-L8233] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) && (queue->backpointers.data != ((void *)0) ) [L8231] EXPR queue->backpointers.data [L8230-L8233] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) && (queue->backpointers.data != ((void *)0) ) [L8228-L8233] _Bool backpointer_list_is_valid = ((aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) && (queue->backpointers.data != ((void *)0) ))); [L8241] EXPR queue->backpointers.item_size [L8240-L8241] _Bool backpointer_list_item_size = queue->backpointers.item_size == sizeof(struct aws_priority_queue_node *); [L8244] EXPR queue->backpointers.length [L8244] EXPR queue->container.length [L8243-L8244] _Bool lists_equal_lengths = queue->backpointers.length == queue->container.length; [L8247] EXPR queue->backpointers.current_size [L8246-L8247] _Bool backpointers_non_zero_current_size = queue->backpointers.current_size > 0; [L8255-L8258] _Bool backpointers_valid_deep = 1 ; [L8263] EXPR queue->backpointers.current_size [L8263] EXPR queue->backpointers.current_size == 0 && queue->backpointers.length == 0 [L8263-L8264] EXPR queue->backpointers.current_size == 0 && queue->backpointers.length == 0 && queue->backpointers.data == ((void *)0) [L8261-L8265] _Bool backpointers_zero = (queue->backpointers.current_size == 0 && queue->backpointers.length == 0 && queue->backpointers.data == ((void *)0) ); [L8267-L8270] _Bool backpointer_struct_is_valid = backpointers_zero || (backpointer_list_item_size && lists_equal_lengths && backpointers_non_zero_current_size && backpointers_valid_deep); [L8272] EXPR (backpointer_list_is_valid && backpointer_struct_is_valid) || aws_is_mem_zeroed(&(queue->backpointers), sizeof(queue->backpointers)) [L8272] return ((backpointer_list_is_valid && backpointer_struct_is_valid) || aws_is_mem_zeroed(&(queue->backpointers), sizeof(queue->backpointers))); [L8295] RET, EXPR aws_priority_queue_backpointers_valid(queue) [L8294-L8295] _Bool backpointers_valid = aws_priority_queue_backpointers_valid(queue); [L8296] return pred_is_valid && container_is_valid && backpointers_valid; [L8455] RET, EXPR aws_priority_queue_is_valid(&queue) [L8455] CALL assume_abort_if_not(aws_priority_queue_is_valid(&queue)) [L211] COND FALSE !(!cond) [L8455] RET assume_abort_if_not(aws_priority_queue_is_valid(&queue)) [L8456] EXPR queue.container.item_size [L8456] CALL, EXPR can_fail_malloc(queue.container.item_size) [L6949] CALL, EXPR nondet_bool() [L261] return __VERIFIER_nondet_bool(); [L6949] RET, EXPR nondet_bool() [L6949-L6951] EXPR nondet_bool() ? ((void *)0) : bounded_malloc(size) [L6951] CALL, EXPR bounded_malloc(size) [L6932-L6934] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) [L211] COND FALSE !(!cond) [L6932-L6934] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) [L6935] return malloc(size); [L6951] RET, EXPR bounded_malloc(size) [L6949-L6951] EXPR nondet_bool() ? ((void *)0) : bounded_malloc(size) [L6949-L6951] return nondet_bool() ? ((void *)0) : bounded_malloc(size); [L8456] RET, EXPR can_fail_malloc(queue.container.item_size) [L8456] void *item = can_fail_malloc(queue.container.item_size); [L8457] CALL, EXPR can_fail_malloc(sizeof(struct aws_priority_queue_node)) [L6949] CALL, EXPR nondet_bool() [L261] return __VERIFIER_nondet_bool(); [L6949] RET, EXPR nondet_bool() [L6949-L6951] EXPR nondet_bool() ? ((void *)0) : bounded_malloc(size) [L6949-L6951] return nondet_bool() ? ((void *)0) : bounded_malloc(size); [L8457] RET, EXPR can_fail_malloc(sizeof(struct aws_priority_queue_node)) [L8457] struct aws_priority_queue_node *backpointer = can_fail_malloc(sizeof(struct aws_priority_queue_node)); [L8460] EXPR item && ((((queue.container.item_size)) == 0) || ((item))) [L8460] EXPR queue.container.item_size [L8460] EXPR item && ((((queue.container.item_size)) == 0) || ((item))) [L8460] CALL assume_abort_if_not(item && ((((queue.container.item_size)) == 0) || ((item)))) [L211] COND FALSE !(!cond) [L8460] RET assume_abort_if_not(item && ((((queue.container.item_size)) == 0) || ((item)))) [L8463] CALL aws_priority_queue_push_ref(&queue, item, backpointer) [L8320] CALL, EXPR aws_priority_queue_is_valid(queue) [L8279] COND FALSE !(!queue) [L8286] EXPR queue->pred [L8285-L8288] _Bool pred_is_valid = (queue->pred != ((void *)0) ); [L8291] CALL, EXPR aws_array_list_is_valid(&queue->container) [L2939] COND FALSE !(!list) [L2944] size_t required_size = 0; [L2948] EXPR list->length [L2948] EXPR list->item_size [L2948] CALL, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2590] CALL, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2498] CALL __CPROVER_overflow_mult(a, b) [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2498] RET __CPROVER_overflow_mult(a, b) [L2498] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2500] *r = a * b [L2501] return (0); [L2590] RET, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2590] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L2948] RET, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2946-L2948] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L2951] EXPR list->current_size [L2951] EXPR \read(required_size) [L2950-L2951] _Bool current_size_is_valid = (list->current_size >= required_size); [L2955] EXPR list->current_size [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955] EXPR list->data [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955-L2957] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L2953-L2957] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L2960] EXPR list->item_size [L2959-L2960] _Bool item_size_is_valid = (list->item_size != 0); [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L2944] size_t required_size = 0; [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L8291] RET, EXPR aws_array_list_is_valid(&queue->container) [L8290-L8291] _Bool container_is_valid = aws_array_list_is_valid(&queue->container); [L8295] CALL, EXPR aws_priority_queue_backpointers_valid(queue) [L8220] COND FALSE !(!queue) [L8230] CALL, EXPR aws_array_list_is_valid(&queue->backpointers) [L2939] COND FALSE !(!list) [L2944] size_t required_size = 0; [L2948] EXPR list->length [L2948] EXPR list->item_size [L2948] CALL, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2590] CALL, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2498] CALL __CPROVER_overflow_mult(a, b) [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2498] RET __CPROVER_overflow_mult(a, b) [L2498] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2500] *r = a * b [L2501] return (0); [L2590] RET, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2590] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L2948] RET, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2946-L2948] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L2951] EXPR list->current_size [L2951] EXPR \read(required_size) [L2950-L2951] _Bool current_size_is_valid = (list->current_size >= required_size); [L2955] EXPR list->current_size [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955-L2957] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L2957] EXPR list->current_size [L2957] EXPR (((list->current_size)) == 0) || ((list->data)) [L2957] EXPR list->data [L2957] EXPR (((list->current_size)) == 0) || ((list->data)) [L2955-L2957] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L2953-L2957] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L2960] EXPR list->item_size [L2959-L2960] _Bool item_size_is_valid = (list->item_size != 0); [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L2944] size_t required_size = 0; [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L8230] RET, EXPR aws_array_list_is_valid(&queue->backpointers) [L8230] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) [L8230] EXPR queue->backpointers.current_size [L8230] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) [L8230-L8233] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) && (queue->backpointers.data != ((void *)0) ) [L8231] EXPR queue->backpointers.data [L8230-L8233] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) && (queue->backpointers.data != ((void *)0) ) [L8228-L8233] _Bool backpointer_list_is_valid = ((aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) && (queue->backpointers.data != ((void *)0) ))); [L8241] EXPR queue->backpointers.item_size [L8240-L8241] _Bool backpointer_list_item_size = queue->backpointers.item_size == sizeof(struct aws_priority_queue_node *); [L8244] EXPR queue->backpointers.length [L8244] EXPR queue->container.length [L8243-L8244] _Bool lists_equal_lengths = queue->backpointers.length == queue->container.length; [L8247] EXPR queue->backpointers.current_size [L8246-L8247] _Bool backpointers_non_zero_current_size = queue->backpointers.current_size > 0; [L8255-L8258] _Bool backpointers_valid_deep = 1 ; [L8263] EXPR queue->backpointers.current_size [L8263] EXPR queue->backpointers.current_size == 0 && queue->backpointers.length == 0 [L8263-L8264] EXPR queue->backpointers.current_size == 0 && queue->backpointers.length == 0 && queue->backpointers.data == ((void *)0) [L8261-L8265] _Bool backpointers_zero = (queue->backpointers.current_size == 0 && queue->backpointers.length == 0 && queue->backpointers.data == ((void *)0) ); [L8267-L8270] _Bool backpointer_struct_is_valid = backpointers_zero || (backpointer_list_item_size && lists_equal_lengths && backpointers_non_zero_current_size && backpointers_valid_deep); [L8272] EXPR (backpointer_list_is_valid && backpointer_struct_is_valid) || aws_is_mem_zeroed(&(queue->backpointers), sizeof(queue->backpointers)) [L8272] return ((backpointer_list_is_valid && backpointer_struct_is_valid) || aws_is_mem_zeroed(&(queue->backpointers), sizeof(queue->backpointers))); [L8295] RET, EXPR aws_priority_queue_backpointers_valid(queue) [L8294-L8295] _Bool backpointers_valid = aws_priority_queue_backpointers_valid(queue); [L8296] return pred_is_valid && container_is_valid && backpointers_valid; [L8320] RET, EXPR aws_priority_queue_is_valid(queue) [L8320] CALL assume_abort_if_not((aws_priority_queue_is_valid(queue))) [L211] COND FALSE !(!cond) [L8320] RET assume_abort_if_not((aws_priority_queue_is_valid(queue))) [L8321] EXPR item && ((((queue->container.item_size)) == 0) || ((item))) [L8321] EXPR queue->container.item_size [L8321] EXPR item && ((((queue->container.item_size)) == 0) || ((item))) [L8321] CALL assume_abort_if_not((item && ((((queue->container.item_size)) == 0) || ((item))))) [L211] COND FALSE !(!cond) [L8321] RET assume_abort_if_not((item && ((((queue->container.item_size)) == 0) || ((item))))) [L8323] CALL aws_array_list_push_back(&queue->container, item) [L2988] CALL, EXPR aws_array_list_is_valid(list) [L2939] COND FALSE !(!list) [L2944] size_t required_size = 0; [L2948] EXPR list->length [L2948] EXPR list->item_size [L2948] CALL, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2590] CALL, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2498] CALL __CPROVER_overflow_mult(a, b) [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2498] RET __CPROVER_overflow_mult(a, b) [L2498] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2500] *r = a * b [L2501] return (0); [L2590] RET, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2590] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L2948] RET, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2946-L2948] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L2951] EXPR list->current_size [L2951] EXPR \read(required_size) [L2950-L2951] _Bool current_size_is_valid = (list->current_size >= required_size); [L2955] EXPR list->current_size [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955] EXPR list->data [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955-L2957] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L2953-L2957] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L2960] EXPR list->item_size [L2959-L2960] _Bool item_size_is_valid = (list->item_size != 0); [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L2944] size_t required_size = 0; [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L2988] RET, EXPR aws_array_list_is_valid(list) [L2988] CALL assume_abort_if_not((aws_array_list_is_valid(list))) [L211] COND FALSE !(!cond) [L2988] RET assume_abort_if_not((aws_array_list_is_valid(list))) [L2989] EXPR val && ((((list->item_size)) == 0) || ((val))) [L2989] EXPR list->item_size [L2989] EXPR val && ((((list->item_size)) == 0) || ((val))) [L2989] CALL assume_abort_if_not((val && ((((list->item_size)) == 0) || ((val))))) [L211] COND FALSE !(!cond) [L2989] RET assume_abort_if_not((val && ((((list->item_size)) == 0) || ((val))))) [L2993] CALL aws_array_list_length(list) [L3169] EXPR list->length [L3169] EXPR !list->length || list->data [L3169] CALL assume_abort_if_not((!list->length || list->data)) [L211] COND FALSE !(!cond) [L3169] RET assume_abort_if_not((!list->length || list->data)) [L3170] CALL, EXPR aws_array_list_is_valid(list) [L2939] COND FALSE !(!list) [L2944] size_t required_size = 0; [L2948] EXPR list->length [L2948] EXPR list->item_size [L2948] CALL, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2590] CALL, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2498] CALL __CPROVER_overflow_mult(a, b) [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2498] RET __CPROVER_overflow_mult(a, b) [L2498] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2500] *r = a * b [L2501] return (0); [L2590] RET, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2590] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L2948] RET, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2946-L2948] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L2951] EXPR list->current_size [L2951] EXPR \read(required_size) [L2950-L2951] _Bool current_size_is_valid = (list->current_size >= required_size); [L2955] EXPR list->current_size [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955] EXPR list->data [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955-L2957] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L2953-L2957] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L2960] EXPR list->item_size [L2959-L2960] _Bool item_size_is_valid = (list->item_size != 0); [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L2944] size_t required_size = 0; [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L3170] RET, EXPR aws_array_list_is_valid(list) [L3170] CALL assume_abort_if_not((aws_array_list_is_valid(list))) [L211] COND FALSE !(!cond) [L3170] RET assume_abort_if_not((aws_array_list_is_valid(list))) [L3171] EXPR list->length [L3171] size_t len = list->length; [L3172] CALL, EXPR aws_array_list_is_valid(list) [L2939] COND FALSE !(!list) [L2944] size_t required_size = 0; [L2948] EXPR list->length [L2948] EXPR list->item_size [L2948] CALL, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2590] CALL, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2498] CALL __CPROVER_overflow_mult(a, b) [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2498] RET __CPROVER_overflow_mult(a, b) [L2498] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2500] *r = a * b [L2501] return (0); [L2590] RET, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2590] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L2948] RET, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2946-L2948] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L2951] EXPR list->current_size [L2951] EXPR \read(required_size) [L2950-L2951] _Bool current_size_is_valid = (list->current_size >= required_size); [L2955] EXPR list->current_size [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955] EXPR list->data [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955-L2957] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L2953-L2957] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L2960] EXPR list->item_size [L2959-L2960] _Bool item_size_is_valid = (list->item_size != 0); [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L2944] size_t required_size = 0; [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L3172] RET, EXPR aws_array_list_is_valid(list) [L3172] CALL __VERIFIER_assert((aws_array_list_is_valid(list))) [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. - 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. - 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: 233]: 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. - 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, 2321 locations, 63 error locations. Started 1 CEGAR loops. OverallTime: 118.7s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 80.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 157758 SdHoareTripleChecker+Valid, 71.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157758 mSDsluCounter, 364985 SdHoareTripleChecker+Invalid, 61.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 330 IncrementalHoareTripleChecker+Unchecked, 279357 mSDsCounter, 3929 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53162 IncrementalHoareTripleChecker+Invalid, 57422 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3929 mSolverCounterUnsat, 85628 mSDtfsCounter, 53162 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3080 GetRequests, 2803 SyntacticMatches, 7 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1561 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6371occurred in iteration=22, InterpolantAutomatonStates: 254, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 50433 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.5s SsaConstructionTime, 14.8s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 3286 NumberOfCodeBlocks, 3286 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3101 ConstructedInterpolants, 2 QuantifiedInterpolants, 7460 SizeOfPredicates, 255 NumberOfNonLiveVariables, 63785 ConjunctsInSsa, 1145 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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-22 20:34:56,404 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-22 20:34:56,419 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_push_ref_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 00eefb20b1e97d60d3c6a842acdb225be14d327e18edfa8146d29fe131145042 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 20:34:57,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 20:34:57,938 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 20:34:57,968 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 20:34:57,969 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 20:34:57,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 20:34:57,972 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 20:34:57,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 20:34:57,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 20:34:57,981 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 20:34:57,982 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 20:34:57,984 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 20:34:57,984 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 20:34:57,986 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 20:34:57,987 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 20:34:57,989 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 20:34:57,990 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 20:34:57,991 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 20:34:57,992 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 20:34:57,996 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 20:34:57,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 20:34:57,998 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 20:34:57,999 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 20:34:58,000 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 20:34:58,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 20:34:58,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 20:34:58,005 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 20:34:58,006 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 20:34:58,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 20:34:58,007 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 20:34:58,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 20:34:58,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 20:34:58,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 20:34:58,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 20:34:58,010 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 20:34:58,010 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 20:34:58,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 20:34:58,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 20:34:58,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 20:34:58,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 20:34:58,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 20:34:58,015 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-22 20:34:58,042 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 20:34:58,042 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 20:34:58,043 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 20:34:58,043 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 20:34:58,045 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 20:34:58,045 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 20:34:58,045 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 20:34:58,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 20:34:58,045 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 20:34:58,045 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 20:34:58,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 20:34:58,046 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 20:34:58,046 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-22 20:34:58,046 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-22 20:34:58,047 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-22 20:34:58,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 20:34:58,047 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 20:34:58,047 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 20:34:58,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 20:34:58,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 20:34:58,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 20:34:58,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 20:34:58,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 20:34:58,054 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 20:34:58,055 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 20:34:58,055 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-22 20:34:58,055 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-22 20:34:58,055 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 20:34:58,055 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 20:34:58,055 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 20:34:58,056 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 20:34:58,056 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-22 20:34:58,056 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 -> 00eefb20b1e97d60d3c6a842acdb225be14d327e18edfa8146d29fe131145042 [2021-11-22 20:34:58,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 20:34:58,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 20:34:58,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 20:34:58,350 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 20:34:58,351 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 20:34:58,351 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_push_ref_harness.i [2021-11-22 20:34:58,393 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a56db87ce/59bbea2b570e43409eb2e284d39e91e6/FLAGff404205c [2021-11-22 20:34:58,909 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 20:34:58,909 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_push_ref_harness.i [2021-11-22 20:34:58,938 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a56db87ce/59bbea2b570e43409eb2e284d39e91e6/FLAGff404205c [2021-11-22 20:34:59,138 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a56db87ce/59bbea2b570e43409eb2e284d39e91e6 [2021-11-22 20:34:59,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 20:34:59,142 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 20:34:59,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 20:34:59,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 20:34:59,146 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 20:34:59,147 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:34:59" (1/1) ... [2021-11-22 20:34:59,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30bdf1dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:34:59, skipping insertion in model container [2021-11-22 20:34:59,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:34:59" (1/1) ... [2021-11-22 20:34:59,153 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 20:34:59,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 20:34:59,446 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_push_ref_harness.i[4501,4514] [2021-11-22 20:34:59,451 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_push_ref_harness.i[4561,4574] [2021-11-22 20:34:59,956 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:34:59,957 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:34:59,957 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:34:59,958 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:34:59,959 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:34:59,985 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:34:59,985 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:34:59,986 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:34:59,987 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:34:59,988 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:34:59,989 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:34:59,990 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:34:59,990 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,178 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 20:35:00,179 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 20:35:00,179 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 20:35:00,180 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 20:35:00,181 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 20:35:00,181 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 20:35:00,181 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 20:35:00,182 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 20:35:00,182 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 20:35:00,182 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 20:35:00,280 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 20:35:00,314 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,324 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,391 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,392 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,392 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,392 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,392 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,393 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,393 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,393 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,394 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,394 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,394 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,394 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,394 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,396 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,396 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,397 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,397 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,399 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,399 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,403 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,403 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,403 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,410 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 20:35:00,427 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-11-22 20:35:00,454 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 20:35:00,456 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_push_ref_harness.i[4501,4514] [2021-11-22 20:35:00,457 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_push_ref_harness.i[4561,4574] [2021-11-22 20:35:00,490 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,490 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,490 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,491 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,491 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,496 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,496 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,497 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,497 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,498 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,498 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,499 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,499 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,529 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 20:35:00,530 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 20:35:00,530 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 20:35:00,531 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 20:35:00,531 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 20:35:00,532 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 20:35:00,532 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 20:35:00,533 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 20:35:00,533 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 20:35:00,533 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 20:35:00,560 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 20:35:00,570 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,572 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,601 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,601 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,602 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,602 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,602 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,602 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,603 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,603 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,603 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,604 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,604 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,604 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,605 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,605 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,605 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,606 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,606 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,608 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,609 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,613 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,613 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,613 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,620 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 20:35:00,636 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 20:35:00,645 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_push_ref_harness.i[4501,4514] [2021-11-22 20:35:00,646 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_push_ref_harness.i[4561,4574] [2021-11-22 20:35:00,666 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,666 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,666 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,667 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,667 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,686 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,687 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,687 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,687 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,688 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,688 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,688 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,689 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,716 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 20:35:00,716 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 20:35:00,717 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 20:35:00,717 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 20:35:00,718 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 20:35:00,718 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 20:35:00,718 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 20:35:00,718 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 20:35:00,719 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 20:35:00,719 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 20:35:00,728 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 20:35:00,738 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,740 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,757 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,759 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,760 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,760 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,760 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,760 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,761 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,761 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,761 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,761 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,761 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,762 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,762 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,762 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,763 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,763 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,763 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,765 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,766 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,770 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,770 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,771 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 20:35:00,776 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 20:35:01,000 INFO L208 MainTranslator]: Completed translation [2021-11-22 20:35:01,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:35:01 WrapperNode [2021-11-22 20:35:01,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 20:35:01,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 20:35:01,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 20:35:01,004 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 20:35:01,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:35:01" (1/1) ... [2021-11-22 20:35:01,067 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:35:01" (1/1) ... [2021-11-22 20:35:01,293 INFO L137 Inliner]: procedures = 717, calls = 1880, calls flagged for inlining = 787, calls inlined = 931, statements flattened = 12054 [2021-11-22 20:35:01,294 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 20:35:01,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 20:35:01,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 20:35:01,295 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 20:35:01,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:35:01" (1/1) ... [2021-11-22 20:35:01,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:35:01" (1/1) ... [2021-11-22 20:35:01,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:35:01" (1/1) ... [2021-11-22 20:35:01,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:35:01" (1/1) ... [2021-11-22 20:35:01,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:35:01" (1/1) ... [2021-11-22 20:35:01,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:35:01" (1/1) ... [2021-11-22 20:35:01,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:35:01" (1/1) ... [2021-11-22 20:35:01,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 20:35:01,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 20:35:01,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 20:35:01,690 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 20:35:01,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:35:01" (1/1) ... [2021-11-22 20:35:01,695 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 20:35:01,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:35:01,712 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-22 20:35:01,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-22 20:35:01,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 20:35:01,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-22 20:35:01,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-22 20:35:01,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-22 20:35:01,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 20:35:01,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 20:35:01,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 20:35:01,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 20:35:01,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 20:35:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-22 20:35:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-22 20:35:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 20:35:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 20:35:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-22 20:35:01,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 20:35:01,997 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 20:35:01,998 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 20:35:20,285 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 20:35:20,297 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 20:35:20,297 INFO L301 CfgBuilder]: Removed 21 assume(true) statements. [2021-11-22 20:35:20,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:35:20 BoogieIcfgContainer [2021-11-22 20:35:20,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 20:35:20,301 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 20:35:20,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 20:35:20,303 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 20:35:20,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 08:34:59" (1/3) ... [2021-11-22 20:35:20,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148f29fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:35:20, skipping insertion in model container [2021-11-22 20:35:20,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:35:01" (2/3) ... [2021-11-22 20:35:20,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148f29fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:35:20, skipping insertion in model container [2021-11-22 20:35:20,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:35:20" (3/3) ... [2021-11-22 20:35:20,305 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_priority_queue_push_ref_harness.i [2021-11-22 20:35:20,308 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 20:35:20,308 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 63 error locations. [2021-11-22 20:35:20,341 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 20:35:20,345 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-22 20:35:20,346 INFO L340 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2021-11-22 20:35:20,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 2321 states, 2257 states have (on average 1.412051395657953) internal successors, (3187), 2320 states have internal predecessors, (3187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:35:20,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-22 20:35:20,378 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:35:20,379 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:35:20,379 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:35:20,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:35:20,383 INFO L85 PathProgramCache]: Analyzing trace with hash -966206977, now seen corresponding path program 1 times [2021-11-22 20:35:20,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:35:20,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1627726999] [2021-11-22 20:35:20,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:35:20,393 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:35:20,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:35:20,395 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-22 20:35:20,404 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-22 20:35:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:35:20,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 1252 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-22 20:35:20,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:35:21,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:35:21,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:35:21,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:35:21,167 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:35:21,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1627726999] [2021-11-22 20:35:21,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1627726999] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:35:21,168 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:35:21,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-22 20:35:21,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445005643] [2021-11-22 20:35:21,170 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:35:21,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-22 20:35:21,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:35:21,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-22 20:35:21,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 20:35:21,201 INFO L87 Difference]: Start difference. First operand has 2321 states, 2257 states have (on average 1.412051395657953) internal successors, (3187), 2320 states have internal predecessors, (3187), 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 32.0) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:35:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:35:21,304 INFO L93 Difference]: Finished difference Result 4635 states and 6366 transitions. [2021-11-22 20:35:21,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-22 20:35:21,306 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-22 20:35:21,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:35:21,322 INFO L225 Difference]: With dead ends: 4635 [2021-11-22 20:35:21,322 INFO L226 Difference]: Without dead ends: 2315 [2021-11-22 20:35:21,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 20:35:21,330 INFO L933 BasicCegarLoop]: 2989 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2989 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:35:21,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2989 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:35:21,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2021-11-22 20:35:21,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2315. [2021-11-22 20:35:21,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2315 states, 2252 states have (on average 1.325044404973357) internal successors, (2984), 2314 states have internal predecessors, (2984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:35:21,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 2984 transitions. [2021-11-22 20:35:21,415 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 2984 transitions. Word has length 64 [2021-11-22 20:35:21,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:35:21,416 INFO L470 AbstractCegarLoop]: Abstraction has 2315 states and 2984 transitions. [2021-11-22 20:35:21,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:35:21,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 2984 transitions. [2021-11-22 20:35:21,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-22 20:35:21,418 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:35:21,418 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:35:21,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-22 20:35:21,636 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-22 20:35:21,637 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:35:21,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:35:21,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1823598091, now seen corresponding path program 1 times [2021-11-22 20:35:21,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:35:21,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800639910] [2021-11-22 20:35:21,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:35:21,641 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:35:21,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:35:21,642 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-22 20:35:21,668 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-22 20:35:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:35:22,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 1252 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-22 20:35:22,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:35:22,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:35:22,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:35:22,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:35:22,506 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:35:22,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800639910] [2021-11-22 20:35:22,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800639910] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:35:22,506 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:35:22,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-22 20:35:22,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320897955] [2021-11-22 20:35:22,506 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:35:22,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:35:22,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:35:22,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:35:22,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:35:22,508 INFO L87 Difference]: Start difference. First operand 2315 states and 2984 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:35:22,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:35:22,826 INFO L93 Difference]: Finished difference Result 4550 states and 5863 transitions. [2021-11-22 20:35:22,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:35:22,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-22 20:35:22,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:35:22,834 INFO L225 Difference]: With dead ends: 4550 [2021-11-22 20:35:22,834 INFO L226 Difference]: Without dead ends: 2315 [2021-11-22 20:35:22,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:35:22,838 INFO L933 BasicCegarLoop]: 2969 mSDtfsCounter, 4659 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4659 SdHoareTripleChecker+Valid, 4221 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:35:22,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4659 Valid, 4221 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 20:35:22,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2021-11-22 20:35:22,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2315. [2021-11-22 20:35:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2315 states, 2252 states have (on average 1.3237122557726466) internal successors, (2981), 2314 states have internal predecessors, (2981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:35:23,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 2981 transitions. [2021-11-22 20:35:23,006 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 2981 transitions. Word has length 64 [2021-11-22 20:35:23,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:35:23,007 INFO L470 AbstractCegarLoop]: Abstraction has 2315 states and 2981 transitions. [2021-11-22 20:35:23,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:35:23,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 2981 transitions. [2021-11-22 20:35:23,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-22 20:35:23,010 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:35:23,010 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:35:23,033 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-22 20:35:23,222 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-22 20:35:23,223 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:35:23,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:35:23,223 INFO L85 PathProgramCache]: Analyzing trace with hash 998964115, now seen corresponding path program 1 times [2021-11-22 20:35:23,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:35:23,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724165104] [2021-11-22 20:35:23,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:35:23,225 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:35:23,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:35:23,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-22 20:35:23,227 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-22 20:35:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:35:23,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 1284 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-22 20:35:23,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:35:23,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:35:23,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:35:24,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:35:24,050 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:35:24,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724165104] [2021-11-22 20:35:24,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724165104] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:35:24,051 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:35:24,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-22 20:35:24,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035414395] [2021-11-22 20:35:24,051 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:35:24,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 20:35:24,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:35:24,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 20:35:24,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:35:24,052 INFO L87 Difference]: Start difference. First operand 2315 states and 2981 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:35:31,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:35:31,274 INFO L93 Difference]: Finished difference Result 5249 states and 6726 transitions. [2021-11-22 20:35:31,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:35:31,275 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-11-22 20:35:31,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:35:31,283 INFO L225 Difference]: With dead ends: 5249 [2021-11-22 20:35:31,283 INFO L226 Difference]: Without dead ends: 2982 [2021-11-22 20:35:31,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-22 20:35:31,290 INFO L933 BasicCegarLoop]: 2948 mSDtfsCounter, 8893 mSDsluCounter, 5653 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8893 SdHoareTripleChecker+Valid, 8601 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:35:31,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8893 Valid, 8601 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2021-11-22 20:35:31,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2021-11-22 20:35:31,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2315. [2021-11-22 20:35:31,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2315 states, 2252 states have (on average 1.322380106571936) internal successors, (2978), 2314 states have internal predecessors, (2978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:35:31,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 2978 transitions. [2021-11-22 20:35:31,340 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 2978 transitions. Word has length 72 [2021-11-22 20:35:31,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:35:31,340 INFO L470 AbstractCegarLoop]: Abstraction has 2315 states and 2978 transitions. [2021-11-22 20:35:31,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:35:31,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 2978 transitions. [2021-11-22 20:35:31,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-22 20:35:31,344 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:35:31,344 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:35:31,369 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-22 20:35:31,564 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-22 20:35:31,565 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:35:31,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:35:31,565 INFO L85 PathProgramCache]: Analyzing trace with hash -984193973, now seen corresponding path program 1 times [2021-11-22 20:35:31,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:35:31,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656486896] [2021-11-22 20:35:31,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:35:31,567 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:35:31,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:35:31,569 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-22 20:35:31,578 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-22 20:35:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:35:32,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 1466 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-22 20:35:32,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:35:32,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:35:32,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:35:32,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:35:32,759 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:35:32,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656486896] [2021-11-22 20:35:32,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656486896] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:35:32,759 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:35:32,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-22 20:35:32,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736447912] [2021-11-22 20:35:32,759 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:35:32,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:35:32,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:35:32,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:35:32,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:35:32,760 INFO L87 Difference]: Start difference. First operand 2315 states and 2978 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-22 20:35:33,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:35:33,475 INFO L93 Difference]: Finished difference Result 5257 states and 6741 transitions. [2021-11-22 20:35:33,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:35:33,476 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-22 20:35:33,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:35:33,484 INFO L225 Difference]: With dead ends: 5257 [2021-11-22 20:35:33,484 INFO L226 Difference]: Without dead ends: 3021 [2021-11-22 20:35:33,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:35:33,489 INFO L933 BasicCegarLoop]: 2942 mSDtfsCounter, 8137 mSDsluCounter, 2439 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8137 SdHoareTripleChecker+Valid, 5381 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 20:35:33,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8137 Valid, 5381 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-22 20:35:33,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2021-11-22 20:35:33,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 2315. [2021-11-22 20:35:33,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2315 states, 2252 states have (on average 1.3210479573712255) internal successors, (2975), 2314 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:35:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 2975 transitions. [2021-11-22 20:35:33,556 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 2975 transitions. Word has length 88 [2021-11-22 20:35:33,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:35:33,556 INFO L470 AbstractCegarLoop]: Abstraction has 2315 states and 2975 transitions. [2021-11-22 20:35:33,556 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-22 20:35:33,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 2975 transitions. [2021-11-22 20:35:33,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-22 20:35:33,558 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:35:33,558 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:35:33,585 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-22 20:35:33,779 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-22 20:35:33,779 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:35:33,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:35:33,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1935115155, now seen corresponding path program 1 times [2021-11-22 20:35:33,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:35:33,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143068071] [2021-11-22 20:35:33,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:35:33,782 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:35:33,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:35:33,783 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-22 20:35:33,784 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-22 20:35:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:35:34,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 1531 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-22 20:35:34,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:35:34,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:35:34,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:35:35,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:35:35,042 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:35:35,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143068071] [2021-11-22 20:35:35,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143068071] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:35:35,042 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:35:35,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2021-11-22 20:35:35,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851751598] [2021-11-22 20:35:35,043 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:35:35,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 20:35:35,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:35:35,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 20:35:35,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-22 20:35:35,044 INFO L87 Difference]: Start difference. First operand 2315 states and 2975 transitions. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:35:42,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:35:42,901 INFO L93 Difference]: Finished difference Result 6523 states and 8313 transitions. [2021-11-22 20:35:42,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 20:35:42,903 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2021-11-22 20:35:42,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:35:42,914 INFO L225 Difference]: With dead ends: 6523 [2021-11-22 20:35:42,915 INFO L226 Difference]: Without dead ends: 4271 [2021-11-22 20:35:42,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2021-11-22 20:35:42,937 INFO L933 BasicCegarLoop]: 2903 mSDtfsCounter, 14845 mSDsluCounter, 8597 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14845 SdHoareTripleChecker+Valid, 11500 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2021-11-22 20:35:42,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14845 Valid, 11500 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2021-11-22 20:35:42,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4271 states. [2021-11-22 20:35:42,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4271 to 2315. [2021-11-22 20:35:42,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2315 states, 2252 states have (on average 1.3197158081705151) internal successors, (2972), 2314 states have internal predecessors, (2972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:35:42,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 2972 transitions. [2021-11-22 20:35:42,994 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 2972 transitions. Word has length 112 [2021-11-22 20:35:42,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:35:42,994 INFO L470 AbstractCegarLoop]: Abstraction has 2315 states and 2972 transitions. [2021-11-22 20:35:42,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:35:42,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 2972 transitions. [2021-11-22 20:35:42,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-11-22 20:35:42,995 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:35:42,996 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:35:43,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-11-22 20:35:43,224 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-22 20:35:43,224 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:35:43,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:35:43,224 INFO L85 PathProgramCache]: Analyzing trace with hash 210590901, now seen corresponding path program 1 times [2021-11-22 20:35:43,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:35:43,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321264789] [2021-11-22 20:35:43,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:35:43,226 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:35:43,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:35:43,228 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-22 20:35:43,229 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-22 20:35:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:35:44,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 1713 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-22 20:35:44,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:35:44,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:35:44,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:35:44,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:35:44,801 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:35:44,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321264789] [2021-11-22 20:35:44,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321264789] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:35:44,801 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:35:44,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-22 20:35:44,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928081565] [2021-11-22 20:35:44,801 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:35:44,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:35:44,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:35:44,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:35:44,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:35:44,802 INFO L87 Difference]: Start difference. First operand 2315 states and 2972 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:35:45,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:35:45,679 INFO L93 Difference]: Finished difference Result 6638 states and 8504 transitions. [2021-11-22 20:35:45,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:35:45,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 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 128 [2021-11-22 20:35:45,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:35:45,691 INFO L225 Difference]: With dead ends: 6638 [2021-11-22 20:35:45,691 INFO L226 Difference]: Without dead ends: 4401 [2021-11-22 20:35:45,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 251 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-22 20:35:45,695 INFO L933 BasicCegarLoop]: 5576 mSDtfsCounter, 2694 mSDsluCounter, 13836 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2694 SdHoareTripleChecker+Valid, 19412 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-22 20:35:45,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2694 Valid, 19412 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-22 20:35:45,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4401 states. [2021-11-22 20:35:45,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4401 to 2375. [2021-11-22 20:35:45,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2375 states, 2312 states have (on average 1.320069204152249) internal successors, (3052), 2374 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:35:45,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 3052 transitions. [2021-11-22 20:35:45,759 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 3052 transitions. Word has length 128 [2021-11-22 20:35:45,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:35:45,760 INFO L470 AbstractCegarLoop]: Abstraction has 2375 states and 3052 transitions. [2021-11-22 20:35:45,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:35:45,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 3052 transitions. [2021-11-22 20:35:45,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-11-22 20:35:45,761 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:35:45,761 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:35:45,808 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-22 20:35:45,983 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-22 20:35:45,983 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:35:45,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:35:45,984 INFO L85 PathProgramCache]: Analyzing trace with hash 2089721847, now seen corresponding path program 1 times [2021-11-22 20:35:45,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:35:45,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539068358] [2021-11-22 20:35:45,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:35:45,986 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:35:45,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:35:45,987 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-22 20:35:45,989 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-22 20:35:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:35:47,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 1716 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-22 20:35:47,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:35:47,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:35:47,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:35:48,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:35:48,280 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:35:48,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539068358] [2021-11-22 20:35:48,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [539068358] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:35:48,280 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:35:48,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2021-11-22 20:35:48,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354987174] [2021-11-22 20:35:48,281 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:35:48,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 20:35:48,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:35:48,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 20:35:48,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:35:48,282 INFO L87 Difference]: Start difference. First operand 2375 states and 3052 transitions. Second operand has 8 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:35:53,987 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:35:55,432 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:35:58,005 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:35:59,674 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:36:02,287 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:36:04,293 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:36:06,000 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:36:12,659 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:36:14,314 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:36:18,688 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:36:20,390 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:36:22,789 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:36:24,666 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:36:28,088 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:36:30,489 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:36:34,478 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:36:36,077 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:36:38,026 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:36:42,337 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:36:43,351 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:36:45,782 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:36:47,787 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:36:50,199 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:36:53,669 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:36:56,538 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:37:00,306 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:37:04,420 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:37:06,947 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:37:10,265 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:37:13,837 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:37:15,845 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:37:17,506 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:37:21,973 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:37:23,949 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:37:26,320 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:37:28,995 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:37:29,998 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:37:33,613 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:37:35,676 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:37:37,614 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:37:39,698 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:37:43,925 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:37:46,580 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:37:50,757 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:37:54,444 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:37:57,742 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:38:00,965 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:38:05,850 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:38:08,476 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:38:12,043 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:38:13,674 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:38:16,796 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:38:18,113 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:38:20,050 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:38:27,352 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:38:29,185 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:38:32,538 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:38:38,726 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:38:40,733 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:38:43,875 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:38:48,107 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:38:50,401 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:38:51,479 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:38:54,025 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:38:56,881 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:39:00,344 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:39:02,860 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:39:05,711 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:39:07,338 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:39:08,970 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:39:11,613 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:39:14,399 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:39:18,029 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:39:22,924 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:39:25,018 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:39:27,535 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:39:30,482 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:39:32,256 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:39:33,859 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:39:40,373 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:39:42,959 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:39:43,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:39:43,166 INFO L93 Difference]: Finished difference Result 6638 states and 8498 transitions. [2021-11-22 20:39:43,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 20:39:43,169 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 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 128 [2021-11-22 20:39:43,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:39:43,179 INFO L225 Difference]: With dead ends: 6638 [2021-11-22 20:39:43,179 INFO L226 Difference]: Without dead ends: 4338 [2021-11-22 20:39:43,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-11-22 20:39:43,182 INFO L933 BasicCegarLoop]: 4638 mSDtfsCounter, 7272 mSDsluCounter, 13080 mSDsCounter, 0 mSdLazyCounter, 3605 mSolverCounterSat, 174 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 225.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7272 SdHoareTripleChecker+Valid, 17718 SdHoareTripleChecker+Invalid, 3801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 3605 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 234.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:39:43,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7272 Valid, 17718 Invalid, 3801 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [174 Valid, 3605 Invalid, 22 Unknown, 0 Unchecked, 234.1s Time] [2021-11-22 20:39:43,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4338 states. [2021-11-22 20:39:43,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4338 to 2375. [2021-11-22 20:39:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2375 states, 2312 states have (on average 1.315743944636678) internal successors, (3042), 2374 states have internal predecessors, (3042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:39:43,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 3042 transitions. [2021-11-22 20:39:43,251 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 3042 transitions. Word has length 128 [2021-11-22 20:39:43,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:39:43,252 INFO L470 AbstractCegarLoop]: Abstraction has 2375 states and 3042 transitions. [2021-11-22 20:39:43,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:39:43,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 3042 transitions. [2021-11-22 20:39:43,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-11-22 20:39:43,253 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:39:43,253 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:39:43,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-11-22 20:39:43,467 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-22 20:39:43,467 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:39:43,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:39:43,468 INFO L85 PathProgramCache]: Analyzing trace with hash -638487499, now seen corresponding path program 1 times [2021-11-22 20:39:43,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:39:43,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222156995] [2021-11-22 20:39:43,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:39:43,470 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:39:43,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:39:43,474 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-22 20:39:43,476 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-22 20:39:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:39:44,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 1714 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-22 20:39:44,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:39:45,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:39:45,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:39:45,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:39:45,729 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:39:45,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222156995] [2021-11-22 20:39:45,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222156995] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:39:45,729 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:39:45,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2021-11-22 20:39:45,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644740841] [2021-11-22 20:39:45,729 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:39:45,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 20:39:45,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:39:45,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 20:39:45,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:39:45,730 INFO L87 Difference]: Start difference. First operand 2375 states and 3042 transitions. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:39:50,771 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:39:53,643 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:39:55,088 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:39:57,675 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:39:59,844 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:40:01,365 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:40:03,761 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:40:07,175 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:40:12,717 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:40:15,802 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:40:21,433 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:40:23,752 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:40:25,578 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:40:28,057 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:40:30,026 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:40:33,720 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:40:38,279 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:40:39,466 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:40:42,545 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:40:44,954 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:40:46,962 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:40:48,554 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:40:53,441 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:40:55,630 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:40:57,751 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:41:00,430 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:41:02,355 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:41:04,477 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:41:08,012 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:41:11,449 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:41:14,403 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:41:22,010 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:41:27,747 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:41:30,767 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:41:33,706 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:41:36,720 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:41:41,920 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:41:45,665 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:41:48,092 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:41:55,009 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:41:56,669 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:42:01,018 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:42:03,747 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:42:06,324 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:42:07,605 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:42:16,470 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:42:18,991 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:42:27,295 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:42:31,446 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:42:33,590 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:42:35,540 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:42:39,274 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:42:43,372 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:42:46,322 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:42:50,019 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:42:54,565 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:42:56,777 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:43:03,032 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:43:05,577 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:43:07,512 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:43:09,174 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:43:13,881 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:43:17,492 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:43:19,361 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:43:22,603 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:43:25,166 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:43:29,203 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:43:31,143 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:43:34,218 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:43:36,983 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:43:39,618 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:43:45,968 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:43:47,869 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:43:50,184 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:43:53,653 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:43:59,017 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:44:02,654 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:44:09,572 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 20:44:09,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:44:09,873 INFO L93 Difference]: Finished difference Result 6648 states and 8488 transitions. [2021-11-22 20:44:09,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 20:44:09,877 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 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 128 [2021-11-22 20:44:09,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:44:09,886 INFO L225 Difference]: With dead ends: 6648 [2021-11-22 20:44:09,887 INFO L226 Difference]: Without dead ends: 4348 [2021-11-22 20:44:09,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 247 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-22 20:44:09,890 INFO L933 BasicCegarLoop]: 4624 mSDtfsCounter, 2495 mSDsluCounter, 19866 mSDsCounter, 0 mSdLazyCounter, 5073 mSolverCounterSat, 173 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 253.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2495 SdHoareTripleChecker+Valid, 24490 SdHoareTripleChecker+Invalid, 5256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 5073 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 263.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:44:09,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2495 Valid, 24490 Invalid, 5256 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [173 Valid, 5073 Invalid, 10 Unknown, 0 Unchecked, 263.2s Time] [2021-11-22 20:44:09,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4348 states. [2021-11-22 20:44:09,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4348 to 2395. [2021-11-22 20:44:09,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2395 states, 2332 states have (on average 1.3087478559176673) internal successors, (3052), 2394 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:44:09,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 3052 transitions. [2021-11-22 20:44:09,979 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 3052 transitions. Word has length 128 [2021-11-22 20:44:09,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:44:09,980 INFO L470 AbstractCegarLoop]: Abstraction has 2395 states and 3052 transitions. [2021-11-22 20:44:09,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:44:09,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 3052 transitions. [2021-11-22 20:44:09,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-11-22 20:44:09,981 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:44:09,982 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:44:10,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-22 20:44:10,207 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-22 20:44:10,207 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:44:10,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:44:10,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1506230351, now seen corresponding path program 1 times [2021-11-22 20:44:10,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:44:10,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096015113] [2021-11-22 20:44:10,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:44:10,210 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:44:10,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:44:10,212 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-22 20:44:10,213 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-22 20:44:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:44:11,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 1708 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-22 20:44:11,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:44:11,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:44:11,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:44:11,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:44:11,936 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:44:11,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096015113] [2021-11-22 20:44:11,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096015113] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:44:11,937 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:44:11,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2021-11-22 20:44:11,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768065406] [2021-11-22 20:44:11,937 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:44:11,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:44:11,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:44:11,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:44:11,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:44:11,938 INFO L87 Difference]: Start difference. First operand 2395 states and 3052 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:44:12,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:44:12,463 INFO L93 Difference]: Finished difference Result 11543 states and 14730 transitions. [2021-11-22 20:44:12,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-22 20:44:12,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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 128 [2021-11-22 20:44:12,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:44:12,477 INFO L225 Difference]: With dead ends: 11543 [2021-11-22 20:44:12,478 INFO L226 Difference]: Without dead ends: 9254 [2021-11-22 20:44:12,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-11-22 20:44:12,482 INFO L933 BasicCegarLoop]: 2959 mSDtfsCounter, 11351 mSDsluCounter, 11817 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11351 SdHoareTripleChecker+Valid, 14776 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:44:12,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11351 Valid, 14776 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 20:44:12,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9254 states. [2021-11-22 20:44:12,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9254 to 2405. [2021-11-22 20:44:12,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2405 states, 2342 states have (on average 1.3078565328778822) internal successors, (3063), 2404 states have internal predecessors, (3063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:44:12,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 3063 transitions. [2021-11-22 20:44:12,584 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 3063 transitions. Word has length 128 [2021-11-22 20:44:12,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:44:12,584 INFO L470 AbstractCegarLoop]: Abstraction has 2405 states and 3063 transitions. [2021-11-22 20:44:12,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:44:12,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 3063 transitions. [2021-11-22 20:44:12,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-11-22 20:44:12,585 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:44:12,585 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:44:12,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-22 20:44:12,809 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-22 20:44:12,810 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:44:12,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:44:12,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1560623249, now seen corresponding path program 1 times [2021-11-22 20:44:12,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:44:12,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998235527] [2021-11-22 20:44:12,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:44:12,812 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:44:12,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:44:12,814 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-22 20:44:12,814 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-22 20:44:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:44:14,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 1706 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-22 20:44:14,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:44:14,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:44:14,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:44:14,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:44:14,641 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:44:14,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998235527] [2021-11-22 20:44:14,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998235527] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:44:14,642 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:44:14,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2021-11-22 20:44:14,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007625473] [2021-11-22 20:44:14,642 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:44:14,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 20:44:14,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:44:14,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 20:44:14,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:44:14,643 INFO L87 Difference]: Start difference. First operand 2405 states and 3063 transitions. Second operand has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:44:15,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:44:15,689 INFO L93 Difference]: Finished difference Result 6980 states and 8902 transitions. [2021-11-22 20:44:15,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 20:44:15,689 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 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 128 [2021-11-22 20:44:15,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:44:15,715 INFO L225 Difference]: With dead ends: 6980 [2021-11-22 20:44:15,715 INFO L226 Difference]: Without dead ends: 4672 [2021-11-22 20:44:15,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-11-22 20:44:15,718 INFO L933 BasicCegarLoop]: 2960 mSDtfsCounter, 2846 mSDsluCounter, 14553 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2846 SdHoareTripleChecker+Valid, 17513 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-22 20:44:15,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2846 Valid, 17513 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-22 20:44:15,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4672 states. [2021-11-22 20:44:15,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4672 to 2395. [2021-11-22 20:44:15,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2395 states, 2332 states have (on average 1.3078902229845626) internal successors, (3050), 2394 states have internal predecessors, (3050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:44:15,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 3050 transitions. [2021-11-22 20:44:15,836 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 3050 transitions. Word has length 128 [2021-11-22 20:44:15,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:44:15,836 INFO L470 AbstractCegarLoop]: Abstraction has 2395 states and 3050 transitions. [2021-11-22 20:44:15,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:44:15,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 3050 transitions. [2021-11-22 20:44:15,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-11-22 20:44:15,837 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:44:15,837 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:44:15,902 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-22 20:44:16,051 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-22 20:44:16,051 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:44:16,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:44:16,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1782192077, now seen corresponding path program 1 times [2021-11-22 20:44:16,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:44:16,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38922770] [2021-11-22 20:44:16,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:44:16,054 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:44:16,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:44:16,055 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-22 20:44:16,056 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-22 20:44:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:44:17,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 1723 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-22 20:44:17,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:44:18,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:44:18,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:44:18,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:44:18,347 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:44:18,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38922770] [2021-11-22 20:44:18,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38922770] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:44:18,347 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:44:18,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-22 20:44:18,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969634533] [2021-11-22 20:44:18,347 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:44:18,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 20:44:18,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:44:18,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 20:44:18,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-22 20:44:18,349 INFO L87 Difference]: Start difference. First operand 2395 states and 3050 transitions. Second operand has 8 states, 8 states have (on average 30.25) internal successors, (242), 8 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:44:24,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:44:24,558 INFO L93 Difference]: Finished difference Result 4607 states and 5874 transitions. [2021-11-22 20:44:24,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:44:24,559 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 30.25) internal successors, (242), 8 states have internal predecessors, (242), 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 131 [2021-11-22 20:44:24,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:44:24,563 INFO L225 Difference]: With dead ends: 4607 [2021-11-22 20:44:24,563 INFO L226 Difference]: Without dead ends: 2395 [2021-11-22 20:44:24,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-22 20:44:24,566 INFO L933 BasicCegarLoop]: 2928 mSDtfsCounter, 5832 mSDsluCounter, 2419 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5832 SdHoareTripleChecker+Valid, 5347 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:44:24,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5832 Valid, 5347 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2021-11-22 20:44:24,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2395 states. [2021-11-22 20:44:24,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2395 to 2395. [2021-11-22 20:44:24,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2395 states, 2332 states have (on average 1.3066037735849056) internal successors, (3047), 2394 states have internal predecessors, (3047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:44:24,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 3047 transitions. [2021-11-22 20:44:24,649 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 3047 transitions. Word has length 131 [2021-11-22 20:44:24,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:44:24,649 INFO L470 AbstractCegarLoop]: Abstraction has 2395 states and 3047 transitions. [2021-11-22 20:44:24,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.25) internal successors, (242), 8 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:44:24,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 3047 transitions. [2021-11-22 20:44:24,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-22 20:44:24,651 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:44:24,651 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:44:24,696 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-22 20:44:24,879 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-22 20:44:24,879 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:44:24,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:44:24,880 INFO L85 PathProgramCache]: Analyzing trace with hash 201508273, now seen corresponding path program 1 times [2021-11-22 20:44:24,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:44:24,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641454713] [2021-11-22 20:44:24,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:44:24,882 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:44:24,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:44:24,883 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-22 20:44:24,884 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-22 20:44:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:44:27,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 1814 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-22 20:44:27,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:44:27,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:44:27,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:44:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:44:27,860 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 20:44:27,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641454713] [2021-11-22 20:44:27,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641454713] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 20:44:27,860 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:44:27,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2021-11-22 20:44:27,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559972059] [2021-11-22 20:44:27,860 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 20:44:27,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 20:44:27,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 20:44:27,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 20:44:27,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-22 20:44:27,861 INFO L87 Difference]: Start difference. First operand 2395 states and 3047 transitions. Second operand has 12 states, 12 states have (on average 22.5) internal successors, (270), 12 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:44:34,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:44:34,425 INFO L93 Difference]: Finished difference Result 4965 states and 6329 transitions. [2021-11-22 20:44:34,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 20:44:34,426 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 22.5) internal successors, (270), 12 states have internal predecessors, (270), 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 139 [2021-11-22 20:44:34,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:44:34,431 INFO L225 Difference]: With dead ends: 4965 [2021-11-22 20:44:34,431 INFO L226 Difference]: Without dead ends: 2777 [2021-11-22 20:44:34,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2021-11-22 20:44:34,434 INFO L933 BasicCegarLoop]: 2850 mSDtfsCounter, 17017 mSDsluCounter, 4399 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17017 SdHoareTripleChecker+Valid, 7249 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:44:34,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17017 Valid, 7249 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2021-11-22 20:44:34,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2021-11-22 20:44:34,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 2395. [2021-11-22 20:44:34,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2395 states, 2332 states have (on average 1.3027444253859348) internal successors, (3038), 2394 states have internal predecessors, (3038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:44:34,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 3038 transitions. [2021-11-22 20:44:34,519 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 3038 transitions. Word has length 139 [2021-11-22 20:44:34,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:44:34,520 INFO L470 AbstractCegarLoop]: Abstraction has 2395 states and 3038 transitions. [2021-11-22 20:44:34,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.5) internal successors, (270), 12 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:44:34,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 3038 transitions. [2021-11-22 20:44:34,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-11-22 20:44:34,520 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:44:34,521 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:44:34,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-22 20:44:34,746 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-22 20:44:34,747 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 60 more)] === [2021-11-22 20:44:34,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:44:34,747 INFO L85 PathProgramCache]: Analyzing trace with hash -48290695, now seen corresponding path program 1 times [2021-11-22 20:44:34,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 20:44:34,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877258829] [2021-11-22 20:44:34,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:44:34,749 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 20:44:34,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 20:44:34,751 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-22 20:44:34,753 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-22 20:44:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:44:41,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 1996 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-22 20:44:41,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:44:41,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:44:41,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:44:48,763 WARN L227 SmtUtils]: Spent 6.46s on a formula simplification. DAG size of input: 534 DAG size of output: 280 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-22 20:44:48,766 INFO L354 Elim1Store]: treesize reduction 895, result has 45.2 percent of original size [2021-11-22 20:44:48,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 132 treesize of output 773 Killed by 15