./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/pthread-divine/one_time_barrier_twice_2t.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 654ba073723c5bebcf706552b3cd58bc95cc07bc71a7e60391f80a16de89dbcb --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:13:06,650 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:13:06,651 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:13:06,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:13:06,688 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:13:06,689 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:13:06,690 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:13:06,692 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:13:06,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:13:06,697 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:13:06,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:13:06,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:13:06,700 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:13:06,701 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:13:06,702 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:13:06,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:13:06,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:13:06,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:13:06,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:13:06,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:13:06,713 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:13:06,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:13:06,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:13:06,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:13:06,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:13:06,721 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:13:06,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:13:06,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:13:06,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:13:06,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:13:06,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:13:06,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:13:06,725 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:13:06,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:13:06,726 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:13:06,727 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:13:06,727 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:13:06,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:13:06,728 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:13:06,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:13:06,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:13:06,730 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:13:06,731 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 10:13:06,754 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:13:06,755 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:13:06,755 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:13:06,755 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:13:06,756 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:13:06,756 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:13:06,757 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:13:06,757 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:13:06,757 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:13:06,758 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:13:06,758 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:13:06,758 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:13:06,758 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:13:06,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:13:06,759 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:13:06,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:13:06,759 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:13:06,759 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:13:06,759 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:13:06,759 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:13:06,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:13:06,760 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:13:06,760 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:13:06,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:13:06,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:13:06,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:13:06,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:13:06,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:13:06,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:13:06,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:13:06,761 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:13:06,761 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:13:06,761 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:13:06,761 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 654ba073723c5bebcf706552b3cd58bc95cc07bc71a7e60391f80a16de89dbcb [2022-07-12 10:13:06,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:13:06,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:13:06,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:13:06,949 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:13:06,949 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:13:06,951 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i [2022-07-12 10:13:07,001 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4573e8dac/bbf6e0dce96445fba3f1a85b79ad776d/FLAGb135768ac [2022-07-12 10:13:07,416 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:13:07,417 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i [2022-07-12 10:13:07,429 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4573e8dac/bbf6e0dce96445fba3f1a85b79ad776d/FLAGb135768ac [2022-07-12 10:13:07,442 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4573e8dac/bbf6e0dce96445fba3f1a85b79ad776d [2022-07-12 10:13:07,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:13:07,445 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:13:07,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:13:07,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:13:07,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:13:07,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:13:07" (1/1) ... [2022-07-12 10:13:07,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@333cb970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:13:07, skipping insertion in model container [2022-07-12 10:13:07,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:13:07" (1/1) ... [2022-07-12 10:13:07,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:13:07,490 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:13:07,591 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-07-12 10:13:07,740 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/pthread-divine/one_time_barrier_twice_2t.i[30448,30461] [2022-07-12 10:13:07,749 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/pthread-divine/one_time_barrier_twice_2t.i[30811,30824] [2022-07-12 10:13:07,759 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/pthread-divine/one_time_barrier_twice_2t.i[31483,31496] [2022-07-12 10:13:07,760 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/pthread-divine/one_time_barrier_twice_2t.i[31534,31547] [2022-07-12 10:13:07,763 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/pthread-divine/one_time_barrier_twice_2t.i[31683,31696] [2022-07-12 10:13:07,764 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/pthread-divine/one_time_barrier_twice_2t.i[31760,31773] [2022-07-12 10:13:07,767 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/pthread-divine/one_time_barrier_twice_2t.i[31807,31820] [2022-07-12 10:13:07,768 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/pthread-divine/one_time_barrier_twice_2t.i[31916,31929] [2022-07-12 10:13:07,771 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/pthread-divine/one_time_barrier_twice_2t.i[32035,32048] [2022-07-12 10:13:07,772 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/pthread-divine/one_time_barrier_twice_2t.i[32083,32096] [2022-07-12 10:13:07,772 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/pthread-divine/one_time_barrier_twice_2t.i[32160,32173] [2022-07-12 10:13:07,774 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/pthread-divine/one_time_barrier_twice_2t.i[32286,32299] [2022-07-12 10:13:07,785 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/pthread-divine/one_time_barrier_twice_2t.i[32897,32910] [2022-07-12 10:13:07,788 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/pthread-divine/one_time_barrier_twice_2t.i[32974,32987] [2022-07-12 10:13:07,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:13:07,797 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:13:07,808 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-07-12 10:13:07,824 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/pthread-divine/one_time_barrier_twice_2t.i[30448,30461] [2022-07-12 10:13:07,829 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/pthread-divine/one_time_barrier_twice_2t.i[30811,30824] [2022-07-12 10:13:07,837 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/pthread-divine/one_time_barrier_twice_2t.i[31483,31496] [2022-07-12 10:13:07,838 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/pthread-divine/one_time_barrier_twice_2t.i[31534,31547] [2022-07-12 10:13:07,839 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/pthread-divine/one_time_barrier_twice_2t.i[31683,31696] [2022-07-12 10:13:07,839 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/pthread-divine/one_time_barrier_twice_2t.i[31760,31773] [2022-07-12 10:13:07,840 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/pthread-divine/one_time_barrier_twice_2t.i[31807,31820] [2022-07-12 10:13:07,840 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/pthread-divine/one_time_barrier_twice_2t.i[31916,31929] [2022-07-12 10:13:07,841 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/pthread-divine/one_time_barrier_twice_2t.i[32035,32048] [2022-07-12 10:13:07,841 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/pthread-divine/one_time_barrier_twice_2t.i[32083,32096] [2022-07-12 10:13:07,842 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/pthread-divine/one_time_barrier_twice_2t.i[32160,32173] [2022-07-12 10:13:07,843 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/pthread-divine/one_time_barrier_twice_2t.i[32286,32299] [2022-07-12 10:13:07,846 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/pthread-divine/one_time_barrier_twice_2t.i[32897,32910] [2022-07-12 10:13:07,847 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/pthread-divine/one_time_barrier_twice_2t.i[32974,32987] [2022-07-12 10:13:07,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:13:07,868 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:13:07,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:13:07 WrapperNode [2022-07-12 10:13:07,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:13:07,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:13:07,869 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:13:07,869 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:13:07,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:13:07" (1/1) ... [2022-07-12 10:13:07,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:13:07" (1/1) ... [2022-07-12 10:13:07,919 INFO L137 Inliner]: procedures = 174, calls = 73, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 469 [2022-07-12 10:13:07,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:13:07,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:13:07,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:13:07,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:13:07,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:13:07" (1/1) ... [2022-07-12 10:13:07,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:13:07" (1/1) ... [2022-07-12 10:13:07,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:13:07" (1/1) ... [2022-07-12 10:13:07,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:13:07" (1/1) ... [2022-07-12 10:13:07,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:13:07" (1/1) ... [2022-07-12 10:13:07,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:13:07" (1/1) ... [2022-07-12 10:13:07,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:13:07" (1/1) ... [2022-07-12 10:13:07,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:13:07,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:13:07,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:13:07,965 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:13:07,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:13:07" (1/1) ... [2022-07-12 10:13:07,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:13:08,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:13:08,017 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) [2022-07-12 10:13:08,032 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 [2022-07-12 10:13:08,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 10:13:08,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:13:08,067 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-07-12 10:13:08,067 INFO L130 BoogieDeclarations]: Found specification of procedure worker_fn [2022-07-12 10:13:08,067 INFO L138 BoogieDeclarations]: Found implementation of procedure worker_fn [2022-07-12 10:13:08,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:13:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 10:13:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:13:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 10:13:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:13:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:13:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:13:08,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:13:08,070 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-12 10:13:08,169 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:13:08,171 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:13:08,675 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:13:08,691 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:13:08,692 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-07-12 10:13:08,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:13:08 BoogieIcfgContainer [2022-07-12 10:13:08,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:13:08,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:13:08,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:13:08,699 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:13:08,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:13:07" (1/3) ... [2022-07-12 10:13:08,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a21a036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:13:08, skipping insertion in model container [2022-07-12 10:13:08,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:13:07" (2/3) ... [2022-07-12 10:13:08,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a21a036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:13:08, skipping insertion in model container [2022-07-12 10:13:08,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:13:08" (3/3) ... [2022-07-12 10:13:08,703 INFO L111 eAbstractionObserver]: Analyzing ICFG one_time_barrier_twice_2t.i [2022-07-12 10:13:08,707 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:13:08,713 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:13:08,715 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-07-12 10:13:08,715 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:13:08,811 INFO L135 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-07-12 10:13:08,858 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 482 places, 542 transitions, 1092 flow [2022-07-12 10:13:09,061 INFO L129 PetriNetUnfolder]: 95/795 cut-off events. [2022-07-12 10:13:09,062 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-07-12 10:13:09,074 INFO L84 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 795 events. 95/795 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2663 event pairs, 0 based on Foata normal form. 0/655 useless extension candidates. Maximal degree in co-relation 462. Up to 4 conditions per place. [2022-07-12 10:13:09,074 INFO L82 GeneralOperation]: Start removeDead. Operand has 482 places, 542 transitions, 1092 flow [2022-07-12 10:13:09,087 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 482 places, 542 transitions, 1092 flow [2022-07-12 10:13:09,097 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:13:09,102 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56f4e14a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@ef93562 [2022-07-12 10:13:09,102 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-07-12 10:13:09,106 INFO L129 PetriNetUnfolder]: 3/53 cut-off events. [2022-07-12 10:13:09,106 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:13:09,107 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:13:09,107 INFO L200 CegarLoopForPetriNet]: 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] [2022-07-12 10:13:09,107 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-07-12 10:13:09,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:13:09,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1884340507, now seen corresponding path program 1 times [2022-07-12 10:13:09,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:13:09,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413409521] [2022-07-12 10:13:09,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:13:09,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:13:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:13:09,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:13:09,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:13:09,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413409521] [2022-07-12 10:13:09,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413409521] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:13:09,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:13:09,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 10:13:09,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504499567] [2022-07-12 10:13:09,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:13:09,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:13:09,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:13:09,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:13:09,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:13:09,318 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 487 out of 542 [2022-07-12 10:13:09,322 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 542 transitions, 1092 flow. Second operand has 3 states, 3 states have (on average 488.0) internal successors, (1464), 3 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:09,322 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:13:09,322 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 487 of 542 [2022-07-12 10:13:09,323 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:13:09,494 INFO L129 PetriNetUnfolder]: 28/734 cut-off events. [2022-07-12 10:13:09,495 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-12 10:13:09,504 INFO L84 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 734 events. 28/734 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2572 event pairs, 0 based on Foata normal form. 66/727 useless extension candidates. Maximal degree in co-relation 423. Up to 12 conditions per place. [2022-07-12 10:13:09,509 INFO L132 encePairwiseOnDemand]: 495/542 looper letters, 15 selfloop transitions, 2 changer transitions 0/504 dead transitions. [2022-07-12 10:13:09,509 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 504 transitions, 1050 flow [2022-07-12 10:13:09,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:13:09,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:13:09,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1524 transitions. [2022-07-12 10:13:09,533 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9372693726937269 [2022-07-12 10:13:09,534 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1524 transitions. [2022-07-12 10:13:09,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1524 transitions. [2022-07-12 10:13:09,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:13:09,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1524 transitions. [2022-07-12 10:13:09,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 508.0) internal successors, (1524), 3 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:09,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 542.0) internal successors, (2168), 4 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:09,556 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 542.0) internal successors, (2168), 4 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:09,558 INFO L186 Difference]: Start difference. First operand has 482 places, 542 transitions, 1092 flow. Second operand 3 states and 1524 transitions. [2022-07-12 10:13:09,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 504 transitions, 1050 flow [2022-07-12 10:13:09,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 484 places, 504 transitions, 1050 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-12 10:13:09,574 INFO L242 Difference]: Finished difference. Result has 485 places, 499 transitions, 1016 flow [2022-07-12 10:13:09,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=542, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=482, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1016, PETRI_PLACES=485, PETRI_TRANSITIONS=499} [2022-07-12 10:13:09,580 INFO L279 CegarLoopForPetriNet]: 482 programPoint places, 3 predicate places. [2022-07-12 10:13:09,580 INFO L495 AbstractCegarLoop]: Abstraction has has 485 places, 499 transitions, 1016 flow [2022-07-12 10:13:09,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 488.0) internal successors, (1464), 3 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:09,585 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:13:09,585 INFO L200 CegarLoopForPetriNet]: 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] [2022-07-12 10:13:09,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:13:09,586 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-07-12 10:13:09,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:13:09,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1789690299, now seen corresponding path program 1 times [2022-07-12 10:13:09,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:13:09,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592028878] [2022-07-12 10:13:09,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:13:09,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:13:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:13:09,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:13:09,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:13:09,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592028878] [2022-07-12 10:13:09,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592028878] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:13:09,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886745590] [2022-07-12 10:13:09,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:13:09,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:13:09,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:13:09,680 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) [2022-07-12 10:13:09,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 10:13:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:13:09,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 10:13:09,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:13:09,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:13:09,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:13:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:13:09,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886745590] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:13:09,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:13:09,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-12 10:13:09,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77107996] [2022-07-12 10:13:09,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:13:09,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 10:13:09,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:13:09,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 10:13:09,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:13:09,885 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 487 out of 542 [2022-07-12 10:13:09,887 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 499 transitions, 1016 flow. Second operand has 5 states, 5 states have (on average 490.2) internal successors, (2451), 5 states have internal predecessors, (2451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:09,887 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:13:09,887 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 487 of 542 [2022-07-12 10:13:09,888 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:13:09,997 INFO L129 PetriNetUnfolder]: 28/736 cut-off events. [2022-07-12 10:13:09,998 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-07-12 10:13:10,006 INFO L84 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 736 events. 28/736 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2562 event pairs, 0 based on Foata normal form. 1/665 useless extension candidates. Maximal degree in co-relation 710. Up to 7 conditions per place. [2022-07-12 10:13:10,010 INFO L132 encePairwiseOnDemand]: 538/542 looper letters, 14 selfloop transitions, 4 changer transitions 0/505 dead transitions. [2022-07-12 10:13:10,010 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 505 transitions, 1064 flow [2022-07-12 10:13:10,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 10:13:10,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-07-12 10:13:10,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1967 transitions. [2022-07-12 10:13:10,014 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9072878228782287 [2022-07-12 10:13:10,014 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1967 transitions. [2022-07-12 10:13:10,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1967 transitions. [2022-07-12 10:13:10,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:13:10,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1967 transitions. [2022-07-12 10:13:10,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 491.75) internal successors, (1967), 4 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:10,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 542.0) internal successors, (2710), 5 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:10,022 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 542.0) internal successors, (2710), 5 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:10,022 INFO L186 Difference]: Start difference. First operand has 485 places, 499 transitions, 1016 flow. Second operand 4 states and 1967 transitions. [2022-07-12 10:13:10,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 505 transitions, 1064 flow [2022-07-12 10:13:10,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 505 transitions, 1062 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-12 10:13:10,029 INFO L242 Difference]: Finished difference. Result has 489 places, 500 transitions, 1034 flow [2022-07-12 10:13:10,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=542, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1034, PETRI_PLACES=489, PETRI_TRANSITIONS=500} [2022-07-12 10:13:10,030 INFO L279 CegarLoopForPetriNet]: 482 programPoint places, 7 predicate places. [2022-07-12 10:13:10,031 INFO L495 AbstractCegarLoop]: Abstraction has has 489 places, 500 transitions, 1034 flow [2022-07-12 10:13:10,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 490.2) internal successors, (2451), 5 states have internal predecessors, (2451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:10,032 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:13:10,033 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:13:10,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 10:13:10,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:13:10,245 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-07-12 10:13:10,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:13:10,245 INFO L85 PathProgramCache]: Analyzing trace with hash -229323493, now seen corresponding path program 2 times [2022-07-12 10:13:10,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:13:10,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196468542] [2022-07-12 10:13:10,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:13:10,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:13:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:13:10,332 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 10:13:10,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:13:10,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196468542] [2022-07-12 10:13:10,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196468542] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:13:10,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:13:10,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 10:13:10,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285426360] [2022-07-12 10:13:10,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:13:10,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:13:10,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:13:10,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:13:10,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 10:13:10,340 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 484 out of 542 [2022-07-12 10:13:10,342 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 489 places, 500 transitions, 1034 flow. Second operand has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:10,342 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:13:10,342 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 484 of 542 [2022-07-12 10:13:10,342 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:13:10,440 INFO L129 PetriNetUnfolder]: 28/732 cut-off events. [2022-07-12 10:13:10,441 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-07-12 10:13:10,448 INFO L84 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 732 events. 28/732 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2555 event pairs, 0 based on Foata normal form. 0/662 useless extension candidates. Maximal degree in co-relation 700. Up to 9 conditions per place. [2022-07-12 10:13:10,451 INFO L132 encePairwiseOnDemand]: 536/542 looper letters, 8 selfloop transitions, 4 changer transitions 0/496 dead transitions. [2022-07-12 10:13:10,451 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 496 transitions, 1050 flow [2022-07-12 10:13:10,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 10:13:10,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-07-12 10:13:10,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1950 transitions. [2022-07-12 10:13:10,456 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8994464944649446 [2022-07-12 10:13:10,456 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1950 transitions. [2022-07-12 10:13:10,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1950 transitions. [2022-07-12 10:13:10,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:13:10,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1950 transitions. [2022-07-12 10:13:10,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 487.5) internal successors, (1950), 4 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:10,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 542.0) internal successors, (2710), 5 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:10,465 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 542.0) internal successors, (2710), 5 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:10,465 INFO L186 Difference]: Start difference. First operand has 489 places, 500 transitions, 1034 flow. Second operand 4 states and 1950 transitions. [2022-07-12 10:13:10,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 496 transitions, 1050 flow [2022-07-12 10:13:10,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 496 transitions, 1046 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-07-12 10:13:10,473 INFO L242 Difference]: Finished difference. Result has 487 places, 496 transitions, 1030 flow [2022-07-12 10:13:10,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=542, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1030, PETRI_PLACES=487, PETRI_TRANSITIONS=496} [2022-07-12 10:13:10,474 INFO L279 CegarLoopForPetriNet]: 482 programPoint places, 5 predicate places. [2022-07-12 10:13:10,474 INFO L495 AbstractCegarLoop]: Abstraction has has 487 places, 496 transitions, 1030 flow [2022-07-12 10:13:10,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:10,476 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:13:10,476 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:13:10,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 10:13:10,476 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-07-12 10:13:10,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:13:10,477 INFO L85 PathProgramCache]: Analyzing trace with hash -305101375, now seen corresponding path program 1 times [2022-07-12 10:13:10,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:13:10,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231773680] [2022-07-12 10:13:10,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:13:10,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:13:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:13:10,556 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 10:13:10,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:13:10,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231773680] [2022-07-12 10:13:10,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231773680] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:13:10,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800477083] [2022-07-12 10:13:10,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:13:10,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:13:10,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:13:10,558 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) [2022-07-12 10:13:10,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 10:13:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:13:10,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 10:13:10,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:13:10,729 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 10:13:10,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:13:10,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800477083] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:13:10,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:13:10,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-07-12 10:13:10,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820789438] [2022-07-12 10:13:10,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:13:10,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:13:10,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:13:10,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:13:10,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:13:10,733 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 489 out of 542 [2022-07-12 10:13:10,734 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 496 transitions, 1030 flow. Second operand has 4 states, 4 states have (on average 491.25) internal successors, (1965), 4 states have internal predecessors, (1965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:10,735 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:13:10,735 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 489 of 542 [2022-07-12 10:13:10,735 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:13:10,830 INFO L129 PetriNetUnfolder]: 28/727 cut-off events. [2022-07-12 10:13:10,831 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-07-12 10:13:10,838 INFO L84 FinitePrefix]: Finished finitePrefix Result has 763 conditions, 727 events. 28/727 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2517 event pairs, 0 based on Foata normal form. 0/658 useless extension candidates. Maximal degree in co-relation 695. Up to 5 conditions per place. [2022-07-12 10:13:10,841 INFO L132 encePairwiseOnDemand]: 538/542 looper letters, 7 selfloop transitions, 3 changer transitions 0/496 dead transitions. [2022-07-12 10:13:10,841 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 496 transitions, 1048 flow [2022-07-12 10:13:10,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 10:13:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-07-12 10:13:10,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1967 transitions. [2022-07-12 10:13:10,844 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9072878228782287 [2022-07-12 10:13:10,844 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1967 transitions. [2022-07-12 10:13:10,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1967 transitions. [2022-07-12 10:13:10,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:13:10,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1967 transitions. [2022-07-12 10:13:10,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 491.75) internal successors, (1967), 4 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:10,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 542.0) internal successors, (2710), 5 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:10,853 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 542.0) internal successors, (2710), 5 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:10,853 INFO L186 Difference]: Start difference. First operand has 487 places, 496 transitions, 1030 flow. Second operand 4 states and 1967 transitions. [2022-07-12 10:13:10,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 489 places, 496 transitions, 1048 flow [2022-07-12 10:13:10,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 484 places, 496 transitions, 1036 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-07-12 10:13:10,860 INFO L242 Difference]: Finished difference. Result has 486 places, 496 transitions, 1031 flow [2022-07-12 10:13:10,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=542, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1031, PETRI_PLACES=486, PETRI_TRANSITIONS=496} [2022-07-12 10:13:10,861 INFO L279 CegarLoopForPetriNet]: 482 programPoint places, 4 predicate places. [2022-07-12 10:13:10,861 INFO L495 AbstractCegarLoop]: Abstraction has has 486 places, 496 transitions, 1031 flow [2022-07-12 10:13:10,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 491.25) internal successors, (1965), 4 states have internal predecessors, (1965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:10,862 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:13:10,863 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:13:10,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 10:13:11,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-12 10:13:11,083 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-07-12 10:13:11,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:13:11,084 INFO L85 PathProgramCache]: Analyzing trace with hash 47514415, now seen corresponding path program 1 times [2022-07-12 10:13:11,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:13:11,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221028934] [2022-07-12 10:13:11,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:13:11,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:13:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:13:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 10:13:11,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:13:11,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221028934] [2022-07-12 10:13:11,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221028934] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:13:11,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:13:11,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 10:13:11,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987554528] [2022-07-12 10:13:11,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:13:11,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:13:11,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:13:11,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:13:11,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:13:11,161 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 489 out of 542 [2022-07-12 10:13:11,163 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 486 places, 496 transitions, 1031 flow. Second operand has 3 states, 3 states have (on average 490.0) internal successors, (1470), 3 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:11,163 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:13:11,163 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 489 of 542 [2022-07-12 10:13:11,163 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:13:11,255 INFO L129 PetriNetUnfolder]: 19/533 cut-off events. [2022-07-12 10:13:11,255 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-07-12 10:13:11,262 INFO L84 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 533 events. 19/533 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1136 event pairs, 0 based on Foata normal form. 1/486 useless extension candidates. Maximal degree in co-relation 499. Up to 5 conditions per place. [2022-07-12 10:13:11,265 INFO L132 encePairwiseOnDemand]: 539/542 looper letters, 7 selfloop transitions, 2 changer transitions 0/495 dead transitions. [2022-07-12 10:13:11,265 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 495 transitions, 1043 flow [2022-07-12 10:13:11,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:13:11,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:13:11,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1477 transitions. [2022-07-12 10:13:11,268 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9083640836408364 [2022-07-12 10:13:11,268 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1477 transitions. [2022-07-12 10:13:11,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1477 transitions. [2022-07-12 10:13:11,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:13:11,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1477 transitions. [2022-07-12 10:13:11,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 492.3333333333333) internal successors, (1477), 3 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:11,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 542.0) internal successors, (2168), 4 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:11,274 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 542.0) internal successors, (2168), 4 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:11,274 INFO L186 Difference]: Start difference. First operand has 486 places, 496 transitions, 1031 flow. Second operand 3 states and 1477 transitions. [2022-07-12 10:13:11,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 495 transitions, 1043 flow [2022-07-12 10:13:11,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 495 transitions, 1040 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-12 10:13:11,283 INFO L242 Difference]: Finished difference. Result has 486 places, 495 transitions, 1026 flow [2022-07-12 10:13:11,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=542, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1026, PETRI_PLACES=486, PETRI_TRANSITIONS=495} [2022-07-12 10:13:11,285 INFO L279 CegarLoopForPetriNet]: 482 programPoint places, 4 predicate places. [2022-07-12 10:13:11,285 INFO L495 AbstractCegarLoop]: Abstraction has has 486 places, 495 transitions, 1026 flow [2022-07-12 10:13:11,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 490.0) internal successors, (1470), 3 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:11,287 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:13:11,287 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:13:11,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:13:11,287 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting worker_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-07-12 10:13:11,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:13:11,287 INFO L85 PathProgramCache]: Analyzing trace with hash 267906197, now seen corresponding path program 1 times [2022-07-12 10:13:11,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:13:11,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853598733] [2022-07-12 10:13:11,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:13:11,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:13:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:13:12,105 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 10:13:12,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:13:12,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853598733] [2022-07-12 10:13:12,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853598733] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:13:12,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:13:12,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-07-12 10:13:12,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383899882] [2022-07-12 10:13:12,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:13:12,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 10:13:12,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:13:12,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 10:13:12,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2022-07-12 10:13:12,112 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 542 [2022-07-12 10:13:12,118 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 486 places, 495 transitions, 1026 flow. Second operand has 21 states, 21 states have (on average 371.3809523809524) internal successors, (7799), 21 states have internal predecessors, (7799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:12,118 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:13:12,118 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 542 [2022-07-12 10:13:12,118 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:13:14,184 INFO L129 PetriNetUnfolder]: 2475/12019 cut-off events. [2022-07-12 10:13:14,185 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-07-12 10:13:14,211 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16148 conditions, 12019 events. 2475/12019 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 118244 event pairs, 976 based on Foata normal form. 0/10727 useless extension candidates. Maximal degree in co-relation 16048. Up to 2878 conditions per place. [2022-07-12 10:13:14,250 INFO L132 encePairwiseOnDemand]: 521/542 looper letters, 234 selfloop transitions, 24 changer transitions 0/624 dead transitions. [2022-07-12 10:13:14,250 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 501 places, 624 transitions, 1800 flow [2022-07-12 10:13:14,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 10:13:14,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-12 10:13:14,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 6166 transitions. [2022-07-12 10:13:14,259 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7110239852398524 [2022-07-12 10:13:14,259 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 6166 transitions. [2022-07-12 10:13:14,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 6166 transitions. [2022-07-12 10:13:14,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:13:14,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 6166 transitions. [2022-07-12 10:13:14,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 385.375) internal successors, (6166), 16 states have internal predecessors, (6166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:14,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 542.0) internal successors, (9214), 17 states have internal predecessors, (9214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:14,281 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 542.0) internal successors, (9214), 17 states have internal predecessors, (9214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:14,281 INFO L186 Difference]: Start difference. First operand has 486 places, 495 transitions, 1026 flow. Second operand 16 states and 6166 transitions. [2022-07-12 10:13:14,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 501 places, 624 transitions, 1800 flow [2022-07-12 10:13:14,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 499 places, 624 transitions, 1796 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-12 10:13:14,291 INFO L242 Difference]: Finished difference. Result has 504 places, 506 transitions, 1134 flow [2022-07-12 10:13:14,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=542, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1134, PETRI_PLACES=504, PETRI_TRANSITIONS=506} [2022-07-12 10:13:14,292 INFO L279 CegarLoopForPetriNet]: 482 programPoint places, 22 predicate places. [2022-07-12 10:13:14,292 INFO L495 AbstractCegarLoop]: Abstraction has has 504 places, 506 transitions, 1134 flow [2022-07-12 10:13:14,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 371.3809523809524) internal successors, (7799), 21 states have internal predecessors, (7799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:14,295 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:13:14,295 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:13:14,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 10:13:14,295 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting worker_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-07-12 10:13:14,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:13:14,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1146631376, now seen corresponding path program 1 times [2022-07-12 10:13:14,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:13:14,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391284609] [2022-07-12 10:13:14,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:13:14,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:13:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:13:14,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 10:13:14,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:13:14,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391284609] [2022-07-12 10:13:14,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391284609] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:13:14,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:13:14,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-07-12 10:13:14,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377922076] [2022-07-12 10:13:14,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:13:14,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 10:13:14,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:13:14,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 10:13:14,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2022-07-12 10:13:14,997 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 542 [2022-07-12 10:13:15,002 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 504 places, 506 transitions, 1134 flow. Second operand has 21 states, 21 states have (on average 371.42857142857144) internal successors, (7800), 21 states have internal predecessors, (7800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:15,002 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:13:15,002 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 542 [2022-07-12 10:13:15,002 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:13:16,910 INFO L129 PetriNetUnfolder]: 2501/12492 cut-off events. [2022-07-12 10:13:16,910 INFO L130 PetriNetUnfolder]: For 505/505 co-relation queries the response was YES. [2022-07-12 10:13:16,936 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17256 conditions, 12492 events. 2501/12492 cut-off events. For 505/505 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 123775 event pairs, 1016 based on Foata normal form. 0/11216 useless extension candidates. Maximal degree in co-relation 17144. Up to 2929 conditions per place. [2022-07-12 10:13:16,962 INFO L132 encePairwiseOnDemand]: 522/542 looper letters, 234 selfloop transitions, 26 changer transitions 0/629 dead transitions. [2022-07-12 10:13:16,962 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 629 transitions, 1921 flow [2022-07-12 10:13:16,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 10:13:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-12 10:13:16,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 6165 transitions. [2022-07-12 10:13:16,971 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7109086715867159 [2022-07-12 10:13:16,971 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 6165 transitions. [2022-07-12 10:13:16,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 6165 transitions. [2022-07-12 10:13:16,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:13:16,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 6165 transitions. [2022-07-12 10:13:16,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 385.3125) internal successors, (6165), 16 states have internal predecessors, (6165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:16,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 542.0) internal successors, (9214), 17 states have internal predecessors, (9214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:16,992 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 542.0) internal successors, (9214), 17 states have internal predecessors, (9214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:16,993 INFO L186 Difference]: Start difference. First operand has 504 places, 506 transitions, 1134 flow. Second operand 16 states and 6165 transitions. [2022-07-12 10:13:16,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 629 transitions, 1921 flow [2022-07-12 10:13:16,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 510 places, 629 transitions, 1897 flow, removed 0 selfloop flow, removed 9 redundant places. [2022-07-12 10:13:17,003 INFO L242 Difference]: Finished difference. Result has 514 places, 512 transitions, 1207 flow [2022-07-12 10:13:17,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=542, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=495, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1207, PETRI_PLACES=514, PETRI_TRANSITIONS=512} [2022-07-12 10:13:17,005 INFO L279 CegarLoopForPetriNet]: 482 programPoint places, 32 predicate places. [2022-07-12 10:13:17,005 INFO L495 AbstractCegarLoop]: Abstraction has has 514 places, 512 transitions, 1207 flow [2022-07-12 10:13:17,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 371.42857142857144) internal successors, (7800), 21 states have internal predecessors, (7800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:13:17,007 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:13:17,007 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:13:17,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 10:13:17,007 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting worker_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-07-12 10:13:17,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:13:17,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1809153885, now seen corresponding path program 1 times [2022-07-12 10:13:17,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:13:17,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042522805] [2022-07-12 10:13:17,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:13:17,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:13:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:13:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:13:19,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:13:19,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042522805] [2022-07-12 10:13:19,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042522805] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:13:19,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41022929] [2022-07-12 10:13:19,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:13:19,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:13:19,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:13:19,148 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) [2022-07-12 10:13:19,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 10:13:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:13:19,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-12 10:13:19,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:13:19,764 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-12 10:13:19,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-12 10:13:19,881 INFO L356 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-07-12 10:13:19,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2022-07-12 10:13:20,024 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-07-12 10:13:20,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 57 [2022-07-12 10:13:20,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2022-07-12 10:13:20,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2022-07-12 10:13:20,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2022-07-12 10:13:20,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2022-07-12 10:13:20,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2022-07-12 10:13:20,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2022-07-12 10:13:21,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2022-07-12 10:13:21,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2022-07-12 10:13:21,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2022-07-12 10:13:22,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2022-07-12 10:13:22,221 INFO L356 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-07-12 10:13:22,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2022-07-12 10:13:22,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:13:22,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-07-12 10:13:22,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2022-07-12 10:13:22,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-07-12 10:13:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 10:13:22,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:13:23,147 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_695 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_695))) (let ((.cse1 (select .cse0 |c_~#in~0.base|))) (or (not (<= (mod (select (select .cse0 |c_~#post~0.base|) |c_~#post~0.offset|) 256) 0)) (not (<= (mod (select .cse1 |c_~#in~0.offset|) 256) 0)) (= (mod (select .cse1 (+ |c_~#in~0.offset| 1)) 256) 0))))) is different from false [2022-07-12 10:13:23,204 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_694 Int) (v_ArrVal_695 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base|) (+ |c_ULTIMATE.start_main_~#worker~0#1.offset| (* |c_ULTIMATE.start_main_~i~5#1| 4)) v_ArrVal_694)) |c_~#pre~0.base| v_ArrVal_695))) (let ((.cse1 (select .cse0 |c_~#in~0.base|))) (or (not (<= (mod (select (select .cse0 |c_~#post~0.base|) |c_~#post~0.offset|) 256) 0)) (= (mod (select .cse1 (+ |c_~#in~0.offset| 1)) 256) 0) (not (<= (mod (select .cse1 |c_~#in~0.offset|) 256) 0)))))) is different from false [2022-07-12 10:13:23,254 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~5#1_12| Int)) (or (not (<= |v_ULTIMATE.start_main_~i~5#1_12| 0)) (forall ((v_ArrVal_694 Int) (v_ArrVal_695 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base|) (+ |c_ULTIMATE.start_main_~#worker~0#1.offset| (* |v_ULTIMATE.start_main_~i~5#1_12| 4)) v_ArrVal_694)) |c_~#pre~0.base| v_ArrVal_695))) (let ((.cse0 (select .cse1 |c_~#in~0.base|))) (or (= (mod (select .cse0 (+ |c_~#in~0.offset| 1)) 256) 0) (not (<= (mod (select .cse0 |c_~#in~0.offset|) 256) 0)) (not (<= (mod (select (select .cse1 |c_~#post~0.base|) |c_~#post~0.offset|) 256) 0)))))))) is different from false [2022-07-12 10:13:26,375 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:13:26,376 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:13:26,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:13:26,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:13:26,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:13:26,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:13:26,397 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:13:26,435 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:13:26,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42184 treesize of output 41550 [2022-07-12 10:13:26,647 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:13:26,678 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:13:26,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41514 treesize of output 38456 [2022-07-12 10:13:26,852 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:13:26,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38380 treesize of output 37612 [2022-07-12 10:13:27,028 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:13:27,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42348 treesize of output 41388 [2022-07-12 10:13:27,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:13:27,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41388 treesize of output 41004 [2022-07-12 10:13:28,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2022-07-12 10:13:29,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11702 treesize of output 11190