/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:07:53,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:07:53,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:07:53,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:07:53,500 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:07:53,503 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:07:53,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:07:53,509 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:07:53,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:07:53,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:07:53,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:07:53,520 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:07:53,521 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:07:53,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:07:53,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:07:53,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:07:53,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:07:53,528 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:07:53,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:07:53,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:07:53,537 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:07:53,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:07:53,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:07:53,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:07:53,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:07:53,547 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:07:53,547 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:07:53,549 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:07:53,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:07:53,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:07:53,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:07:53,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:07:53,553 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:07:53,553 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:07:53,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:07:53,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:07:53,555 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:07:53,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:07:53,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:07:53,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:07:53,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:07:53,558 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:07:53,624 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:07:53,624 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:07:53,626 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:07:53,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:07:53,626 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:07:53,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:07:53,627 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:07:53,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:07:53,628 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:07:53,628 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:07:53,628 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:07:53,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:07:53,629 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:07:53,629 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:07:53,629 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:07:53,629 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:07:53,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:07:53,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:07:53,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:07:53,630 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:07:53,630 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:07:53,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:07:53,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:07:53,630 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:07:53,631 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:07:53,631 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:07:53,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:07:53,631 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:07:53,631 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 [2022-12-05 23:07:53,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:07:54,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:07:54,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:07:54,008 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:07:54,009 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:07:54,010 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_tso.i [2022-12-05 23:07:55,037 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:07:55,268 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:07:55,269 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_tso.i [2022-12-05 23:07:55,283 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d5c98ef1/d6d5a0c48f404969a789addf7b0792e3/FLAG212bc7dce [2022-12-05 23:07:55,297 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d5c98ef1/d6d5a0c48f404969a789addf7b0792e3 [2022-12-05 23:07:55,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:07:55,300 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:07:55,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:07:55,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:07:55,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:07:55,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:07:55" (1/1) ... [2022-12-05 23:07:55,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c7dd2ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:55, skipping insertion in model container [2022-12-05 23:07:55,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:07:55" (1/1) ... [2022-12-05 23:07:55,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:07:55,349 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:07:55,464 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_tso.i[944,957] [2022-12-05 23:07:55,628 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:55,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:55,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:55,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:55,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:55,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:55,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:55,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:55,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:55,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:55,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:55,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:55,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:55,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:55,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:55,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:55,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:55,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:55,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:55,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:55,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:55,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:55,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:55,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:55,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:55,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:55,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:07:55,728 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:07:55,739 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_tso.i[944,957] [2022-12-05 23:07:55,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:55,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:55,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:55,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:55,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:55,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:55,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:55,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:55,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:55,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:55,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:55,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:55,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:55,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:55,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:55,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:55,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:55,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:55,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:55,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:55,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:55,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:55,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:55,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:55,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:55,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:55,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:07:55,857 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:07:55,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:55 WrapperNode [2022-12-05 23:07:55,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:07:55,859 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:07:55,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:07:55,860 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:07:55,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:55" (1/1) ... [2022-12-05 23:07:55,894 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:55" (1/1) ... [2022-12-05 23:07:55,933 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2022-12-05 23:07:55,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:07:55,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:07:55,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:07:55,935 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:07:55,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:55" (1/1) ... [2022-12-05 23:07:55,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:55" (1/1) ... [2022-12-05 23:07:55,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:55" (1/1) ... [2022-12-05 23:07:55,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:55" (1/1) ... [2022-12-05 23:07:55,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:55" (1/1) ... [2022-12-05 23:07:55,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:55" (1/1) ... [2022-12-05 23:07:55,973 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:55" (1/1) ... [2022-12-05 23:07:55,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:55" (1/1) ... [2022-12-05 23:07:55,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:07:55,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:07:55,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:07:55,978 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:07:55,979 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:55" (1/1) ... [2022-12-05 23:07:55,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:07:56,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:07:56,020 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-12-05 23:07:56,028 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-12-05 23:07:56,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:07:56,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:07:56,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:07:56,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:07:56,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:07:56,052 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:07:56,052 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:07:56,053 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:07:56,053 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:07:56,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:07:56,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:07:56,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:07:56,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:07:56,054 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:07:56,193 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:07:56,195 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:07:56,667 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:07:56,825 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:07:56,825 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:07:56,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:07:56 BoogieIcfgContainer [2022-12-05 23:07:56,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:07:56,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:07:56,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:07:56,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:07:56,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:07:55" (1/3) ... [2022-12-05 23:07:56,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eff2d43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:07:56, skipping insertion in model container [2022-12-05 23:07:56,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:55" (2/3) ... [2022-12-05 23:07:56,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eff2d43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:07:56, skipping insertion in model container [2022-12-05 23:07:56,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:07:56" (3/3) ... [2022-12-05 23:07:56,835 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_tso.i [2022-12-05 23:07:56,850 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:07:56,851 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:07:56,851 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:07:56,900 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:07:56,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 190 flow [2022-12-05 23:07:56,987 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2022-12-05 23:07:56,988 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:07:56,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-05 23:07:56,993 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 90 transitions, 190 flow [2022-12-05 23:07:56,997 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 88 transitions, 182 flow [2022-12-05 23:07:56,998 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:57,023 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 88 transitions, 182 flow [2022-12-05 23:07:57,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 88 transitions, 182 flow [2022-12-05 23:07:57,064 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2022-12-05 23:07:57,064 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:07:57,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-05 23:07:57,068 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 88 transitions, 182 flow [2022-12-05 23:07:57,068 INFO L188 LiptonReduction]: Number of co-enabled transitions 1156 [2022-12-05 23:08:01,329 INFO L203 LiptonReduction]: Total number of compositions: 69 [2022-12-05 23:08:01,343 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:08:01,348 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=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@50eabb2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:08:01,348 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 23:08:01,352 INFO L130 PetriNetUnfolder]: 1/12 cut-off events. [2022-12-05 23:08:01,352 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:08:01,352 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:01,352 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-05 23:08:01,353 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:01,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:01,356 INFO L85 PathProgramCache]: Analyzing trace with hash 999880443, now seen corresponding path program 1 times [2022-12-05 23:08:01,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:01,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25030177] [2022-12-05 23:08:01,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:01,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:01,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:08:01,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:01,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25030177] [2022-12-05 23:08:01,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25030177] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:01,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:01,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:08:01,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716131146] [2022-12-05 23:08:01,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:01,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:08:01,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:01,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:08:01,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:08:01,755 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-05 23:08:01,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-12-05 23:08:01,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:01,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-05 23:08:01,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:01,907 INFO L130 PetriNetUnfolder]: 249/428 cut-off events. [2022-12-05 23:08:01,907 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 23:08:01,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 428 events. 249/428 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1701 event pairs, 59 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 858. Up to 311 conditions per place. [2022-12-05 23:08:01,911 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 20 selfloop transitions, 2 changer transitions 4/27 dead transitions. [2022-12-05 23:08:01,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 27 transitions, 112 flow [2022-12-05 23:08:01,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:08:01,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:08:01,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-05 23:08:01,921 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2022-12-05 23:08:01,922 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 3 states and 34 transitions. [2022-12-05 23:08:01,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 27 transitions, 112 flow [2022-12-05 23:08:01,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:08:01,926 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 42 flow [2022-12-05 23:08:01,928 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2022-12-05 23:08:01,930 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -2 predicate places. [2022-12-05 23:08:01,931 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:01,931 INFO L89 Accepts]: Start accepts. Operand has 26 places, 17 transitions, 42 flow [2022-12-05 23:08:01,933 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:01,933 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:01,934 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 17 transitions, 42 flow [2022-12-05 23:08:01,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 17 transitions, 42 flow [2022-12-05 23:08:01,949 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-05 23:08:01,950 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:08:01,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 17 events. 0/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:08:01,952 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 17 transitions, 42 flow [2022-12-05 23:08:01,952 INFO L188 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-05 23:08:02,007 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:08:02,009 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-05 23:08:02,009 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 42 flow [2022-12-05 23:08:02,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-12-05 23:08:02,010 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:02,010 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:02,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:08:02,011 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:02,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:02,011 INFO L85 PathProgramCache]: Analyzing trace with hash 931492839, now seen corresponding path program 1 times [2022-12-05 23:08:02,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:02,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117023309] [2022-12-05 23:08:02,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:02,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:02,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:08:02,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:02,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117023309] [2022-12-05 23:08:02,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117023309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:02,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:02,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:08:02,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378756175] [2022-12-05 23:08:02,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:02,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:08:02,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:02,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:08:02,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:08:02,821 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:08:02,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 42 flow. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-12-05 23:08:02,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:02,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:08:02,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:02,954 INFO L130 PetriNetUnfolder]: 199/351 cut-off events. [2022-12-05 23:08:02,954 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-05 23:08:02,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 351 events. 199/351 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1188 event pairs, 75 based on Foata normal form. 19/370 useless extension candidates. Maximal degree in co-relation 723. Up to 212 conditions per place. [2022-12-05 23:08:02,957 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 22 selfloop transitions, 7 changer transitions 0/29 dead transitions. [2022-12-05 23:08:02,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 29 transitions, 124 flow [2022-12-05 23:08:02,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:08:02,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:08:02,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-05 23:08:02,958 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45588235294117646 [2022-12-05 23:08:02,959 INFO L175 Difference]: Start difference. First operand has 24 places, 17 transitions, 42 flow. Second operand 4 states and 31 transitions. [2022-12-05 23:08:02,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 29 transitions, 124 flow [2022-12-05 23:08:02,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 29 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:08:02,960 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 90 flow [2022-12-05 23:08:02,960 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2022-12-05 23:08:02,961 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 0 predicate places. [2022-12-05 23:08:02,961 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:02,961 INFO L89 Accepts]: Start accepts. Operand has 28 places, 22 transitions, 90 flow [2022-12-05 23:08:02,962 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:02,962 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:02,962 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 22 transitions, 90 flow [2022-12-05 23:08:02,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 22 transitions, 90 flow [2022-12-05 23:08:02,980 INFO L130 PetriNetUnfolder]: 42/98 cut-off events. [2022-12-05 23:08:02,980 INFO L131 PetriNetUnfolder]: For 19/22 co-relation queries the response was YES. [2022-12-05 23:08:02,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 98 events. 42/98 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 336 event pairs, 21 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 219. Up to 70 conditions per place. [2022-12-05 23:08:02,981 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 22 transitions, 90 flow [2022-12-05 23:08:02,982 INFO L188 LiptonReduction]: Number of co-enabled transitions 106 [2022-12-05 23:08:03,188 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L739-->L742: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [351] L786-->L802: Formula: (let ((.cse10 (= (mod v_~y$r_buff1_thd2~0_100 256) 0)) (.cse4 (= (mod v_~y$r_buff0_thd2~0_107 256) 0))) (let ((.cse5 (not .cse4)) (.cse11 (= (mod v_~y$w_buff0_used~0_182 256) 0)) (.cse2 (and .cse4 .cse10)) (.cse6 (and (= (mod v_~y$w_buff1_used~0_181 256) 0) .cse4))) (let ((.cse3 (= (mod v_~y$w_buff1_used~0_180 256) 0)) (.cse1 (= (mod v_~y$w_buff0_used~0_181 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_88 256) 0))) (.cse7 (or .cse11 .cse2 .cse6)) (.cse8 (and (not .cse11) .cse5))) (and (= (ite .cse0 v_~y$r_buff0_thd2~0_107 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~y$r_buff0_thd2~0_107 (ite (and (not .cse1) .cse5) 0 v_~y$r_buff0_thd2~0_107))) v_~y$r_buff0_thd2~0_106) (= v_~y$w_buff1_used~0_180 (ite .cse0 v_~y$w_buff1_used~0_181 (ite (or .cse1 .cse2 .cse6) v_~y$w_buff1_used~0_181 0))) (= v_~y$w_buff0_used~0_181 (ite .cse0 v_~y$w_buff0_used~0_182 (ite .cse7 v_~y$w_buff0_used~0_182 (ite .cse8 0 v_~y$w_buff0_used~0_182)))) (= (ite .cse0 v_~y$r_buff1_thd2~0_100 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd2~0_106 256) 0))) (or (and .cse9 .cse3) .cse1 (and .cse9 .cse10))) v_~y$r_buff1_thd2~0_100 0)) v_~y$r_buff1_thd2~0_99) (= v_~y$w_buff0~0_99 v_~y$w_buff0~0_98) (= v_~y$w_buff1~0_90 v_~y$w_buff1~0_89) (= |v_P1Thread1of1ForFork1_#t~nondet6#1_1| v_~weak$$choice2~0_88) (= v_~y~0_163 (ite .cse0 v_~y$mem_tmp~0_62 v_~__unbuffered_p1_EBX~0_18)) (= 0 v_~y$flush_delayed~0_75) (= v_~__unbuffered_p1_EBX~0_18 (ite .cse7 v_~y~0_165 (ite .cse8 v_~y$w_buff0~0_99 v_~y$w_buff1~0_90))) (= v_~y~0_165 v_~y$mem_tmp~0_62) (= |v_P1Thread1of1ForFork1_#t~nondet5#1_1| v_~weak$$choice0~0_21))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_100, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_182, ~y$w_buff1~0=v_~y$w_buff1~0_90, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_1|, ~y$w_buff0~0=v_~y$w_buff0~0_99, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_1|, ~y~0=v_~y~0_165, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_181} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_181, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_99, ~weak$$choice0~0=v_~weak$$choice0~0_21, ~y$mem_tmp~0=v_~y$mem_tmp~0_62, ~y$w_buff1~0=v_~y$w_buff1~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_98, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_106, ~y$flush_delayed~0=v_~y$flush_delayed~0_75, ~y~0=v_~y~0_163, ~weak$$choice2~0=v_~weak$$choice2~0_88, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_180} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet5#1, P1Thread1of1ForFork1_#t~nondet6#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-05 23:08:03,368 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L739-->L742: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [352] L802-->L809: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd2~0_96 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_177 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_103 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff0_used~0_178 256) 0)) .cse5)) (.cse4 (and .cse5 .cse2)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_177 256) 0)) .cse3))) (and (= v_~y~0_159 (ite .cse0 v_~y$w_buff0~0_96 (ite .cse1 v_~y$w_buff1~0_87 v_~y~0_160))) (= (ite .cse0 0 v_~y$w_buff0_used~0_178) v_~y$w_buff0_used~0_177) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_102 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_176 256) 0)) .cse3)) 0 v_~y$r_buff1_thd2~0_96) v_~y$r_buff1_thd2~0_95) (= v_~y$r_buff0_thd2~0_102 (ite .cse4 0 v_~y$r_buff0_thd2~0_103)) (= v_~y$w_buff1_used~0_176 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_177))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_96, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_178, ~y$w_buff1~0=v_~y$w_buff1~0_87, ~y$w_buff0~0=v_~y$w_buff0~0_96, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_103, ~y~0=v_~y~0_160, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_177} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_95, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_177, ~y$w_buff1~0=v_~y$w_buff1~0_87, ~y$w_buff0~0=v_~y$w_buff0~0_96, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_102, ~y~0=v_~y~0_159, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_176} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-05 23:08:03,490 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L739-->L742: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [426] L832-->L840: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd0~0_124 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_291 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_126 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_292 256) 0)) .cse5)) (.cse0 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_286 256) 0)) .cse4))) (and (= v_~y$r_buff0_thd0~0_125 (ite .cse0 0 v_~y$r_buff0_thd0~0_126)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_21| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|) (= (mod v_~main$tmp_guard0~0_32 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|) (= v_~y~0_257 (ite .cse1 v_~y$w_buff0~0_192 (ite .cse2 v_~y$w_buff1~0_168 v_~y~0_258))) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd0~0_125 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_285 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_124) v_~y$r_buff1_thd0~0_123) (= (ite .cse1 0 v_~y$w_buff0_used~0_292) v_~y$w_buff0_used~0_291) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_21| 0)) (= (ite (or .cse0 .cse2) 0 v_~y$w_buff1_used~0_286) v_~y$w_buff1_used~0_285)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_292, ~y$w_buff1~0=v_~y$w_buff1~0_168, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_126, ~y$w_buff0~0=v_~y$w_buff0~0_192, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, ~y~0=v_~y~0_258, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_124, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_286} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_291, ~y$w_buff1~0=v_~y$w_buff1~0_168, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_192, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, ~y~0=v_~y~0_257, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_123, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_285, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-05 23:08:03,630 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:08:03,631 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 670 [2022-12-05 23:08:03,632 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 90 flow [2022-12-05 23:08:03,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-12-05 23:08:03,632 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:03,632 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:03,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:08:03,632 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:03,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:03,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1275046905, now seen corresponding path program 1 times [2022-12-05 23:08:03,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:03,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128239894] [2022-12-05 23:08:03,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:03,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:04,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:08:04,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:04,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128239894] [2022-12-05 23:08:04,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128239894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:04,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:04,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:08:04,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767389634] [2022-12-05 23:08:04,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:04,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:08:04,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:04,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:08:04,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:08:04,222 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 23:08:04,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 90 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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-12-05 23:08:04,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:04,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 23:08:04,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:04,357 INFO L130 PetriNetUnfolder]: 210/376 cut-off events. [2022-12-05 23:08:04,358 INFO L131 PetriNetUnfolder]: For 172/172 co-relation queries the response was YES. [2022-12-05 23:08:04,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 376 events. 210/376 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1359 event pairs, 80 based on Foata normal form. 14/390 useless extension candidates. Maximal degree in co-relation 1019. Up to 169 conditions per place. [2022-12-05 23:08:04,361 INFO L137 encePairwiseOnDemand]: 11/21 looper letters, 25 selfloop transitions, 9 changer transitions 0/34 dead transitions. [2022-12-05 23:08:04,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 34 transitions, 204 flow [2022-12-05 23:08:04,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:08:04,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:08:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-05 23:08:04,374 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-05 23:08:04,375 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 90 flow. Second operand 4 states and 36 transitions. [2022-12-05 23:08:04,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 34 transitions, 204 flow [2022-12-05 23:08:04,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 34 transitions, 202 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:08:04,378 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 164 flow [2022-12-05 23:08:04,379 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2022-12-05 23:08:04,380 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 4 predicate places. [2022-12-05 23:08:04,380 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:04,380 INFO L89 Accepts]: Start accepts. Operand has 32 places, 26 transitions, 164 flow [2022-12-05 23:08:04,381 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:04,381 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:04,381 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 26 transitions, 164 flow [2022-12-05 23:08:04,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 26 transitions, 164 flow [2022-12-05 23:08:04,423 INFO L130 PetriNetUnfolder]: 37/102 cut-off events. [2022-12-05 23:08:04,424 INFO L131 PetriNetUnfolder]: For 112/115 co-relation queries the response was YES. [2022-12-05 23:08:04,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337 conditions, 102 events. 37/102 cut-off events. For 112/115 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 391 event pairs, 8 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 323. Up to 73 conditions per place. [2022-12-05 23:08:04,425 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 26 transitions, 164 flow [2022-12-05 23:08:04,425 INFO L188 LiptonReduction]: Number of co-enabled transitions 116 [2022-12-05 23:08:04,427 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:08:04,429 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-05 23:08:04,429 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 164 flow [2022-12-05 23:08:04,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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-12-05 23:08:04,429 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:04,429 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:04,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:08:04,429 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:04,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:04,430 INFO L85 PathProgramCache]: Analyzing trace with hash 871746252, now seen corresponding path program 1 times [2022-12-05 23:08:04,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:04,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291057181] [2022-12-05 23:08:04,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:04,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:08:05,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:05,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291057181] [2022-12-05 23:08:05,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291057181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:05,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:05,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:08:05,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371161145] [2022-12-05 23:08:05,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:05,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:08:05,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:05,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:08:05,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:08:05,117 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-05 23:08:05,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 164 flow. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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-12-05 23:08:05,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:05,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-05 23:08:05,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:05,293 INFO L130 PetriNetUnfolder]: 200/366 cut-off events. [2022-12-05 23:08:05,293 INFO L131 PetriNetUnfolder]: For 486/486 co-relation queries the response was YES. [2022-12-05 23:08:05,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1255 conditions, 366 events. 200/366 cut-off events. For 486/486 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1384 event pairs, 55 based on Foata normal form. 3/366 useless extension candidates. Maximal degree in co-relation 1238. Up to 329 conditions per place. [2022-12-05 23:08:05,296 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 35 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2022-12-05 23:08:05,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 44 transitions, 316 flow [2022-12-05 23:08:05,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:08:05,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:08:05,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-05 23:08:05,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41904761904761906 [2022-12-05 23:08:05,299 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 164 flow. Second operand 5 states and 44 transitions. [2022-12-05 23:08:05,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 44 transitions, 316 flow [2022-12-05 23:08:05,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 44 transitions, 294 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-05 23:08:05,306 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 208 flow [2022-12-05 23:08:05,306 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2022-12-05 23:08:05,308 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 9 predicate places. [2022-12-05 23:08:05,308 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:05,308 INFO L89 Accepts]: Start accepts. Operand has 37 places, 33 transitions, 208 flow [2022-12-05 23:08:05,309 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:05,309 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:05,310 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 33 transitions, 208 flow [2022-12-05 23:08:05,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 33 transitions, 208 flow [2022-12-05 23:08:05,333 INFO L130 PetriNetUnfolder]: 50/139 cut-off events. [2022-12-05 23:08:05,336 INFO L131 PetriNetUnfolder]: For 184/186 co-relation queries the response was YES. [2022-12-05 23:08:05,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 139 events. 50/139 cut-off events. For 184/186 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 610 event pairs, 13 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 444. Up to 78 conditions per place. [2022-12-05 23:08:05,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 33 transitions, 208 flow [2022-12-05 23:08:05,338 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-05 23:08:05,858 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [349] L759-->L770: Formula: (and (= v_~y$r_buff0_thd0~0_In_1 v_~y$r_buff1_thd0~0_Out_2) (= v_~y$w_buff0_used~0_Out_2 1) (= v_~y$r_buff0_thd2~0_In_1 v_~y$r_buff1_thd2~0_Out_2) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0)) (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 1 0)) (= v_~y$w_buff0_used~0_In_1 v_~y$w_buff1_used~0_Out_2) (= 1 v_~y$r_buff0_thd2~0_Out_2) (= v_~y$w_buff1~0_Out_2 v_~y$w_buff0~0_In_1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| 0)) (= v_~y$w_buff0~0_Out_2 1) (= v_~y$r_buff1_thd1~0_Out_2 v_~y$r_buff0_thd1~0_In_1)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_1, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_Out_2, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_Out_2, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|, ~y$w_buff1~0=v_~y$w_buff1~0_Out_2, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_Out_2, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_Out_2, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$w_buff1_used~0] and [417] $Ultimate##0-->L739: Formula: (and (= v_~y~0_237 2) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_237, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-05 23:08:05,954 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [349] L759-->L770: Formula: (and (= v_~y$r_buff0_thd0~0_In_1 v_~y$r_buff1_thd0~0_Out_2) (= v_~y$w_buff0_used~0_Out_2 1) (= v_~y$r_buff0_thd2~0_In_1 v_~y$r_buff1_thd2~0_Out_2) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0)) (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 1 0)) (= v_~y$w_buff0_used~0_In_1 v_~y$w_buff1_used~0_Out_2) (= 1 v_~y$r_buff0_thd2~0_Out_2) (= v_~y$w_buff1~0_Out_2 v_~y$w_buff0~0_In_1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| 0)) (= v_~y$w_buff0~0_Out_2 1) (= v_~y$r_buff1_thd1~0_Out_2 v_~y$r_buff0_thd1~0_In_1)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_1, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_Out_2, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_Out_2, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|, ~y$w_buff1~0=v_~y$w_buff1~0_Out_2, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_Out_2, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_Out_2, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$w_buff1_used~0] and [426] L832-->L840: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd0~0_124 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_291 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_126 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_292 256) 0)) .cse5)) (.cse0 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_286 256) 0)) .cse4))) (and (= v_~y$r_buff0_thd0~0_125 (ite .cse0 0 v_~y$r_buff0_thd0~0_126)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_21| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|) (= (mod v_~main$tmp_guard0~0_32 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|) (= v_~y~0_257 (ite .cse1 v_~y$w_buff0~0_192 (ite .cse2 v_~y$w_buff1~0_168 v_~y~0_258))) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd0~0_125 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_285 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_124) v_~y$r_buff1_thd0~0_123) (= (ite .cse1 0 v_~y$w_buff0_used~0_292) v_~y$w_buff0_used~0_291) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_21| 0)) (= (ite (or .cse0 .cse2) 0 v_~y$w_buff1_used~0_286) v_~y$w_buff1_used~0_285)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_292, ~y$w_buff1~0=v_~y$w_buff1~0_168, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_126, ~y$w_buff0~0=v_~y$w_buff0~0_192, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, ~y~0=v_~y~0_258, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_124, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_286} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_291, ~y$w_buff1~0=v_~y$w_buff1~0_168, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_192, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, ~y~0=v_~y~0_257, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_123, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_285, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-05 23:08:06,207 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:08:06,209 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 901 [2022-12-05 23:08:06,209 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 212 flow [2022-12-05 23:08:06,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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-12-05 23:08:06,209 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:06,209 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:06,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:08:06,210 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:06,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:06,210 INFO L85 PathProgramCache]: Analyzing trace with hash 940563462, now seen corresponding path program 2 times [2022-12-05 23:08:06,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:06,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656556151] [2022-12-05 23:08:06,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:06,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:06,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:08:06,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:06,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656556151] [2022-12-05 23:08:06,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656556151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:06,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:06,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:08:06,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62867138] [2022-12-05 23:08:06,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:06,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:08:06,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:06,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:08:06,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:08:06,800 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-05 23:08:06,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 212 flow. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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-12-05 23:08:06,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:06,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-05 23:08:06,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:06,952 INFO L130 PetriNetUnfolder]: 197/362 cut-off events. [2022-12-05 23:08:06,952 INFO L131 PetriNetUnfolder]: For 589/589 co-relation queries the response was YES. [2022-12-05 23:08:06,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 362 events. 197/362 cut-off events. For 589/589 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1401 event pairs, 45 based on Foata normal form. 1/362 useless extension candidates. Maximal degree in co-relation 1309. Up to 335 conditions per place. [2022-12-05 23:08:06,955 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 32 selfloop transitions, 17 changer transitions 0/50 dead transitions. [2022-12-05 23:08:06,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 393 flow [2022-12-05 23:08:06,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:08:06,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:08:06,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-12-05 23:08:06,957 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3263888888888889 [2022-12-05 23:08:06,957 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 212 flow. Second operand 6 states and 47 transitions. [2022-12-05 23:08:06,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 393 flow [2022-12-05 23:08:06,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 379 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-05 23:08:06,960 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 338 flow [2022-12-05 23:08:06,960 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=338, PETRI_PLACES=45, PETRI_TRANSITIONS=44} [2022-12-05 23:08:06,961 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 17 predicate places. [2022-12-05 23:08:06,961 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:06,961 INFO L89 Accepts]: Start accepts. Operand has 45 places, 44 transitions, 338 flow [2022-12-05 23:08:06,962 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:06,962 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:06,962 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 44 transitions, 338 flow [2022-12-05 23:08:06,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 44 transitions, 338 flow [2022-12-05 23:08:06,985 INFO L130 PetriNetUnfolder]: 60/147 cut-off events. [2022-12-05 23:08:06,985 INFO L131 PetriNetUnfolder]: For 319/323 co-relation queries the response was YES. [2022-12-05 23:08:06,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 147 events. 60/147 cut-off events. For 319/323 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 618 event pairs, 7 based on Foata normal form. 1/145 useless extension candidates. Maximal degree in co-relation 556. Up to 78 conditions per place. [2022-12-05 23:08:06,987 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 44 transitions, 338 flow [2022-12-05 23:08:06,987 INFO L188 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-05 23:08:07,286 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [349] L759-->L770: Formula: (and (= v_~y$r_buff0_thd0~0_In_1 v_~y$r_buff1_thd0~0_Out_2) (= v_~y$w_buff0_used~0_Out_2 1) (= v_~y$r_buff0_thd2~0_In_1 v_~y$r_buff1_thd2~0_Out_2) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0)) (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 1 0)) (= v_~y$w_buff0_used~0_In_1 v_~y$w_buff1_used~0_Out_2) (= 1 v_~y$r_buff0_thd2~0_Out_2) (= v_~y$w_buff1~0_Out_2 v_~y$w_buff0~0_In_1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| 0)) (= v_~y$w_buff0~0_Out_2 1) (= v_~y$r_buff1_thd1~0_Out_2 v_~y$r_buff0_thd1~0_In_1)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_1, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_Out_2, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_Out_2, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|, ~y$w_buff1~0=v_~y$w_buff1~0_Out_2, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_Out_2, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_Out_2, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$w_buff1_used~0] and [417] $Ultimate##0-->L739: Formula: (and (= v_~y~0_237 2) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_237, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-05 23:08:07,410 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L786-->L802: Formula: (let ((.cse10 (= (mod v_~y$r_buff1_thd2~0_100 256) 0)) (.cse4 (= (mod v_~y$r_buff0_thd2~0_107 256) 0))) (let ((.cse5 (not .cse4)) (.cse11 (= (mod v_~y$w_buff0_used~0_182 256) 0)) (.cse2 (and .cse4 .cse10)) (.cse6 (and (= (mod v_~y$w_buff1_used~0_181 256) 0) .cse4))) (let ((.cse3 (= (mod v_~y$w_buff1_used~0_180 256) 0)) (.cse1 (= (mod v_~y$w_buff0_used~0_181 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_88 256) 0))) (.cse7 (or .cse11 .cse2 .cse6)) (.cse8 (and (not .cse11) .cse5))) (and (= (ite .cse0 v_~y$r_buff0_thd2~0_107 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~y$r_buff0_thd2~0_107 (ite (and (not .cse1) .cse5) 0 v_~y$r_buff0_thd2~0_107))) v_~y$r_buff0_thd2~0_106) (= v_~y$w_buff1_used~0_180 (ite .cse0 v_~y$w_buff1_used~0_181 (ite (or .cse1 .cse2 .cse6) v_~y$w_buff1_used~0_181 0))) (= v_~y$w_buff0_used~0_181 (ite .cse0 v_~y$w_buff0_used~0_182 (ite .cse7 v_~y$w_buff0_used~0_182 (ite .cse8 0 v_~y$w_buff0_used~0_182)))) (= (ite .cse0 v_~y$r_buff1_thd2~0_100 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd2~0_106 256) 0))) (or (and .cse9 .cse3) .cse1 (and .cse9 .cse10))) v_~y$r_buff1_thd2~0_100 0)) v_~y$r_buff1_thd2~0_99) (= v_~y$w_buff0~0_99 v_~y$w_buff0~0_98) (= v_~y$w_buff1~0_90 v_~y$w_buff1~0_89) (= |v_P1Thread1of1ForFork1_#t~nondet6#1_1| v_~weak$$choice2~0_88) (= v_~y~0_163 (ite .cse0 v_~y$mem_tmp~0_62 v_~__unbuffered_p1_EBX~0_18)) (= 0 v_~y$flush_delayed~0_75) (= v_~__unbuffered_p1_EBX~0_18 (ite .cse7 v_~y~0_165 (ite .cse8 v_~y$w_buff0~0_99 v_~y$w_buff1~0_90))) (= v_~y~0_165 v_~y$mem_tmp~0_62) (= |v_P1Thread1of1ForFork1_#t~nondet5#1_1| v_~weak$$choice0~0_21))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_100, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_182, ~y$w_buff1~0=v_~y$w_buff1~0_90, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_1|, ~y$w_buff0~0=v_~y$w_buff0~0_99, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_1|, ~y~0=v_~y~0_165, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_181} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_181, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_99, ~weak$$choice0~0=v_~weak$$choice0~0_21, ~y$mem_tmp~0=v_~y$mem_tmp~0_62, ~y$w_buff1~0=v_~y$w_buff1~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_98, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_106, ~y$flush_delayed~0=v_~y$flush_delayed~0_75, ~y~0=v_~y~0_163, ~weak$$choice2~0=v_~weak$$choice2~0_88, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_180} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet5#1, P1Thread1of1ForFork1_#t~nondet6#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] and [426] L832-->L840: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd0~0_124 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_291 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_126 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_292 256) 0)) .cse5)) (.cse0 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_286 256) 0)) .cse4))) (and (= v_~y$r_buff0_thd0~0_125 (ite .cse0 0 v_~y$r_buff0_thd0~0_126)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_21| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|) (= (mod v_~main$tmp_guard0~0_32 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|) (= v_~y~0_257 (ite .cse1 v_~y$w_buff0~0_192 (ite .cse2 v_~y$w_buff1~0_168 v_~y~0_258))) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd0~0_125 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_285 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_124) v_~y$r_buff1_thd0~0_123) (= (ite .cse1 0 v_~y$w_buff0_used~0_292) v_~y$w_buff0_used~0_291) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_21| 0)) (= (ite (or .cse0 .cse2) 0 v_~y$w_buff1_used~0_286) v_~y$w_buff1_used~0_285)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_292, ~y$w_buff1~0=v_~y$w_buff1~0_168, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_126, ~y$w_buff0~0=v_~y$w_buff0~0_192, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, ~y~0=v_~y~0_258, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_124, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_286} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_291, ~y$w_buff1~0=v_~y$w_buff1~0_168, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_192, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, ~y~0=v_~y~0_257, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_123, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_285, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-05 23:08:08,031 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L786-->L802: Formula: (let ((.cse10 (= (mod v_~y$r_buff1_thd2~0_100 256) 0)) (.cse4 (= (mod v_~y$r_buff0_thd2~0_107 256) 0))) (let ((.cse5 (not .cse4)) (.cse11 (= (mod v_~y$w_buff0_used~0_182 256) 0)) (.cse2 (and .cse4 .cse10)) (.cse6 (and (= (mod v_~y$w_buff1_used~0_181 256) 0) .cse4))) (let ((.cse3 (= (mod v_~y$w_buff1_used~0_180 256) 0)) (.cse1 (= (mod v_~y$w_buff0_used~0_181 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_88 256) 0))) (.cse7 (or .cse11 .cse2 .cse6)) (.cse8 (and (not .cse11) .cse5))) (and (= (ite .cse0 v_~y$r_buff0_thd2~0_107 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~y$r_buff0_thd2~0_107 (ite (and (not .cse1) .cse5) 0 v_~y$r_buff0_thd2~0_107))) v_~y$r_buff0_thd2~0_106) (= v_~y$w_buff1_used~0_180 (ite .cse0 v_~y$w_buff1_used~0_181 (ite (or .cse1 .cse2 .cse6) v_~y$w_buff1_used~0_181 0))) (= v_~y$w_buff0_used~0_181 (ite .cse0 v_~y$w_buff0_used~0_182 (ite .cse7 v_~y$w_buff0_used~0_182 (ite .cse8 0 v_~y$w_buff0_used~0_182)))) (= (ite .cse0 v_~y$r_buff1_thd2~0_100 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd2~0_106 256) 0))) (or (and .cse9 .cse3) .cse1 (and .cse9 .cse10))) v_~y$r_buff1_thd2~0_100 0)) v_~y$r_buff1_thd2~0_99) (= v_~y$w_buff0~0_99 v_~y$w_buff0~0_98) (= v_~y$w_buff1~0_90 v_~y$w_buff1~0_89) (= |v_P1Thread1of1ForFork1_#t~nondet6#1_1| v_~weak$$choice2~0_88) (= v_~y~0_163 (ite .cse0 v_~y$mem_tmp~0_62 v_~__unbuffered_p1_EBX~0_18)) (= 0 v_~y$flush_delayed~0_75) (= v_~__unbuffered_p1_EBX~0_18 (ite .cse7 v_~y~0_165 (ite .cse8 v_~y$w_buff0~0_99 v_~y$w_buff1~0_90))) (= v_~y~0_165 v_~y$mem_tmp~0_62) (= |v_P1Thread1of1ForFork1_#t~nondet5#1_1| v_~weak$$choice0~0_21))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_100, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_182, ~y$w_buff1~0=v_~y$w_buff1~0_90, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_1|, ~y$w_buff0~0=v_~y$w_buff0~0_99, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_1|, ~y~0=v_~y~0_165, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_181} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_181, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_99, ~weak$$choice0~0=v_~weak$$choice0~0_21, ~y$mem_tmp~0=v_~y$mem_tmp~0_62, ~y$w_buff1~0=v_~y$w_buff1~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_98, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_106, ~y$flush_delayed~0=v_~y$flush_delayed~0_75, ~y~0=v_~y~0_163, ~weak$$choice2~0=v_~weak$$choice2~0_88, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_180} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet5#1, P1Thread1of1ForFork1_#t~nondet6#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] and [417] $Ultimate##0-->L739: Formula: (and (= v_~y~0_237 2) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_237, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-05 23:08:08,174 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L786-->L802: Formula: (let ((.cse10 (= (mod v_~y$r_buff1_thd2~0_100 256) 0)) (.cse4 (= (mod v_~y$r_buff0_thd2~0_107 256) 0))) (let ((.cse5 (not .cse4)) (.cse11 (= (mod v_~y$w_buff0_used~0_182 256) 0)) (.cse2 (and .cse4 .cse10)) (.cse6 (and (= (mod v_~y$w_buff1_used~0_181 256) 0) .cse4))) (let ((.cse3 (= (mod v_~y$w_buff1_used~0_180 256) 0)) (.cse1 (= (mod v_~y$w_buff0_used~0_181 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_88 256) 0))) (.cse7 (or .cse11 .cse2 .cse6)) (.cse8 (and (not .cse11) .cse5))) (and (= (ite .cse0 v_~y$r_buff0_thd2~0_107 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~y$r_buff0_thd2~0_107 (ite (and (not .cse1) .cse5) 0 v_~y$r_buff0_thd2~0_107))) v_~y$r_buff0_thd2~0_106) (= v_~y$w_buff1_used~0_180 (ite .cse0 v_~y$w_buff1_used~0_181 (ite (or .cse1 .cse2 .cse6) v_~y$w_buff1_used~0_181 0))) (= v_~y$w_buff0_used~0_181 (ite .cse0 v_~y$w_buff0_used~0_182 (ite .cse7 v_~y$w_buff0_used~0_182 (ite .cse8 0 v_~y$w_buff0_used~0_182)))) (= (ite .cse0 v_~y$r_buff1_thd2~0_100 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd2~0_106 256) 0))) (or (and .cse9 .cse3) .cse1 (and .cse9 .cse10))) v_~y$r_buff1_thd2~0_100 0)) v_~y$r_buff1_thd2~0_99) (= v_~y$w_buff0~0_99 v_~y$w_buff0~0_98) (= v_~y$w_buff1~0_90 v_~y$w_buff1~0_89) (= |v_P1Thread1of1ForFork1_#t~nondet6#1_1| v_~weak$$choice2~0_88) (= v_~y~0_163 (ite .cse0 v_~y$mem_tmp~0_62 v_~__unbuffered_p1_EBX~0_18)) (= 0 v_~y$flush_delayed~0_75) (= v_~__unbuffered_p1_EBX~0_18 (ite .cse7 v_~y~0_165 (ite .cse8 v_~y$w_buff0~0_99 v_~y$w_buff1~0_90))) (= v_~y~0_165 v_~y$mem_tmp~0_62) (= |v_P1Thread1of1ForFork1_#t~nondet5#1_1| v_~weak$$choice0~0_21))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_100, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_182, ~y$w_buff1~0=v_~y$w_buff1~0_90, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_1|, ~y$w_buff0~0=v_~y$w_buff0~0_99, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_1|, ~y~0=v_~y~0_165, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_181} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_181, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_99, ~weak$$choice0~0=v_~weak$$choice0~0_21, ~y$mem_tmp~0=v_~y$mem_tmp~0_62, ~y$w_buff1~0=v_~y$w_buff1~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_98, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_106, ~y$flush_delayed~0=v_~y$flush_delayed~0_75, ~y~0=v_~y~0_163, ~weak$$choice2~0=v_~weak$$choice2~0_88, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_180} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet5#1, P1Thread1of1ForFork1_#t~nondet6#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] and [417] $Ultimate##0-->L739: Formula: (and (= v_~y~0_237 2) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_237, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-05 23:08:08,352 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:08:08,353 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1392 [2022-12-05 23:08:08,353 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 359 flow [2022-12-05 23:08:08,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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-12-05 23:08:08,353 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:08,353 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:08,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:08:08,354 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:08,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:08,354 INFO L85 PathProgramCache]: Analyzing trace with hash 963903269, now seen corresponding path program 1 times [2022-12-05 23:08:08,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:08,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27528987] [2022-12-05 23:08:08,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:08,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:08:08,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:08,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27528987] [2022-12-05 23:08:08,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27528987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:08,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:08,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:08:08,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352179537] [2022-12-05 23:08:08,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:08,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:08:08,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:08,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:08:08,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:08:08,563 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-05 23:08:08,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 359 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-12-05 23:08:08,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:08,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-05 23:08:08,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:08,683 INFO L130 PetriNetUnfolder]: 115/244 cut-off events. [2022-12-05 23:08:08,683 INFO L131 PetriNetUnfolder]: For 821/821 co-relation queries the response was YES. [2022-12-05 23:08:08,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 244 events. 115/244 cut-off events. For 821/821 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 976 event pairs, 30 based on Foata normal form. 45/288 useless extension candidates. Maximal degree in co-relation 931. Up to 109 conditions per place. [2022-12-05 23:08:08,685 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 52 selfloop transitions, 4 changer transitions 1/58 dead transitions. [2022-12-05 23:08:08,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 58 transitions, 499 flow [2022-12-05 23:08:08,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:08:08,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:08:08,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-05 23:08:08,687 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-05 23:08:08,687 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 359 flow. Second operand 4 states and 57 transitions. [2022-12-05 23:08:08,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 58 transitions, 499 flow [2022-12-05 23:08:08,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 453 flow, removed 15 selfloop flow, removed 5 redundant places. [2022-12-05 23:08:08,691 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 239 flow [2022-12-05 23:08:08,691 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=239, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2022-12-05 23:08:08,693 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 15 predicate places. [2022-12-05 23:08:08,693 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:08,694 INFO L89 Accepts]: Start accepts. Operand has 43 places, 33 transitions, 239 flow [2022-12-05 23:08:08,694 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:08,695 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:08,695 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 33 transitions, 239 flow [2022-12-05 23:08:08,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 33 transitions, 239 flow [2022-12-05 23:08:08,711 INFO L130 PetriNetUnfolder]: 30/98 cut-off events. [2022-12-05 23:08:08,711 INFO L131 PetriNetUnfolder]: For 267/270 co-relation queries the response was YES. [2022-12-05 23:08:08,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 98 events. 30/98 cut-off events. For 267/270 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 364 event pairs, 1 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 381. Up to 41 conditions per place. [2022-12-05 23:08:08,712 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 33 transitions, 239 flow [2022-12-05 23:08:08,712 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-05 23:08:08,713 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [449] L759-->L786: Formula: (let ((.cse2 (= 0 (mod v_~y$w_buff0_used~0_515 256))) (.cse0 (not (= (mod v_~weak$$choice2~0_174 256) 0)))) (and (= v_~weak$$choice2~0_174 |v_P1Thread1of1ForFork1_#t~nondet4#1_34|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_33| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_33|) (= v_~__unbuffered_p1_EAX~0_88 1) (= v_~y$w_buff0_used~0_515 (ite .cse0 1 0)) (= v_~y$r_buff0_thd0~0_236 v_~y$r_buff1_thd0~0_237) (= v_~y$r_buff1_thd2~0_253 (ite .cse0 v_~y$r_buff0_thd2~0_288 (ite (let ((.cse1 (= (mod v_~y$r_buff0_thd2~0_286 256) 0))) (or (and (= 0 (mod v_~y$r_buff0_thd2~0_288 256)) .cse1) (and (= (mod v_~y$w_buff1_used~0_497 256) 0) .cse1) .cse2)) v_~y$r_buff0_thd2~0_288 0))) (= v_~y$w_buff0~0_354 1) (= v_~y$flush_delayed~0_157 0) (= v_~y$r_buff0_thd2~0_286 (ite .cse0 1 (ite .cse2 1 (ite (not .cse2) 0 1)))) (= v_~y$w_buff1~0_318 v_~y$w_buff0~0_356) (= v_~weak$$choice0~0_109 |v_P1Thread1of1ForFork1_#t~nondet3#1_34|) (= (ite .cse0 v_~y$w_buff0_used~0_517 (ite .cse2 v_~y$w_buff0_used~0_517 0)) v_~y$w_buff1_used~0_497) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_33| (ite (= (mod v_~y$w_buff0_used~0_517 256) 0) 1 0)) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_33| 0)) (= v_~y$r_buff0_thd1~0_95 v_~y$r_buff1_thd1~0_98) (= v_~y~0_478 (ite .cse0 v_~y$mem_tmp~0_142 1)) (= v_~y~0_479 v_~y$mem_tmp~0_142))) InVars {P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_34|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_517, ~y$w_buff0~0=v_~y$w_buff0~0_356, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_34|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_236, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_288, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_95, ~y~0=v_~y~0_479} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_515, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_33|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_253, ~weak$$choice0~0=v_~weak$$choice0~0_109, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_98, ~y$mem_tmp~0=v_~y$mem_tmp~0_142, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_88, ~y$w_buff1~0=v_~y$w_buff1~0_318, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_33|, ~y$w_buff0~0=v_~y$w_buff0~0_354, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_236, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_286, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_95, ~y$flush_delayed~0=v_~y$flush_delayed~0_157, ~y~0=v_~y~0_478, ~weak$$choice2~0=v_~weak$$choice2~0_174, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_237, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_497} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet3#1, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, P1Thread1of1ForFork1_#t~nondet4#1, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [417] $Ultimate##0-->L739: Formula: (and (= v_~y~0_237 2) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_237, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] Received shutdown request... [2022-12-05 23:22:19,440 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-05 23:22:19,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:22:19,441 WARN L619 AbstractCegarLoop]: Verification canceled: while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2022-12-05 23:22:19,442 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-05 23:22:19,442 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-05 23:22:19,443 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-05 23:22:19,443 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-05 23:22:19,443 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-12-05 23:22:19,447 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:22:19,448 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:22:19,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:22:19 BasicIcfg [2022-12-05 23:22:19,450 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:22:19,450 INFO L158 Benchmark]: Toolchain (without parser) took 864150.55ms. Allocated memory was 186.6MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 161.7MB in the beginning and 6.3GB in the end (delta: -6.1GB). Peak memory consumption was 5.6GB. Max. memory is 8.0GB. [2022-12-05 23:22:19,451 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 127.9MB. Free memory was 104.6MB in the beginning and 104.5MB in the end (delta: 82.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:22:19,451 INFO L158 Benchmark]: CACSL2BoogieTranslator took 557.58ms. Allocated memory is still 186.6MB. Free memory was 161.7MB in the beginning and 134.0MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-05 23:22:19,451 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.41ms. Allocated memory is still 186.6MB. Free memory was 134.0MB in the beginning and 130.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-12-05 23:22:19,451 INFO L158 Benchmark]: Boogie Preprocessor took 42.65ms. Allocated memory is still 186.6MB. Free memory was 130.3MB in the beginning and 128.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 23:22:19,452 INFO L158 Benchmark]: RCFGBuilder took 850.52ms. Allocated memory is still 186.6MB. Free memory was 128.2MB in the beginning and 132.5MB in the end (delta: -4.3MB). Peak memory consumption was 18.2MB. Max. memory is 8.0GB. [2022-12-05 23:22:19,452 INFO L158 Benchmark]: TraceAbstraction took 862618.84ms. Allocated memory was 186.6MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 131.5MB in the beginning and 6.3GB in the end (delta: -6.1GB). Peak memory consumption was 5.5GB. Max. memory is 8.0GB. [2022-12-05 23:22:19,453 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 127.9MB. Free memory was 104.6MB in the beginning and 104.5MB in the end (delta: 82.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 557.58ms. Allocated memory is still 186.6MB. Free memory was 161.7MB in the beginning and 134.0MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 74.41ms. Allocated memory is still 186.6MB. Free memory was 134.0MB in the beginning and 130.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.65ms. Allocated memory is still 186.6MB. Free memory was 130.3MB in the beginning and 128.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 850.52ms. Allocated memory is still 186.6MB. Free memory was 128.2MB in the beginning and 132.5MB in the end (delta: -4.3MB). Peak memory consumption was 18.2MB. Max. memory is 8.0GB. * TraceAbstraction took 862618.84ms. Allocated memory was 186.6MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 131.5MB in the beginning and 6.3GB in the end (delta: -6.1GB). Peak memory consumption was 5.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 93 PlacesBefore, 28 PlacesAfterwards, 88 TransitionsBefore, 22 TransitionsAfterwards, 1156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 35 TrivialYvCompositions, 32 ConcurrentYvCompositions, 1 ChoiceCompositions, 69 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 987, independent: 935, independent conditional: 935, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 987, independent: 935, independent conditional: 0, independent unconditional: 935, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 987, independent: 935, independent conditional: 0, independent unconditional: 935, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 987, independent: 935, independent conditional: 0, independent unconditional: 935, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 711, independent: 676, independent conditional: 0, independent unconditional: 676, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 711, independent: 667, independent conditional: 0, independent unconditional: 667, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 44, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 290, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 278, dependent conditional: 0, dependent unconditional: 278, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 987, independent: 259, independent conditional: 0, independent unconditional: 259, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 711, unknown conditional: 0, unknown unconditional: 711] , Statistics on independence cache: Total cache size (in pairs): 1108, Positive cache size: 1073, Positive conditional cache size: 0, Positive unconditional cache size: 1073, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 24 PlacesBefore, 24 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 58, independent: 38, independent conditional: 7, independent unconditional: 31, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 58, independent: 38, independent conditional: 7, independent unconditional: 31, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 58, independent: 38, independent conditional: 7, independent unconditional: 31, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 50, independent: 35, independent conditional: 6, independent unconditional: 29, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 50, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 53, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 52, dependent conditional: 9, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 58, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 50, unknown conditional: 8, unknown unconditional: 42] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 35, Positive conditional cache size: 6, Positive unconditional cache size: 29, Negative cache size: 15, Negative conditional cache size: 2, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 28 PlacesBefore, 27 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 81, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 81, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 81, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 81, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 81, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 58, Positive conditional cache size: 6, Positive unconditional cache size: 52, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 116 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 69, independent: 51, independent conditional: 51, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 69, independent: 51, independent conditional: 4, independent unconditional: 47, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 69, independent: 51, independent conditional: 4, independent unconditional: 47, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 69, independent: 51, independent conditional: 4, independent unconditional: 47, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 69, independent: 51, independent conditional: 4, independent unconditional: 47, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 58, Positive conditional cache size: 6, Positive unconditional cache size: 52, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 37 PlacesBefore, 36 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, independent: 143, independent conditional: 143, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 173, independent: 143, independent conditional: 59, independent unconditional: 84, dependent: 30, dependent conditional: 4, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 173, independent: 143, independent conditional: 27, independent unconditional: 116, dependent: 30, dependent conditional: 4, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 173, independent: 143, independent conditional: 27, independent unconditional: 116, dependent: 30, dependent conditional: 4, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 173, independent: 140, independent conditional: 26, independent unconditional: 114, dependent: 29, dependent conditional: 3, dependent unconditional: 26, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 63, Positive conditional cache size: 7, Positive unconditional cache size: 56, Negative cache size: 18, Negative conditional cache size: 3, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 45 PlacesBefore, 43 PlacesAfterwards, 44 TransitionsBefore, 42 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 170, independent: 134, independent conditional: 134, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 170, independent: 134, independent conditional: 60, independent unconditional: 74, dependent: 36, dependent conditional: 2, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 170, independent: 134, independent conditional: 34, independent unconditional: 100, dependent: 36, dependent conditional: 2, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 170, independent: 134, independent conditional: 34, independent unconditional: 100, dependent: 36, dependent conditional: 2, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 170, independent: 132, independent conditional: 32, independent unconditional: 100, dependent: 35, dependent conditional: 1, dependent unconditional: 34, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 68, Positive conditional cache size: 9, Positive unconditional cache size: 59, Negative cache size: 19, Negative conditional cache size: 4, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 829]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 827]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances [2022-12-05 23:22:19,474 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end CFG has 5 procedures, 110 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 862.5s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 100 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 379 IncrementalHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 2 mSDtfsCounter, 379 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=359occurred in iteration=5, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 612 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown