/usr/bin/java -Xmx16000000000 -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-NoLbe-After.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix046.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 11:14:20,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 11:14:20,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 11:14:20,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 11:14:20,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 11:14:20,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 11:14:20,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 11:14:20,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 11:14:20,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 11:14:20,719 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 11:14:20,720 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 11:14:20,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 11:14:20,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 11:14:20,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 11:14:20,729 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 11:14:20,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 11:14:20,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 11:14:20,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 11:14:20,735 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 11:14:20,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 11:14:20,745 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 11:14:20,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 11:14:20,747 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 11:14:20,748 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 11:14:20,751 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 11:14:20,751 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 11:14:20,751 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 11:14:20,752 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 11:14:20,753 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 11:14:20,753 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 11:14:20,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 11:14:20,754 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 11:14:20,755 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 11:14:20,755 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 11:14:20,756 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 11:14:20,756 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 11:14:20,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 11:14:20,757 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 11:14:20,757 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 11:14:20,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 11:14:20,758 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 11:14:20,759 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-NoLbe-After.epf [2022-01-19 11:14:20,786 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 11:14:20,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 11:14:20,787 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 11:14:20,787 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 11:14:20,787 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 11:14:20,787 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 11:14:20,787 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 11:14:20,788 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 11:14:20,788 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 11:14:20,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 11:14:20,788 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 11:14:20,788 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 11:14:20,788 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 11:14:20,788 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 11:14:20,789 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 11:14:20,789 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 11:14:20,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 11:14:20,789 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 11:14:20,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 11:14:20,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 11:14:20,789 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 11:14:20,789 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 11:14:20,789 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 11:14:20,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 11:14:20,789 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 11:14:20,789 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 11:14:20,790 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 11:14:20,790 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 11:14:20,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 11:14:20,791 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 11:14:20,791 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 11:14:20,791 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 11:14:20,791 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-01-19 11:14:20,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 11:14:21,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 11:14:21,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 11:14:21,002 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 11:14:21,003 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 11:14:21,004 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046.opt.i [2022-01-19 11:14:21,047 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d1e942ab/2efa4f7db9c74675887bb56c1c60f118/FLAG57f540874 [2022-01-19 11:14:21,425 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 11:14:21,425 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046.opt.i [2022-01-19 11:14:21,444 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d1e942ab/2efa4f7db9c74675887bb56c1c60f118/FLAG57f540874 [2022-01-19 11:14:21,786 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d1e942ab/2efa4f7db9c74675887bb56c1c60f118 [2022-01-19 11:14:21,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 11:14:21,789 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 11:14:21,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 11:14:21,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 11:14:21,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 11:14:21,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 11:14:21" (1/1) ... [2022-01-19 11:14:21,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@342d277c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:14:21, skipping insertion in model container [2022-01-19 11:14:21,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 11:14:21" (1/1) ... [2022-01-19 11:14:21,807 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 11:14:21,839 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 11:14:21,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046.opt.i[944,957] [2022-01-19 11:14:22,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 11:14:22,049 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 11:14:22,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046.opt.i[944,957] [2022-01-19 11:14:22,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 11:14:22,126 INFO L208 MainTranslator]: Completed translation [2022-01-19 11:14:22,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:14:22 WrapperNode [2022-01-19 11:14:22,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 11:14:22,127 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 11:14:22,127 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 11:14:22,127 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 11:14:22,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:14:22" (1/1) ... [2022-01-19 11:14:22,143 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:14:22" (1/1) ... [2022-01-19 11:14:22,162 INFO L137 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 298 [2022-01-19 11:14:22,163 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 11:14:22,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 11:14:22,163 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 11:14:22,163 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 11:14:22,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:14:22" (1/1) ... [2022-01-19 11:14:22,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:14:22" (1/1) ... [2022-01-19 11:14:22,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:14:22" (1/1) ... [2022-01-19 11:14:22,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:14:22" (1/1) ... [2022-01-19 11:14:22,178 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:14:22" (1/1) ... [2022-01-19 11:14:22,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:14:22" (1/1) ... [2022-01-19 11:14:22,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:14:22" (1/1) ... [2022-01-19 11:14:22,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 11:14:22,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 11:14:22,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 11:14:22,185 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 11:14:22,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:14:22" (1/1) ... [2022-01-19 11:14:22,191 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 11:14:22,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 11:14:22,218 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-01-19 11:14:22,247 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-01-19 11:14:22,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 11:14:22,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 11:14:22,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 11:14:22,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 11:14:22,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 11:14:22,251 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-19 11:14:22,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-19 11:14:22,252 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-19 11:14:22,252 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-19 11:14:22,253 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-19 11:14:22,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-19 11:14:22,253 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-01-19 11:14:22,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-01-19 11:14:22,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 11:14:22,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 11:14:22,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 11:14:22,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 11:14:22,255 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 11:14:22,404 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 11:14:22,406 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 11:14:22,800 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 11:14:23,007 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 11:14:23,008 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 11:14:23,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 11:14:23 BoogieIcfgContainer [2022-01-19 11:14:23,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 11:14:23,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 11:14:23,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 11:14:23,012 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 11:14:23,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 11:14:21" (1/3) ... [2022-01-19 11:14:23,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723ba803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 11:14:23, skipping insertion in model container [2022-01-19 11:14:23,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:14:22" (2/3) ... [2022-01-19 11:14:23,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723ba803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 11:14:23, skipping insertion in model container [2022-01-19 11:14:23,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 11:14:23" (3/3) ... [2022-01-19 11:14:23,015 INFO L111 eAbstractionObserver]: Analyzing ICFG mix046.opt.i [2022-01-19 11:14:23,018 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 11:14:23,018 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 11:14:23,018 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 11:14:23,062 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,062 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,062 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,063 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,063 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,063 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,063 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,063 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,063 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,063 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,063 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,064 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,064 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,064 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,065 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,065 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,065 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,065 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,065 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,065 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,065 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,066 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,066 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,066 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,066 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,066 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,067 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,067 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,067 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,067 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,067 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,067 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,068 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,068 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,068 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,068 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,068 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,068 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,068 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,068 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,068 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,069 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,069 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,069 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,069 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,069 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,069 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,069 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,070 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,070 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,070 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,070 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,070 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,070 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,070 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,070 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,070 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,071 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,071 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,071 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,071 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,071 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,071 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,071 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,071 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,071 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,072 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,072 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,072 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,072 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,072 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,072 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,072 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,073 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,073 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,073 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,073 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,073 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,073 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,073 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,074 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,074 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,074 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,074 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,076 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,076 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,077 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,077 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,078 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,080 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,083 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,083 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,083 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,083 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,084 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,084 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,084 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,084 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,084 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,084 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,085 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,085 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,085 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,085 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,085 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,085 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,086 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,086 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,086 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,086 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,086 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,086 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,086 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,086 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:14:23,086 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 11:14:23,129 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 11:14:23,140 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 11:14:23,141 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-19 11:14:23,151 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-01-19 11:14:23,199 INFO L129 PetriNetUnfolder]: 2/133 cut-off events. [2022-01-19 11:14:23,199 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 11:14:23,202 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-01-19 11:14:23,202 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2022-01-19 11:14:23,208 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2022-01-19 11:14:23,231 INFO L129 PetriNetUnfolder]: 0/91 cut-off events. [2022-01-19 11:14:23,231 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 11:14:23,232 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:14:23,232 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:14:23,233 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:14:23,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:14:23,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1364924999, now seen corresponding path program 1 times [2022-01-19 11:14:23,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:14:23,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906878333] [2022-01-19 11:14:23,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:14:23,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:14:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:14:23,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:14:23,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:14:23,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906878333] [2022-01-19 11:14:23,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906878333] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:14:23,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:14:23,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 11:14:23,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708219007] [2022-01-19 11:14:23,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:14:23,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 11:14:23,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:14:23,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 11:14:23,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 11:14:23,514 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 137 [2022-01-19 11:14:23,528 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 133 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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-01-19 11:14:23,528 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:14:23,528 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 137 [2022-01-19 11:14:23,529 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:14:23,635 INFO L129 PetriNetUnfolder]: 17/277 cut-off events. [2022-01-19 11:14:23,636 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-01-19 11:14:23,638 INFO L84 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 277 events. 17/277 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 830 event pairs, 7 based on Foata normal form. 9/275 useless extension candidates. Maximal degree in co-relation 275. Up to 27 conditions per place. [2022-01-19 11:14:23,641 INFO L132 encePairwiseOnDemand]: 132/137 looper letters, 11 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2022-01-19 11:14:23,641 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 132 transitions, 302 flow [2022-01-19 11:14:23,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 11:14:23,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 11:14:23,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2022-01-19 11:14:23,655 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9416058394160584 [2022-01-19 11:14:23,656 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2022-01-19 11:14:23,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2022-01-19 11:14:23,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:14:23,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2022-01-19 11:14:23,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 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-01-19 11:14:23,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 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-01-19 11:14:23,672 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 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-01-19 11:14:23,674 INFO L186 Difference]: Start difference. First operand has 144 places, 133 transitions, 278 flow. Second operand 3 states and 387 transitions. [2022-01-19 11:14:23,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 132 transitions, 302 flow [2022-01-19 11:14:23,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 132 transitions, 298 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 11:14:23,679 INFO L242 Difference]: Finished difference. Result has 140 places, 129 transitions, 270 flow [2022-01-19 11:14:23,681 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2022-01-19 11:14:23,684 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, -4 predicate places. [2022-01-19 11:14:23,684 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 270 flow [2022-01-19 11:14:23,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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-01-19 11:14:23,685 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:14:23,685 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:14:23,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 11:14:23,685 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:14:23,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:14:23,686 INFO L85 PathProgramCache]: Analyzing trace with hash -836884992, now seen corresponding path program 1 times [2022-01-19 11:14:23,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:14:23,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850268005] [2022-01-19 11:14:23,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:14:23,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:14:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:14:24,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:14:24,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:14:24,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850268005] [2022-01-19 11:14:24,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850268005] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:14:24,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:14:24,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 11:14:24,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296694912] [2022-01-19 11:14:24,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:14:24,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 11:14:24,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:14:24,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 11:14:24,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-01-19 11:14:24,163 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-01-19 11:14:24,165 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 270 flow. Second operand has 11 states, 11 states have (on average 113.45454545454545) internal successors, (1248), 11 states have internal predecessors, (1248), 0 states have call successors, (0), 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-01-19 11:14:24,165 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:14:24,165 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-01-19 11:14:24,165 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:14:24,486 INFO L129 PetriNetUnfolder]: 119/603 cut-off events. [2022-01-19 11:14:24,486 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-01-19 11:14:24,489 INFO L84 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 603 events. 119/603 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3215 event pairs, 47 based on Foata normal form. 0/587 useless extension candidates. Maximal degree in co-relation 826. Up to 125 conditions per place. [2022-01-19 11:14:24,490 INFO L132 encePairwiseOnDemand]: 125/137 looper letters, 18 selfloop transitions, 9 changer transitions 52/174 dead transitions. [2022-01-19 11:14:24,490 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 174 transitions, 508 flow [2022-01-19 11:14:24,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 11:14:24,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 11:14:24,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1861 transitions. [2022-01-19 11:14:24,494 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8489963503649635 [2022-01-19 11:14:24,494 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1861 transitions. [2022-01-19 11:14:24,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1861 transitions. [2022-01-19 11:14:24,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:14:24,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1861 transitions. [2022-01-19 11:14:24,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 116.3125) internal successors, (1861), 16 states have internal predecessors, (1861), 0 states have call successors, (0), 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-01-19 11:14:24,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 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-01-19 11:14:24,502 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 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-01-19 11:14:24,502 INFO L186 Difference]: Start difference. First operand has 140 places, 129 transitions, 270 flow. Second operand 16 states and 1861 transitions. [2022-01-19 11:14:24,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 174 transitions, 508 flow [2022-01-19 11:14:24,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 174 transitions, 490 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 11:14:24,504 INFO L242 Difference]: Finished difference. Result has 164 places, 119 transitions, 312 flow [2022-01-19 11:14:24,505 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=312, PETRI_PLACES=164, PETRI_TRANSITIONS=119} [2022-01-19 11:14:24,505 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 20 predicate places. [2022-01-19 11:14:24,505 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 119 transitions, 312 flow [2022-01-19 11:14:24,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 113.45454545454545) internal successors, (1248), 11 states have internal predecessors, (1248), 0 states have call successors, (0), 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-01-19 11:14:24,506 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:14:24,506 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:14:24,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 11:14:24,506 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:14:24,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:14:24,507 INFO L85 PathProgramCache]: Analyzing trace with hash 35903013, now seen corresponding path program 1 times [2022-01-19 11:14:24,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:14:24,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904389486] [2022-01-19 11:14:24,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:14:24,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:14:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:14:24,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:14:24,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:14:24,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904389486] [2022-01-19 11:14:24,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904389486] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:14:24,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:14:24,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 11:14:24,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118055536] [2022-01-19 11:14:24,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:14:24,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 11:14:24,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:14:24,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 11:14:24,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 11:14:24,617 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 137 [2022-01-19 11:14:24,618 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 119 transitions, 312 flow. Second operand has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 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-01-19 11:14:24,618 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:14:24,618 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 137 [2022-01-19 11:14:24,618 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:14:24,766 INFO L129 PetriNetUnfolder]: 77/335 cut-off events. [2022-01-19 11:14:24,767 INFO L130 PetriNetUnfolder]: For 466/466 co-relation queries the response was YES. [2022-01-19 11:14:24,768 INFO L84 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 335 events. 77/335 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1192 event pairs, 20 based on Foata normal form. 8/332 useless extension candidates. Maximal degree in co-relation 726. Up to 68 conditions per place. [2022-01-19 11:14:24,769 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 18 selfloop transitions, 2 changer transitions 22/143 dead transitions. [2022-01-19 11:14:24,769 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 143 transitions, 520 flow [2022-01-19 11:14:24,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 11:14:24,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 11:14:24,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1086 transitions. [2022-01-19 11:14:24,771 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8807785888077859 [2022-01-19 11:14:24,771 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1086 transitions. [2022-01-19 11:14:24,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1086 transitions. [2022-01-19 11:14:24,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:14:24,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1086 transitions. [2022-01-19 11:14:24,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.66666666666667) internal successors, (1086), 9 states have internal predecessors, (1086), 0 states have call successors, (0), 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-01-19 11:14:24,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 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-01-19 11:14:24,776 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 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-01-19 11:14:24,776 INFO L186 Difference]: Start difference. First operand has 164 places, 119 transitions, 312 flow. Second operand 9 states and 1086 transitions. [2022-01-19 11:14:24,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 143 transitions, 520 flow [2022-01-19 11:14:24,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 143 transitions, 492 flow, removed 11 selfloop flow, removed 6 redundant places. [2022-01-19 11:14:24,780 INFO L242 Difference]: Finished difference. Result has 150 places, 119 transitions, 318 flow [2022-01-19 11:14:24,781 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=318, PETRI_PLACES=150, PETRI_TRANSITIONS=119} [2022-01-19 11:14:24,781 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 6 predicate places. [2022-01-19 11:14:24,781 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 119 transitions, 318 flow [2022-01-19 11:14:24,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 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-01-19 11:14:24,782 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:14:24,782 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:14:24,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 11:14:24,782 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:14:24,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:14:24,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1949047038, now seen corresponding path program 1 times [2022-01-19 11:14:24,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:14:24,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024689260] [2022-01-19 11:14:24,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:14:24,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:14:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:14:24,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:14:24,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:14:24,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024689260] [2022-01-19 11:14:24,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024689260] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:14:24,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:14:24,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 11:14:24,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776128871] [2022-01-19 11:14:24,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:14:24,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 11:14:24,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:14:24,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 11:14:24,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 11:14:24,902 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 137 [2022-01-19 11:14:24,903 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 119 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 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-01-19 11:14:24,903 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:14:24,903 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 137 [2022-01-19 11:14:24,903 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:14:25,095 INFO L129 PetriNetUnfolder]: 166/527 cut-off events. [2022-01-19 11:14:25,095 INFO L130 PetriNetUnfolder]: For 728/728 co-relation queries the response was YES. [2022-01-19 11:14:25,098 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1291 conditions, 527 events. 166/527 cut-off events. For 728/728 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2544 event pairs, 56 based on Foata normal form. 6/511 useless extension candidates. Maximal degree in co-relation 1215. Up to 234 conditions per place. [2022-01-19 11:14:25,101 INFO L132 encePairwiseOnDemand]: 130/137 looper letters, 23 selfloop transitions, 3 changer transitions 22/148 dead transitions. [2022-01-19 11:14:25,101 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 148 transitions, 521 flow [2022-01-19 11:14:25,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 11:14:25,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 11:14:25,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1083 transitions. [2022-01-19 11:14:25,104 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.878345498783455 [2022-01-19 11:14:25,104 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1083 transitions. [2022-01-19 11:14:25,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1083 transitions. [2022-01-19 11:14:25,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:14:25,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1083 transitions. [2022-01-19 11:14:25,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.33333333333333) internal successors, (1083), 9 states have internal predecessors, (1083), 0 states have call successors, (0), 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-01-19 11:14:25,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 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-01-19 11:14:25,109 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 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-01-19 11:14:25,109 INFO L186 Difference]: Start difference. First operand has 150 places, 119 transitions, 318 flow. Second operand 9 states and 1083 transitions. [2022-01-19 11:14:25,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 148 transitions, 521 flow [2022-01-19 11:14:25,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 148 transitions, 467 flow, removed 25 selfloop flow, removed 11 redundant places. [2022-01-19 11:14:25,114 INFO L242 Difference]: Finished difference. Result has 148 places, 121 transitions, 333 flow [2022-01-19 11:14:25,115 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=333, PETRI_PLACES=148, PETRI_TRANSITIONS=121} [2022-01-19 11:14:25,116 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 4 predicate places. [2022-01-19 11:14:25,116 INFO L470 AbstractCegarLoop]: Abstraction has has 148 places, 121 transitions, 333 flow [2022-01-19 11:14:25,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 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-01-19 11:14:25,116 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:14:25,117 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:14:25,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 11:14:25,117 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:14:25,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:14:25,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1491263730, now seen corresponding path program 1 times [2022-01-19 11:14:25,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:14:25,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856943817] [2022-01-19 11:14:25,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:14:25,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:14:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:14:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:14:25,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:14:25,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856943817] [2022-01-19 11:14:25,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856943817] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:14:25,335 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:14:25,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 11:14:25,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774685530] [2022-01-19 11:14:25,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:14:25,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 11:14:25,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:14:25,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 11:14:25,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 11:14:25,337 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2022-01-19 11:14:25,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 121 transitions, 333 flow. Second operand has 10 states, 10 states have (on average 114.7) internal successors, (1147), 10 states have internal predecessors, (1147), 0 states have call successors, (0), 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-01-19 11:14:25,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:14:25,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2022-01-19 11:14:25,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:14:25,667 INFO L129 PetriNetUnfolder]: 152/492 cut-off events. [2022-01-19 11:14:25,667 INFO L130 PetriNetUnfolder]: For 893/896 co-relation queries the response was YES. [2022-01-19 11:14:25,670 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1362 conditions, 492 events. 152/492 cut-off events. For 893/896 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2190 event pairs, 19 based on Foata normal form. 8/479 useless extension candidates. Maximal degree in co-relation 1285. Up to 157 conditions per place. [2022-01-19 11:14:25,672 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 22 selfloop transitions, 10 changer transitions 19/149 dead transitions. [2022-01-19 11:14:25,672 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 149 transitions, 581 flow [2022-01-19 11:14:25,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 11:14:25,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 11:14:25,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1406 transitions. [2022-01-19 11:14:25,675 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8552311435523114 [2022-01-19 11:14:25,675 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1406 transitions. [2022-01-19 11:14:25,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1406 transitions. [2022-01-19 11:14:25,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:14:25,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1406 transitions. [2022-01-19 11:14:25,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 117.16666666666667) internal successors, (1406), 12 states have internal predecessors, (1406), 0 states have call successors, (0), 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-01-19 11:14:25,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 0 states have call successors, (0), 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-01-19 11:14:25,679 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 0 states have call successors, (0), 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-01-19 11:14:25,679 INFO L186 Difference]: Start difference. First operand has 148 places, 121 transitions, 333 flow. Second operand 12 states and 1406 transitions. [2022-01-19 11:14:25,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 149 transitions, 581 flow [2022-01-19 11:14:25,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 149 transitions, 564 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-01-19 11:14:25,683 INFO L242 Difference]: Finished difference. Result has 157 places, 126 transitions, 405 flow [2022-01-19 11:14:25,683 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=405, PETRI_PLACES=157, PETRI_TRANSITIONS=126} [2022-01-19 11:14:25,684 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 13 predicate places. [2022-01-19 11:14:25,684 INFO L470 AbstractCegarLoop]: Abstraction has has 157 places, 126 transitions, 405 flow [2022-01-19 11:14:25,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 114.7) internal successors, (1147), 10 states have internal predecessors, (1147), 0 states have call successors, (0), 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-01-19 11:14:25,684 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:14:25,684 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:14:25,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 11:14:25,685 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:14:25,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:14:25,685 INFO L85 PathProgramCache]: Analyzing trace with hash 2010729108, now seen corresponding path program 2 times [2022-01-19 11:14:25,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:14:25,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662444951] [2022-01-19 11:14:25,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:14:25,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:14:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:14:25,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:14:25,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:14:25,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662444951] [2022-01-19 11:14:25,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662444951] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:14:25,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:14:25,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 11:14:25,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590303019] [2022-01-19 11:14:25,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:14:25,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 11:14:25,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:14:25,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 11:14:25,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-01-19 11:14:25,864 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2022-01-19 11:14:25,865 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 126 transitions, 405 flow. Second operand has 12 states, 12 states have (on average 112.58333333333333) internal successors, (1351), 12 states have internal predecessors, (1351), 0 states have call successors, (0), 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-01-19 11:14:25,865 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:14:25,865 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2022-01-19 11:14:25,866 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:14:26,114 INFO L129 PetriNetUnfolder]: 154/505 cut-off events. [2022-01-19 11:14:26,114 INFO L130 PetriNetUnfolder]: For 2579/2616 co-relation queries the response was YES. [2022-01-19 11:14:26,117 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1952 conditions, 505 events. 154/505 cut-off events. For 2579/2616 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2277 event pairs, 14 based on Foata normal form. 20/504 useless extension candidates. Maximal degree in co-relation 1866. Up to 159 conditions per place. [2022-01-19 11:14:26,119 INFO L132 encePairwiseOnDemand]: 125/137 looper letters, 22 selfloop transitions, 15 changer transitions 19/152 dead transitions. [2022-01-19 11:14:26,119 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 152 transitions, 811 flow [2022-01-19 11:14:26,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 11:14:26,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 11:14:26,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1605 transitions. [2022-01-19 11:14:26,122 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8368091762252347 [2022-01-19 11:14:26,122 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1605 transitions. [2022-01-19 11:14:26,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1605 transitions. [2022-01-19 11:14:26,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:14:26,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1605 transitions. [2022-01-19 11:14:26,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 114.64285714285714) internal successors, (1605), 14 states have internal predecessors, (1605), 0 states have call successors, (0), 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-01-19 11:14:26,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 0 states have call successors, (0), 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-01-19 11:14:26,128 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 0 states have call successors, (0), 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-01-19 11:14:26,128 INFO L186 Difference]: Start difference. First operand has 157 places, 126 transitions, 405 flow. Second operand 14 states and 1605 transitions. [2022-01-19 11:14:26,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 152 transitions, 811 flow [2022-01-19 11:14:26,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 152 transitions, 779 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-01-19 11:14:26,132 INFO L242 Difference]: Finished difference. Result has 166 places, 130 transitions, 489 flow [2022-01-19 11:14:26,132 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=489, PETRI_PLACES=166, PETRI_TRANSITIONS=130} [2022-01-19 11:14:26,133 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 22 predicate places. [2022-01-19 11:14:26,133 INFO L470 AbstractCegarLoop]: Abstraction has has 166 places, 130 transitions, 489 flow [2022-01-19 11:14:26,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 112.58333333333333) internal successors, (1351), 12 states have internal predecessors, (1351), 0 states have call successors, (0), 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-01-19 11:14:26,134 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:14:26,134 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:14:26,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 11:14:26,134 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:14:26,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:14:26,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1745645192, now seen corresponding path program 3 times [2022-01-19 11:14:26,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:14:26,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212172192] [2022-01-19 11:14:26,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:14:26,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:14:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:14:26,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:14:26,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:14:26,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212172192] [2022-01-19 11:14:26,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212172192] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:14:26,273 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:14:26,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 11:14:26,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027336578] [2022-01-19 11:14:26,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:14:26,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 11:14:26,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:14:26,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 11:14:26,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-19 11:14:26,294 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2022-01-19 11:14:26,295 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 130 transitions, 489 flow. Second operand has 9 states, 9 states have (on average 114.88888888888889) internal successors, (1034), 9 states have internal predecessors, (1034), 0 states have call successors, (0), 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-01-19 11:14:26,295 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:14:26,295 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2022-01-19 11:14:26,295 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:14:26,505 INFO L129 PetriNetUnfolder]: 168/531 cut-off events. [2022-01-19 11:14:26,506 INFO L130 PetriNetUnfolder]: For 4896/4991 co-relation queries the response was YES. [2022-01-19 11:14:26,509 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2473 conditions, 531 events. 168/531 cut-off events. For 4896/4991 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2575 event pairs, 22 based on Foata normal form. 14/521 useless extension candidates. Maximal degree in co-relation 2382. Up to 168 conditions per place. [2022-01-19 11:14:26,512 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 29 selfloop transitions, 11 changer transitions 10/148 dead transitions. [2022-01-19 11:14:26,512 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 148 transitions, 833 flow [2022-01-19 11:14:26,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 11:14:26,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 11:14:26,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1057 transitions. [2022-01-19 11:14:26,514 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8572587185725872 [2022-01-19 11:14:26,514 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1057 transitions. [2022-01-19 11:14:26,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1057 transitions. [2022-01-19 11:14:26,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:14:26,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1057 transitions. [2022-01-19 11:14:26,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.44444444444444) internal successors, (1057), 9 states have internal predecessors, (1057), 0 states have call successors, (0), 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-01-19 11:14:26,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 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-01-19 11:14:26,518 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 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-01-19 11:14:26,518 INFO L186 Difference]: Start difference. First operand has 166 places, 130 transitions, 489 flow. Second operand 9 states and 1057 transitions. [2022-01-19 11:14:26,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 148 transitions, 833 flow [2022-01-19 11:14:26,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 148 transitions, 690 flow, removed 69 selfloop flow, removed 12 redundant places. [2022-01-19 11:14:26,525 INFO L242 Difference]: Finished difference. Result has 160 places, 133 transitions, 497 flow [2022-01-19 11:14:26,525 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=497, PETRI_PLACES=160, PETRI_TRANSITIONS=133} [2022-01-19 11:14:26,526 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 16 predicate places. [2022-01-19 11:14:26,526 INFO L470 AbstractCegarLoop]: Abstraction has has 160 places, 133 transitions, 497 flow [2022-01-19 11:14:26,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.88888888888889) internal successors, (1034), 9 states have internal predecessors, (1034), 0 states have call successors, (0), 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-01-19 11:14:26,527 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:14:26,527 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:14:26,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 11:14:26,527 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:14:26,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:14:26,527 INFO L85 PathProgramCache]: Analyzing trace with hash 668788932, now seen corresponding path program 4 times [2022-01-19 11:14:26,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:14:26,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782182879] [2022-01-19 11:14:26,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:14:26,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:14:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:14:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:14:26,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:14:26,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782182879] [2022-01-19 11:14:26,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782182879] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:14:26,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:14:26,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 11:14:26,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986628178] [2022-01-19 11:14:26,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:14:26,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 11:14:26,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:14:26,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 11:14:26,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-19 11:14:26,627 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 137 [2022-01-19 11:14:26,627 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 133 transitions, 497 flow. Second operand has 9 states, 9 states have (on average 115.77777777777777) internal successors, (1042), 9 states have internal predecessors, (1042), 0 states have call successors, (0), 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-01-19 11:14:26,627 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:14:26,627 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 137 [2022-01-19 11:14:26,628 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:14:26,836 INFO L129 PetriNetUnfolder]: 153/514 cut-off events. [2022-01-19 11:14:26,836 INFO L130 PetriNetUnfolder]: For 2731/2931 co-relation queries the response was YES. [2022-01-19 11:14:26,839 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2122 conditions, 514 events. 153/514 cut-off events. For 2731/2931 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2494 event pairs, 26 based on Foata normal form. 20/511 useless extension candidates. Maximal degree in co-relation 2037. Up to 146 conditions per place. [2022-01-19 11:14:26,842 INFO L132 encePairwiseOnDemand]: 128/137 looper letters, 27 selfloop transitions, 15 changer transitions 19/160 dead transitions. [2022-01-19 11:14:26,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 160 transitions, 929 flow [2022-01-19 11:14:26,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 11:14:26,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 11:14:26,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1302 transitions. [2022-01-19 11:14:26,844 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8639681486396815 [2022-01-19 11:14:26,844 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1302 transitions. [2022-01-19 11:14:26,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1302 transitions. [2022-01-19 11:14:26,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:14:26,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1302 transitions. [2022-01-19 11:14:26,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 118.36363636363636) internal successors, (1302), 11 states have internal predecessors, (1302), 0 states have call successors, (0), 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-01-19 11:14:26,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 0 states have call successors, (0), 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-01-19 11:14:26,849 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 0 states have call successors, (0), 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-01-19 11:14:26,849 INFO L186 Difference]: Start difference. First operand has 160 places, 133 transitions, 497 flow. Second operand 11 states and 1302 transitions. [2022-01-19 11:14:26,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 160 transitions, 929 flow [2022-01-19 11:14:26,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 160 transitions, 887 flow, removed 17 selfloop flow, removed 6 redundant places. [2022-01-19 11:14:26,855 INFO L242 Difference]: Finished difference. Result has 168 places, 135 transitions, 574 flow [2022-01-19 11:14:26,855 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=574, PETRI_PLACES=168, PETRI_TRANSITIONS=135} [2022-01-19 11:14:26,856 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 24 predicate places. [2022-01-19 11:14:26,856 INFO L470 AbstractCegarLoop]: Abstraction has has 168 places, 135 transitions, 574 flow [2022-01-19 11:14:26,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.77777777777777) internal successors, (1042), 9 states have internal predecessors, (1042), 0 states have call successors, (0), 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-01-19 11:14:26,856 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:14:26,856 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:14:26,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 11:14:26,857 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:14:26,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:14:26,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1192908801, now seen corresponding path program 1 times [2022-01-19 11:14:26,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:14:26,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180820885] [2022-01-19 11:14:26,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:14:26,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:14:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:14:27,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:14:27,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:14:27,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180820885] [2022-01-19 11:14:27,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180820885] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:14:27,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:14:27,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-19 11:14:27,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547085560] [2022-01-19 11:14:27,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:14:27,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 11:14:27,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:14:27,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 11:14:27,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-01-19 11:14:27,089 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2022-01-19 11:14:27,090 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 135 transitions, 574 flow. Second operand has 13 states, 13 states have (on average 111.61538461538461) internal successors, (1451), 13 states have internal predecessors, (1451), 0 states have call successors, (0), 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-01-19 11:14:27,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:14:27,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2022-01-19 11:14:27,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:14:27,363 INFO L129 PetriNetUnfolder]: 124/463 cut-off events. [2022-01-19 11:14:27,363 INFO L130 PetriNetUnfolder]: For 3328/3524 co-relation queries the response was YES. [2022-01-19 11:14:27,366 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2067 conditions, 463 events. 124/463 cut-off events. For 3328/3524 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2159 event pairs, 22 based on Foata normal form. 14/453 useless extension candidates. Maximal degree in co-relation 1974. Up to 167 conditions per place. [2022-01-19 11:14:27,369 INFO L132 encePairwiseOnDemand]: 124/137 looper letters, 32 selfloop transitions, 16 changer transitions 7/150 dead transitions. [2022-01-19 11:14:27,369 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 150 transitions, 868 flow [2022-01-19 11:14:27,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 11:14:27,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 11:14:27,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1360 transitions. [2022-01-19 11:14:27,372 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8272506082725061 [2022-01-19 11:14:27,372 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1360 transitions. [2022-01-19 11:14:27,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1360 transitions. [2022-01-19 11:14:27,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:14:27,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1360 transitions. [2022-01-19 11:14:27,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 113.33333333333333) internal successors, (1360), 12 states have internal predecessors, (1360), 0 states have call successors, (0), 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-01-19 11:14:27,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 0 states have call successors, (0), 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-01-19 11:14:27,377 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 0 states have call successors, (0), 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-01-19 11:14:27,377 INFO L186 Difference]: Start difference. First operand has 168 places, 135 transitions, 574 flow. Second operand 12 states and 1360 transitions. [2022-01-19 11:14:27,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 150 transitions, 868 flow [2022-01-19 11:14:27,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 150 transitions, 761 flow, removed 44 selfloop flow, removed 9 redundant places. [2022-01-19 11:14:27,384 INFO L242 Difference]: Finished difference. Result has 169 places, 140 transitions, 622 flow [2022-01-19 11:14:27,385 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=622, PETRI_PLACES=169, PETRI_TRANSITIONS=140} [2022-01-19 11:14:27,385 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 25 predicate places. [2022-01-19 11:14:27,385 INFO L470 AbstractCegarLoop]: Abstraction has has 169 places, 140 transitions, 622 flow [2022-01-19 11:14:27,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 111.61538461538461) internal successors, (1451), 13 states have internal predecessors, (1451), 0 states have call successors, (0), 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-01-19 11:14:27,386 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:14:27,386 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:14:27,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 11:14:27,386 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:14:27,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:14:27,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1629990149, now seen corresponding path program 2 times [2022-01-19 11:14:27,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:14:27,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213338173] [2022-01-19 11:14:27,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:14:27,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:14:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:14:27,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:14:27,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:14:27,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213338173] [2022-01-19 11:14:27,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213338173] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:14:27,558 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:14:27,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-19 11:14:27,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840534567] [2022-01-19 11:14:27,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:14:27,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 11:14:27,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:14:27,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 11:14:27,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-01-19 11:14:27,560 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2022-01-19 11:14:27,561 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 140 transitions, 622 flow. Second operand has 13 states, 13 states have (on average 111.61538461538461) internal successors, (1451), 13 states have internal predecessors, (1451), 0 states have call successors, (0), 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-01-19 11:14:27,561 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:14:27,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2022-01-19 11:14:27,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:14:27,854 INFO L129 PetriNetUnfolder]: 124/481 cut-off events. [2022-01-19 11:14:27,854 INFO L130 PetriNetUnfolder]: For 2330/2517 co-relation queries the response was YES. [2022-01-19 11:14:27,857 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1915 conditions, 481 events. 124/481 cut-off events. For 2330/2517 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2247 event pairs, 14 based on Foata normal form. 25/482 useless extension candidates. Maximal degree in co-relation 1820. Up to 163 conditions per place. [2022-01-19 11:14:27,860 INFO L132 encePairwiseOnDemand]: 125/137 looper letters, 32 selfloop transitions, 16 changer transitions 10/153 dead transitions. [2022-01-19 11:14:27,860 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 153 transitions, 866 flow [2022-01-19 11:14:27,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 11:14:27,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 11:14:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1584 transitions. [2022-01-19 11:14:27,864 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8258602711157456 [2022-01-19 11:14:27,865 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1584 transitions. [2022-01-19 11:14:27,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1584 transitions. [2022-01-19 11:14:27,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:14:27,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1584 transitions. [2022-01-19 11:14:27,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 113.14285714285714) internal successors, (1584), 14 states have internal predecessors, (1584), 0 states have call successors, (0), 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-01-19 11:14:27,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 0 states have call successors, (0), 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-01-19 11:14:27,880 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 0 states have call successors, (0), 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-01-19 11:14:27,880 INFO L186 Difference]: Start difference. First operand has 169 places, 140 transitions, 622 flow. Second operand 14 states and 1584 transitions. [2022-01-19 11:14:27,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 153 transitions, 866 flow [2022-01-19 11:14:27,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 153 transitions, 811 flow, removed 16 selfloop flow, removed 9 redundant places. [2022-01-19 11:14:27,887 INFO L242 Difference]: Finished difference. Result has 177 places, 141 transitions, 651 flow [2022-01-19 11:14:27,887 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=651, PETRI_PLACES=177, PETRI_TRANSITIONS=141} [2022-01-19 11:14:27,888 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 33 predicate places. [2022-01-19 11:14:27,888 INFO L470 AbstractCegarLoop]: Abstraction has has 177 places, 141 transitions, 651 flow [2022-01-19 11:14:27,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 111.61538461538461) internal successors, (1451), 13 states have internal predecessors, (1451), 0 states have call successors, (0), 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-01-19 11:14:27,889 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:14:27,889 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:14:27,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 11:14:27,890 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:14:27,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:14:27,890 INFO L85 PathProgramCache]: Analyzing trace with hash -653499, now seen corresponding path program 3 times [2022-01-19 11:14:27,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:14:27,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126900536] [2022-01-19 11:14:27,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:14:27,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:14:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:14:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:14:28,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:14:28,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126900536] [2022-01-19 11:14:28,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126900536] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:14:28,102 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:14:28,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-19 11:14:28,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186721015] [2022-01-19 11:14:28,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:14:28,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 11:14:28,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:14:28,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 11:14:28,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-01-19 11:14:28,104 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-01-19 11:14:28,105 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 141 transitions, 651 flow. Second operand has 13 states, 13 states have (on average 113.46153846153847) internal successors, (1475), 13 states have internal predecessors, (1475), 0 states have call successors, (0), 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-01-19 11:14:28,105 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:14:28,105 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-01-19 11:14:28,105 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:14:28,341 INFO L129 PetriNetUnfolder]: 124/518 cut-off events. [2022-01-19 11:14:28,341 INFO L130 PetriNetUnfolder]: For 3442/3577 co-relation queries the response was YES. [2022-01-19 11:14:28,344 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2140 conditions, 518 events. 124/518 cut-off events. For 3442/3577 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2594 event pairs, 5 based on Foata normal form. 75/573 useless extension candidates. Maximal degree in co-relation 2044. Up to 145 conditions per place. [2022-01-19 11:14:28,347 INFO L132 encePairwiseOnDemand]: 125/137 looper letters, 29 selfloop transitions, 26 changer transitions 10/162 dead transitions. [2022-01-19 11:14:28,347 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 162 transitions, 1019 flow [2022-01-19 11:14:28,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 11:14:28,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 11:14:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1728 transitions. [2022-01-19 11:14:28,349 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8408759124087591 [2022-01-19 11:14:28,349 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1728 transitions. [2022-01-19 11:14:28,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1728 transitions. [2022-01-19 11:14:28,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:14:28,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1728 transitions. [2022-01-19 11:14:28,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 115.2) internal successors, (1728), 15 states have internal predecessors, (1728), 0 states have call successors, (0), 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-01-19 11:14:28,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 137.0) internal successors, (2192), 16 states have internal predecessors, (2192), 0 states have call successors, (0), 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-01-19 11:14:28,353 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 137.0) internal successors, (2192), 16 states have internal predecessors, (2192), 0 states have call successors, (0), 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-01-19 11:14:28,353 INFO L186 Difference]: Start difference. First operand has 177 places, 141 transitions, 651 flow. Second operand 15 states and 1728 transitions. [2022-01-19 11:14:28,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 162 transitions, 1019 flow [2022-01-19 11:14:28,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 162 transitions, 899 flow, removed 46 selfloop flow, removed 12 redundant places. [2022-01-19 11:14:28,361 INFO L242 Difference]: Finished difference. Result has 180 places, 144 transitions, 725 flow [2022-01-19 11:14:28,361 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=725, PETRI_PLACES=180, PETRI_TRANSITIONS=144} [2022-01-19 11:14:28,361 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 36 predicate places. [2022-01-19 11:14:28,361 INFO L470 AbstractCegarLoop]: Abstraction has has 180 places, 144 transitions, 725 flow [2022-01-19 11:14:28,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 113.46153846153847) internal successors, (1475), 13 states have internal predecessors, (1475), 0 states have call successors, (0), 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-01-19 11:14:28,362 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:14:28,362 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:14:28,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 11:14:28,362 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:14:28,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:14:28,363 INFO L85 PathProgramCache]: Analyzing trace with hash -168374579, now seen corresponding path program 4 times [2022-01-19 11:14:28,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:14:28,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082256273] [2022-01-19 11:14:28,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:14:28,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:14:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:14:28,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:14:28,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:14:28,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082256273] [2022-01-19 11:14:28,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082256273] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:14:28,586 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:14:28,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-19 11:14:28,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456465651] [2022-01-19 11:14:28,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:14:28,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 11:14:28,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:14:28,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 11:14:28,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-01-19 11:14:28,587 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2022-01-19 11:14:28,588 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 144 transitions, 725 flow. Second operand has 13 states, 13 states have (on average 112.53846153846153) internal successors, (1463), 13 states have internal predecessors, (1463), 0 states have call successors, (0), 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-01-19 11:14:28,588 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:14:28,588 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2022-01-19 11:14:28,588 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:14:28,982 INFO L129 PetriNetUnfolder]: 124/516 cut-off events. [2022-01-19 11:14:28,983 INFO L130 PetriNetUnfolder]: For 3914/4137 co-relation queries the response was YES. [2022-01-19 11:14:28,985 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2293 conditions, 516 events. 124/516 cut-off events. For 3914/4137 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2614 event pairs, 9 based on Foata normal form. 57/550 useless extension candidates. Maximal degree in co-relation 2195. Up to 145 conditions per place. [2022-01-19 11:14:28,988 INFO L132 encePairwiseOnDemand]: 125/137 looper letters, 32 selfloop transitions, 24 changer transitions 10/162 dead transitions. [2022-01-19 11:14:28,988 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 162 transitions, 1073 flow [2022-01-19 11:14:28,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 11:14:28,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 11:14:28,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1714 transitions. [2022-01-19 11:14:28,990 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8340632603406326 [2022-01-19 11:14:28,990 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1714 transitions. [2022-01-19 11:14:28,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1714 transitions. [2022-01-19 11:14:28,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:14:28,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1714 transitions. [2022-01-19 11:14:28,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 114.26666666666667) internal successors, (1714), 15 states have internal predecessors, (1714), 0 states have call successors, (0), 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-01-19 11:14:28,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 137.0) internal successors, (2192), 16 states have internal predecessors, (2192), 0 states have call successors, (0), 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-01-19 11:14:28,994 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 137.0) internal successors, (2192), 16 states have internal predecessors, (2192), 0 states have call successors, (0), 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-01-19 11:14:28,994 INFO L186 Difference]: Start difference. First operand has 180 places, 144 transitions, 725 flow. Second operand 15 states and 1714 transitions. [2022-01-19 11:14:28,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 162 transitions, 1073 flow [2022-01-19 11:14:29,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 162 transitions, 974 flow, removed 38 selfloop flow, removed 13 redundant places. [2022-01-19 11:14:29,002 INFO L242 Difference]: Finished difference. Result has 182 places, 145 transitions, 776 flow [2022-01-19 11:14:29,002 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=776, PETRI_PLACES=182, PETRI_TRANSITIONS=145} [2022-01-19 11:14:29,003 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 38 predicate places. [2022-01-19 11:14:29,003 INFO L470 AbstractCegarLoop]: Abstraction has has 182 places, 145 transitions, 776 flow [2022-01-19 11:14:29,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 112.53846153846153) internal successors, (1463), 13 states have internal predecessors, (1463), 0 states have call successors, (0), 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-01-19 11:14:29,003 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:14:29,003 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:14:29,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 11:14:29,004 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:14:29,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:14:29,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1011764997, now seen corresponding path program 5 times [2022-01-19 11:14:29,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:14:29,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595736785] [2022-01-19 11:14:29,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:14:29,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:14:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:14:29,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:14:29,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:14:29,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595736785] [2022-01-19 11:14:29,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595736785] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:14:29,176 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:14:29,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 11:14:29,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874027990] [2022-01-19 11:14:29,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:14:29,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 11:14:29,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:14:29,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 11:14:29,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-01-19 11:14:29,178 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2022-01-19 11:14:29,179 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 145 transitions, 776 flow. Second operand has 12 states, 12 states have (on average 112.66666666666667) internal successors, (1352), 12 states have internal predecessors, (1352), 0 states have call successors, (0), 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-01-19 11:14:29,179 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:14:29,179 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2022-01-19 11:14:29,179 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:14:29,483 INFO L129 PetriNetUnfolder]: 109/531 cut-off events. [2022-01-19 11:14:29,483 INFO L130 PetriNetUnfolder]: For 3470/3980 co-relation queries the response was YES. [2022-01-19 11:14:29,486 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2299 conditions, 531 events. 109/531 cut-off events. For 3470/3980 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2914 event pairs, 11 based on Foata normal form. 32/538 useless extension candidates. Maximal degree in co-relation 2201. Up to 118 conditions per place. [2022-01-19 11:14:29,489 INFO L132 encePairwiseOnDemand]: 127/137 looper letters, 42 selfloop transitions, 13 changer transitions 10/161 dead transitions. [2022-01-19 11:14:29,489 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 161 transitions, 1106 flow [2022-01-19 11:14:29,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 11:14:29,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 11:14:29,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1486 transitions. [2022-01-19 11:14:29,490 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8343627175743964 [2022-01-19 11:14:29,491 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1486 transitions. [2022-01-19 11:14:29,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1486 transitions. [2022-01-19 11:14:29,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:14:29,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1486 transitions. [2022-01-19 11:14:29,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 114.3076923076923) internal successors, (1486), 13 states have internal predecessors, (1486), 0 states have call successors, (0), 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-01-19 11:14:29,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 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-01-19 11:14:29,494 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 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-01-19 11:14:29,494 INFO L186 Difference]: Start difference. First operand has 182 places, 145 transitions, 776 flow. Second operand 13 states and 1486 transitions. [2022-01-19 11:14:29,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 161 transitions, 1106 flow [2022-01-19 11:14:29,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 161 transitions, 986 flow, removed 41 selfloop flow, removed 13 redundant places. [2022-01-19 11:14:29,504 INFO L242 Difference]: Finished difference. Result has 182 places, 145 transitions, 747 flow [2022-01-19 11:14:29,504 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=747, PETRI_PLACES=182, PETRI_TRANSITIONS=145} [2022-01-19 11:14:29,505 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 38 predicate places. [2022-01-19 11:14:29,505 INFO L470 AbstractCegarLoop]: Abstraction has has 182 places, 145 transitions, 747 flow [2022-01-19 11:14:29,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 112.66666666666667) internal successors, (1352), 12 states have internal predecessors, (1352), 0 states have call successors, (0), 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-01-19 11:14:29,505 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:14:29,505 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:14:29,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 11:14:29,506 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:14:29,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:14:29,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1320206971, now seen corresponding path program 1 times [2022-01-19 11:14:29,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:14:29,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436349733] [2022-01-19 11:14:29,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:14:29,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:14:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:14:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:14:29,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:14:29,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436349733] [2022-01-19 11:14:29,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436349733] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:14:29,564 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:14:29,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 11:14:29,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426450359] [2022-01-19 11:14:29,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:14:29,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 11:14:29,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:14:29,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 11:14:29,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 11:14:29,566 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-01-19 11:14:29,566 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 145 transitions, 747 flow. Second operand has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 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-01-19 11:14:29,566 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:14:29,566 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-01-19 11:14:29,566 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:14:30,364 INFO L129 PetriNetUnfolder]: 3656/6771 cut-off events. [2022-01-19 11:14:30,365 INFO L130 PetriNetUnfolder]: For 40148/41357 co-relation queries the response was YES. [2022-01-19 11:14:30,407 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25663 conditions, 6771 events. 3656/6771 cut-off events. For 40148/41357 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 54507 event pairs, 123 based on Foata normal form. 509/7016 useless extension candidates. Maximal degree in co-relation 25570. Up to 2505 conditions per place. [2022-01-19 11:14:30,439 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 155 selfloop transitions, 18 changer transitions 5/276 dead transitions. [2022-01-19 11:14:30,439 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 276 transitions, 2519 flow [2022-01-19 11:14:30,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 11:14:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 11:14:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1204 transitions. [2022-01-19 11:14:30,441 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8788321167883212 [2022-01-19 11:14:30,441 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1204 transitions. [2022-01-19 11:14:30,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1204 transitions. [2022-01-19 11:14:30,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:14:30,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1204 transitions. [2022-01-19 11:14:30,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 120.4) internal successors, (1204), 10 states have internal predecessors, (1204), 0 states have call successors, (0), 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-01-19 11:14:30,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 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-01-19 11:14:30,445 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 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-01-19 11:14:30,445 INFO L186 Difference]: Start difference. First operand has 182 places, 145 transitions, 747 flow. Second operand 10 states and 1204 transitions. [2022-01-19 11:14:30,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 276 transitions, 2519 flow [2022-01-19 11:14:30,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 276 transitions, 2382 flow, removed 30 selfloop flow, removed 11 redundant places. [2022-01-19 11:14:30,495 INFO L242 Difference]: Finished difference. Result has 180 places, 161 transitions, 840 flow [2022-01-19 11:14:30,495 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=840, PETRI_PLACES=180, PETRI_TRANSITIONS=161} [2022-01-19 11:14:30,496 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 36 predicate places. [2022-01-19 11:14:30,496 INFO L470 AbstractCegarLoop]: Abstraction has has 180 places, 161 transitions, 840 flow [2022-01-19 11:14:30,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 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-01-19 11:14:30,496 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:14:30,496 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:14:30,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 11:14:30,497 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:14:30,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:14:30,497 INFO L85 PathProgramCache]: Analyzing trace with hash -2018206925, now seen corresponding path program 1 times [2022-01-19 11:14:30,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:14:30,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385015847] [2022-01-19 11:14:30,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:14:30,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:14:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:14:30,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:14:30,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:14:30,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385015847] [2022-01-19 11:14:30,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385015847] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:14:30,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:14:30,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 11:14:30,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226718098] [2022-01-19 11:14:30,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:14:30,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 11:14:30,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:14:30,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 11:14:30,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 11:14:30,577 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-01-19 11:14:30,578 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 161 transitions, 840 flow. Second operand has 7 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 0 states have call successors, (0), 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-01-19 11:14:30,578 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:14:30,578 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-01-19 11:14:30,578 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:14:31,496 INFO L129 PetriNetUnfolder]: 3510/6824 cut-off events. [2022-01-19 11:14:31,496 INFO L130 PetriNetUnfolder]: For 42929/44117 co-relation queries the response was YES. [2022-01-19 11:14:31,530 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31764 conditions, 6824 events. 3510/6824 cut-off events. For 42929/44117 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 58170 event pairs, 58 based on Foata normal form. 652/7345 useless extension candidates. Maximal degree in co-relation 31672. Up to 2196 conditions per place. [2022-01-19 11:14:31,557 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 180 selfloop transitions, 34 changer transitions 26/338 dead transitions. [2022-01-19 11:14:31,558 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 338 transitions, 3380 flow [2022-01-19 11:14:31,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 11:14:31,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 11:14:31,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1566 transitions. [2022-01-19 11:14:31,560 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8792813026389669 [2022-01-19 11:14:31,560 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1566 transitions. [2022-01-19 11:14:31,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1566 transitions. [2022-01-19 11:14:31,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:14:31,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1566 transitions. [2022-01-19 11:14:31,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 120.46153846153847) internal successors, (1566), 13 states have internal predecessors, (1566), 0 states have call successors, (0), 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-01-19 11:14:31,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 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-01-19 11:14:31,564 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 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-01-19 11:14:31,564 INFO L186 Difference]: Start difference. First operand has 180 places, 161 transitions, 840 flow. Second operand 13 states and 1566 transitions. [2022-01-19 11:14:31,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 338 transitions, 3380 flow [2022-01-19 11:14:31,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 338 transitions, 3378 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 11:14:31,604 INFO L242 Difference]: Finished difference. Result has 197 places, 179 transitions, 1102 flow [2022-01-19 11:14:31,605 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1102, PETRI_PLACES=197, PETRI_TRANSITIONS=179} [2022-01-19 11:14:31,605 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 53 predicate places. [2022-01-19 11:14:31,605 INFO L470 AbstractCegarLoop]: Abstraction has has 197 places, 179 transitions, 1102 flow [2022-01-19 11:14:31,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 0 states have call successors, (0), 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-01-19 11:14:31,605 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:14:31,605 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:14:31,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 11:14:31,606 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:14:31,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:14:31,606 INFO L85 PathProgramCache]: Analyzing trace with hash 396650622, now seen corresponding path program 1 times [2022-01-19 11:14:31,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:14:31,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951027235] [2022-01-19 11:14:31,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:14:31,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:14:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:14:31,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:14:31,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:14:31,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951027235] [2022-01-19 11:14:31,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951027235] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:14:31,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:14:31,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 11:14:31,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010464776] [2022-01-19 11:14:31,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:14:31,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 11:14:31,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:14:31,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 11:14:31,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 11:14:31,673 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 137 [2022-01-19 11:14:31,673 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 179 transitions, 1102 flow. Second operand has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 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-01-19 11:14:31,673 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:14:31,673 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 137 [2022-01-19 11:14:31,673 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:14:32,303 INFO L129 PetriNetUnfolder]: 1014/3925 cut-off events. [2022-01-19 11:14:32,303 INFO L130 PetriNetUnfolder]: For 17769/21351 co-relation queries the response was YES. [2022-01-19 11:14:32,333 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15872 conditions, 3925 events. 1014/3925 cut-off events. For 17769/21351 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 42239 event pairs, 101 based on Foata normal form. 187/3835 useless extension candidates. Maximal degree in co-relation 15772. Up to 1156 conditions per place. [2022-01-19 11:14:32,347 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 81 selfloop transitions, 11 changer transitions 8/234 dead transitions. [2022-01-19 11:14:32,347 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 234 transitions, 1919 flow [2022-01-19 11:14:32,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 11:14:32,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 11:14:32,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1081 transitions. [2022-01-19 11:14:32,348 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8767234387672344 [2022-01-19 11:14:32,348 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1081 transitions. [2022-01-19 11:14:32,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1081 transitions. [2022-01-19 11:14:32,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:14:32,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1081 transitions. [2022-01-19 11:14:32,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.11111111111111) internal successors, (1081), 9 states have internal predecessors, (1081), 0 states have call successors, (0), 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-01-19 11:14:32,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 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-01-19 11:14:32,351 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 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-01-19 11:14:32,351 INFO L186 Difference]: Start difference. First operand has 197 places, 179 transitions, 1102 flow. Second operand 9 states and 1081 transitions. [2022-01-19 11:14:32,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 234 transitions, 1919 flow [2022-01-19 11:14:32,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 234 transitions, 1830 flow, removed 36 selfloop flow, removed 4 redundant places. [2022-01-19 11:14:32,435 INFO L242 Difference]: Finished difference. Result has 208 places, 187 transitions, 1144 flow [2022-01-19 11:14:32,435 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1144, PETRI_PLACES=208, PETRI_TRANSITIONS=187} [2022-01-19 11:14:32,435 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 64 predicate places. [2022-01-19 11:14:32,436 INFO L470 AbstractCegarLoop]: Abstraction has has 208 places, 187 transitions, 1144 flow [2022-01-19 11:14:32,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 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-01-19 11:14:32,436 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:14:32,436 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:14:32,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 11:14:32,436 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:14:32,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:14:32,436 INFO L85 PathProgramCache]: Analyzing trace with hash 430653584, now seen corresponding path program 1 times [2022-01-19 11:14:32,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:14:32,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131549295] [2022-01-19 11:14:32,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:14:32,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:14:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:14:32,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:14:32,508 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:14:32,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131549295] [2022-01-19 11:14:32,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131549295] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:14:32,508 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:14:32,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 11:14:32,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022215739] [2022-01-19 11:14:32,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:14:32,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 11:14:32,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:14:32,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 11:14:32,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 11:14:32,510 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-01-19 11:14:32,510 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 187 transitions, 1144 flow. Second operand has 8 states, 8 states have (on average 114.25) internal successors, (914), 8 states have internal predecessors, (914), 0 states have call successors, (0), 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-01-19 11:14:32,510 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:14:32,510 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-01-19 11:14:32,511 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:14:33,784 INFO L129 PetriNetUnfolder]: 4680/9394 cut-off events. [2022-01-19 11:14:33,784 INFO L130 PetriNetUnfolder]: For 78816/80379 co-relation queries the response was YES. [2022-01-19 11:14:33,846 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48751 conditions, 9394 events. 4680/9394 cut-off events. For 78816/80379 co-relation queries the response was YES. Maximal size of possible extension queue 841. Compared 88185 event pairs, 30 based on Foata normal form. 1008/10246 useless extension candidates. Maximal degree in co-relation 48645. Up to 2261 conditions per place. [2022-01-19 11:14:33,858 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 80 selfloop transitions, 15 changer transitions 174/367 dead transitions. [2022-01-19 11:14:33,858 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 367 transitions, 3947 flow [2022-01-19 11:14:33,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 11:14:33,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 11:14:33,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1927 transitions. [2022-01-19 11:14:33,860 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8791058394160584 [2022-01-19 11:14:33,861 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1927 transitions. [2022-01-19 11:14:33,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1927 transitions. [2022-01-19 11:14:33,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:14:33,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1927 transitions. [2022-01-19 11:14:33,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 120.4375) internal successors, (1927), 16 states have internal predecessors, (1927), 0 states have call successors, (0), 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-01-19 11:14:33,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 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-01-19 11:14:33,865 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 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-01-19 11:14:33,865 INFO L186 Difference]: Start difference. First operand has 208 places, 187 transitions, 1144 flow. Second operand 16 states and 1927 transitions. [2022-01-19 11:14:33,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 367 transitions, 3947 flow [2022-01-19 11:14:34,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 367 transitions, 3779 flow, removed 19 selfloop flow, removed 6 redundant places. [2022-01-19 11:14:34,194 INFO L242 Difference]: Finished difference. Result has 223 places, 146 transitions, 849 flow [2022-01-19 11:14:34,194 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=989, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=849, PETRI_PLACES=223, PETRI_TRANSITIONS=146} [2022-01-19 11:14:34,195 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 79 predicate places. [2022-01-19 11:14:34,195 INFO L470 AbstractCegarLoop]: Abstraction has has 223 places, 146 transitions, 849 flow [2022-01-19 11:14:34,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.25) internal successors, (914), 8 states have internal predecessors, (914), 0 states have call successors, (0), 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-01-19 11:14:34,195 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:14:34,195 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:14:34,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 11:14:34,195 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:14:34,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:14:34,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1589259982, now seen corresponding path program 1 times [2022-01-19 11:14:34,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:14:34,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766849177] [2022-01-19 11:14:34,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:14:34,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:14:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:14:34,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:14:34,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:14:34,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766849177] [2022-01-19 11:14:34,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766849177] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:14:34,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:14:34,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 11:14:34,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188013695] [2022-01-19 11:14:34,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:14:34,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 11:14:34,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:14:34,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 11:14:34,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-19 11:14:34,271 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-01-19 11:14:34,271 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 146 transitions, 849 flow. Second operand has 9 states, 9 states have (on average 114.11111111111111) internal successors, (1027), 9 states have internal predecessors, (1027), 0 states have call successors, (0), 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-01-19 11:14:34,271 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:14:34,271 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-01-19 11:14:34,271 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:14:34,671 INFO L129 PetriNetUnfolder]: 423/1313 cut-off events. [2022-01-19 11:14:34,671 INFO L130 PetriNetUnfolder]: For 10578/10640 co-relation queries the response was YES. [2022-01-19 11:14:34,678 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6257 conditions, 1313 events. 423/1313 cut-off events. For 10578/10640 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9503 event pairs, 2 based on Foata normal form. 73/1358 useless extension candidates. Maximal degree in co-relation 6206. Up to 319 conditions per place. [2022-01-19 11:14:34,681 INFO L132 encePairwiseOnDemand]: 127/137 looper letters, 57 selfloop transitions, 19 changer transitions 32/205 dead transitions. [2022-01-19 11:14:34,681 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 205 transitions, 1824 flow [2022-01-19 11:14:34,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 11:14:34,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 11:14:34,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1414 transitions. [2022-01-19 11:14:34,683 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8600973236009732 [2022-01-19 11:14:34,683 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1414 transitions. [2022-01-19 11:14:34,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1414 transitions. [2022-01-19 11:14:34,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:14:34,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1414 transitions. [2022-01-19 11:14:34,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 117.83333333333333) internal successors, (1414), 12 states have internal predecessors, (1414), 0 states have call successors, (0), 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-01-19 11:14:34,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 0 states have call successors, (0), 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-01-19 11:14:34,688 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 0 states have call successors, (0), 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-01-19 11:14:34,688 INFO L186 Difference]: Start difference. First operand has 223 places, 146 transitions, 849 flow. Second operand 12 states and 1414 transitions. [2022-01-19 11:14:34,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 205 transitions, 1824 flow [2022-01-19 11:14:34,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 205 transitions, 1390 flow, removed 144 selfloop flow, removed 37 redundant places. [2022-01-19 11:14:34,714 INFO L242 Difference]: Finished difference. Result has 177 places, 138 transitions, 591 flow [2022-01-19 11:14:34,714 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=591, PETRI_PLACES=177, PETRI_TRANSITIONS=138} [2022-01-19 11:14:34,714 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 33 predicate places. [2022-01-19 11:14:34,715 INFO L470 AbstractCegarLoop]: Abstraction has has 177 places, 138 transitions, 591 flow [2022-01-19 11:14:34,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.11111111111111) internal successors, (1027), 9 states have internal predecessors, (1027), 0 states have call successors, (0), 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-01-19 11:14:34,715 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:14:34,715 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:14:34,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 11:14:34,715 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:14:34,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:14:34,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1133394674, now seen corresponding path program 1 times [2022-01-19 11:14:34,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:14:34,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727923478] [2022-01-19 11:14:34,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:14:34,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:14:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:14:34,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:14:34,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:14:34,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727923478] [2022-01-19 11:14:34,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727923478] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:14:34,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:14:34,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 11:14:34,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363526418] [2022-01-19 11:14:34,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:14:34,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 11:14:34,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:14:34,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 11:14:34,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 11:14:34,827 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-01-19 11:14:34,828 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 138 transitions, 591 flow. Second operand has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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-01-19 11:14:34,828 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:14:34,828 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-01-19 11:14:34,828 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:14:35,195 INFO L129 PetriNetUnfolder]: 333/1416 cut-off events. [2022-01-19 11:14:35,195 INFO L130 PetriNetUnfolder]: For 2500/2750 co-relation queries the response was YES. [2022-01-19 11:14:35,203 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4084 conditions, 1416 events. 333/1416 cut-off events. For 2500/2750 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11414 event pairs, 18 based on Foata normal form. 35/1371 useless extension candidates. Maximal degree in co-relation 3993. Up to 245 conditions per place. [2022-01-19 11:14:35,205 INFO L132 encePairwiseOnDemand]: 128/137 looper letters, 25 selfloop transitions, 9 changer transitions 52/194 dead transitions. [2022-01-19 11:14:35,205 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 194 transitions, 1235 flow [2022-01-19 11:14:35,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 11:14:35,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 11:14:35,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1619 transitions. [2022-01-19 11:14:35,208 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8441084462982273 [2022-01-19 11:14:35,208 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1619 transitions. [2022-01-19 11:14:35,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1619 transitions. [2022-01-19 11:14:35,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:14:35,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1619 transitions. [2022-01-19 11:14:35,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 115.64285714285714) internal successors, (1619), 14 states have internal predecessors, (1619), 0 states have call successors, (0), 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-01-19 11:14:35,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 0 states have call successors, (0), 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-01-19 11:14:35,212 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 0 states have call successors, (0), 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-01-19 11:14:35,213 INFO L186 Difference]: Start difference. First operand has 177 places, 138 transitions, 591 flow. Second operand 14 states and 1619 transitions. [2022-01-19 11:14:35,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 194 transitions, 1235 flow [2022-01-19 11:14:35,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 194 transitions, 917 flow, removed 67 selfloop flow, removed 27 redundant places. [2022-01-19 11:14:35,228 INFO L242 Difference]: Finished difference. Result has 171 places, 140 transitions, 497 flow [2022-01-19 11:14:35,228 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=497, PETRI_PLACES=171, PETRI_TRANSITIONS=140} [2022-01-19 11:14:35,228 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 27 predicate places. [2022-01-19 11:14:35,228 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 140 transitions, 497 flow [2022-01-19 11:14:35,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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-01-19 11:14:35,229 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:14:35,229 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:14:35,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 11:14:35,229 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:14:35,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:14:35,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1349207024, now seen corresponding path program 2 times [2022-01-19 11:14:35,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:14:35,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769181023] [2022-01-19 11:14:35,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:14:35,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:14:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:14:35,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:14:35,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:14:35,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769181023] [2022-01-19 11:14:35,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769181023] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:14:35,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:14:35,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 11:14:35,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327799941] [2022-01-19 11:14:35,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:14:35,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 11:14:35,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:14:35,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 11:14:35,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 11:14:35,305 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 137 [2022-01-19 11:14:35,305 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 140 transitions, 497 flow. Second operand has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 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-01-19 11:14:35,305 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:14:35,305 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 137 [2022-01-19 11:14:35,305 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:14:35,483 INFO L129 PetriNetUnfolder]: 203/901 cut-off events. [2022-01-19 11:14:35,483 INFO L130 PetriNetUnfolder]: For 1099/1149 co-relation queries the response was YES. [2022-01-19 11:14:35,486 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2108 conditions, 901 events. 203/901 cut-off events. For 1099/1149 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6271 event pairs, 8 based on Foata normal form. 18/879 useless extension candidates. Maximal degree in co-relation 2084. Up to 122 conditions per place. [2022-01-19 11:14:35,487 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 19 selfloop transitions, 1 changer transitions 46/174 dead transitions. [2022-01-19 11:14:35,487 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 174 transitions, 923 flow [2022-01-19 11:14:35,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 11:14:35,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 11:14:35,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 831 transitions. [2022-01-19 11:14:35,488 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8665276329509907 [2022-01-19 11:14:35,488 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 831 transitions. [2022-01-19 11:14:35,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 831 transitions. [2022-01-19 11:14:35,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:14:35,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 831 transitions. [2022-01-19 11:14:35,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 0 states have call successors, (0), 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-01-19 11:14:35,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 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-01-19 11:14:35,490 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 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-01-19 11:14:35,490 INFO L186 Difference]: Start difference. First operand has 171 places, 140 transitions, 497 flow. Second operand 7 states and 831 transitions. [2022-01-19 11:14:35,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 174 transitions, 923 flow [2022-01-19 11:14:35,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 174 transitions, 857 flow, removed 30 selfloop flow, removed 13 redundant places. [2022-01-19 11:14:35,494 INFO L242 Difference]: Finished difference. Result has 159 places, 128 transitions, 363 flow [2022-01-19 11:14:35,494 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=363, PETRI_PLACES=159, PETRI_TRANSITIONS=128} [2022-01-19 11:14:35,494 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 15 predicate places. [2022-01-19 11:14:35,494 INFO L470 AbstractCegarLoop]: Abstraction has has 159 places, 128 transitions, 363 flow [2022-01-19 11:14:35,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 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-01-19 11:14:35,495 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:14:35,495 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:14:35,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-19 11:14:35,495 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:14:35,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:14:35,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1351712694, now seen corresponding path program 3 times [2022-01-19 11:14:35,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:14:35,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608356539] [2022-01-19 11:14:35,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:14:35,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:14:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 11:14:35,520 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 11:14:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 11:14:35,586 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 11:14:35,586 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 11:14:35,587 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-01-19 11:14:35,588 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-01-19 11:14:35,588 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-01-19 11:14:35,588 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-01-19 11:14:35,590 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-01-19 11:14:35,590 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2022-01-19 11:14:35,590 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-01-19 11:14:35,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-19 11:14:35,593 INFO L732 BasicCegarLoop]: Path program histogram: [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:14:35,596 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 11:14:35,596 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 11:14:35,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 11:14:35 BasicIcfg [2022-01-19 11:14:35,718 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 11:14:35,719 INFO L158 Benchmark]: Toolchain (without parser) took 13929.74ms. Allocated memory was 417.3MB in the beginning and 1.7GB in the end (delta: 1.3GB). Free memory was 360.1MB in the beginning and 1.4GB in the end (delta: -1.0GB). Peak memory consumption was 272.8MB. Max. memory is 16.0GB. [2022-01-19 11:14:35,719 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 417.3MB. Free memory is still 377.6MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 11:14:35,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.85ms. Allocated memory was 417.3MB in the beginning and 505.4MB in the end (delta: 88.1MB). Free memory was 359.9MB in the beginning and 461.4MB in the end (delta: -101.4MB). Peak memory consumption was 9.5MB. Max. memory is 16.0GB. [2022-01-19 11:14:35,720 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.85ms. Allocated memory is still 505.4MB. Free memory was 461.4MB in the beginning and 458.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-19 11:14:35,720 INFO L158 Benchmark]: Boogie Preprocessor took 21.30ms. Allocated memory is still 505.4MB. Free memory was 458.2MB in the beginning and 456.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 11:14:35,720 INFO L158 Benchmark]: RCFGBuilder took 824.22ms. Allocated memory is still 505.4MB. Free memory was 456.1MB in the beginning and 381.7MB in the end (delta: 74.4MB). Peak memory consumption was 73.4MB. Max. memory is 16.0GB. [2022-01-19 11:14:35,720 INFO L158 Benchmark]: TraceAbstraction took 12708.37ms. Allocated memory was 505.4MB in the beginning and 1.7GB in the end (delta: 1.2GB). Free memory was 380.6MB in the beginning and 1.4GB in the end (delta: -980.7MB). Peak memory consumption was 205.2MB. Max. memory is 16.0GB. [2022-01-19 11:14:35,721 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.09ms. Allocated memory is still 417.3MB. Free memory is still 377.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 335.85ms. Allocated memory was 417.3MB in the beginning and 505.4MB in the end (delta: 88.1MB). Free memory was 359.9MB in the beginning and 461.4MB in the end (delta: -101.4MB). Peak memory consumption was 9.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 35.85ms. Allocated memory is still 505.4MB. Free memory was 461.4MB in the beginning and 458.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 21.30ms. Allocated memory is still 505.4MB. Free memory was 458.2MB in the beginning and 456.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 824.22ms. Allocated memory is still 505.4MB. Free memory was 456.1MB in the beginning and 381.7MB in the end (delta: 74.4MB). Peak memory consumption was 73.4MB. Max. memory is 16.0GB. * TraceAbstraction took 12708.37ms. Allocated memory was 505.4MB in the beginning and 1.7GB in the end (delta: 1.2GB). Free memory was 380.6MB in the beginning and 1.4GB in the end (delta: -980.7MB). Peak memory consumption was 205.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L720] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L721] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L722] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L724] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L726] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L728] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L729] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L730] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L731] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L732] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L733] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L734] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L735] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L736] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L737] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L738] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L739] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L740] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L741] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L742] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L743] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L744] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L745] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L746] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L747] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L748] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1221; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1221, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1221, ((void *)0), P0, ((void *)0))=-3, t1221={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1222; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1222, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1222, ((void *)0), P1, ((void *)0))=-2, t1221={5:0}, t1222={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1223; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t1223, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1223, ((void *)0), P2, ((void *)0))=-1, t1221={5:0}, t1222={6:0}, t1223={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1224; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] FCALL, FORK 0 pthread_create(&t1224, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1224, ((void *)0), P3, ((void *)0))=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 173 locations, 7 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: 12.5s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1013 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1013 mSDsluCounter, 971 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1559 mSDsCounter, 366 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2640 IncrementalHoareTripleChecker+Invalid, 3006 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 366 mSolverCounterUnsat, 177 mSDtfsCounter, 2640 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 311 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1144occurred in iteration=16, InterpolantAutomatonStates: 233, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1984 NumberOfCodeBlocks, 1984 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1858 ConstructedInterpolants, 0 QuantifiedInterpolants, 10474 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 proved your program to be incorrect! [2022-01-19 11:14:35,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...