/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-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 04:48:22,466 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 04:48:22,468 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 04:48:22,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 04:48:22,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 04:48:22,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 04:48:22,542 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 04:48:22,544 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 04:48:22,545 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 04:48:22,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 04:48:22,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 04:48:22,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 04:48:22,551 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 04:48:22,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 04:48:22,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 04:48:22,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 04:48:22,556 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 04:48:22,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 04:48:22,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 04:48:22,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 04:48:22,563 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 04:48:22,563 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 04:48:22,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 04:48:22,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 04:48:22,569 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 04:48:22,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 04:48:22,570 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 04:48:22,571 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 04:48:22,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 04:48:22,571 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 04:48:22,571 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 04:48:22,572 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 04:48:22,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 04:48:22,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 04:48:22,574 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 04:48:22,574 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 04:48:22,575 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 04:48:22,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 04:48:22,575 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 04:48:22,575 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 04:48:22,576 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 04:48:22,576 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-Before.epf [2022-01-19 04:48:22,600 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 04:48:22,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 04:48:22,601 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 04:48:22,601 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 04:48:22,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 04:48:22,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 04:48:22,601 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 04:48:22,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 04:48:22,601 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 04:48:22,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 04:48:22,602 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 04:48:22,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 04:48:22,602 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 04:48:22,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 04:48:22,602 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 04:48:22,603 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 04:48:22,603 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 04:48:22,603 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 04:48:22,603 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 04:48:22,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 04:48:22,603 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 04:48:22,603 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 04:48:22,603 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 04:48:22,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:48:22,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 04:48:22,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 04:48:22,604 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 04:48:22,604 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 04:48:22,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 04:48:22,604 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 04:48:22,604 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 04:48:22,604 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 04:48:22,604 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 04:48:22,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 04:48:22,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 04:48:22,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 04:48:22,815 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 04:48:22,815 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 04:48:22,816 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.i [2022-01-19 04:48:22,876 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7ed63bfd/33a72d709e4c4cf19b9b26d2bfa62fe2/FLAGd463663ec [2022-01-19 04:48:23,257 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 04:48:23,257 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.i [2022-01-19 04:48:23,269 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7ed63bfd/33a72d709e4c4cf19b9b26d2bfa62fe2/FLAGd463663ec [2022-01-19 04:48:23,279 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7ed63bfd/33a72d709e4c4cf19b9b26d2bfa62fe2 [2022-01-19 04:48:23,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 04:48:23,281 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 04:48:23,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 04:48:23,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 04:48:23,284 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 04:48:23,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:48:23" (1/1) ... [2022-01-19 04:48:23,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f0447a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:48:23, skipping insertion in model container [2022-01-19 04:48:23,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:48:23" (1/1) ... [2022-01-19 04:48:23,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 04:48:23,324 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 04:48:23,445 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/mix027_tso.i[944,957] [2022-01-19 04:48:23,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:48:23,566 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 04:48:23,573 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/mix027_tso.i[944,957] [2022-01-19 04:48:23,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:48:23,646 INFO L208 MainTranslator]: Completed translation [2022-01-19 04:48:23,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:48:23 WrapperNode [2022-01-19 04:48:23,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 04:48:23,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 04:48:23,648 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 04:48:23,648 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 04:48:23,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:48:23" (1/1) ... [2022-01-19 04:48:23,682 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:48:23" (1/1) ... [2022-01-19 04:48:23,716 INFO L137 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 291 [2022-01-19 04:48:23,716 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 04:48:23,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 04:48:23,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 04:48:23,717 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 04:48:23,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:48:23" (1/1) ... [2022-01-19 04:48:23,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:48:23" (1/1) ... [2022-01-19 04:48:23,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:48:23" (1/1) ... [2022-01-19 04:48:23,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:48:23" (1/1) ... [2022-01-19 04:48:23,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:48:23" (1/1) ... [2022-01-19 04:48:23,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:48:23" (1/1) ... [2022-01-19 04:48:23,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:48:23" (1/1) ... [2022-01-19 04:48:23,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 04:48:23,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 04:48:23,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 04:48:23,766 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 04:48:23,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:48:23" (1/1) ... [2022-01-19 04:48:23,772 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:48:23,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:48:23,790 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 04:48:23,797 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 04:48:23,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 04:48:23,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 04:48:23,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 04:48:23,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 04:48:23,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 04:48:23,824 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-19 04:48:23,824 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-19 04:48:23,824 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-19 04:48:23,824 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-19 04:48:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-19 04:48:23,825 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-19 04:48:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-01-19 04:48:23,826 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-01-19 04:48:23,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 04:48:23,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 04:48:23,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 04:48:23,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 04:48:23,827 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 04:48:23,960 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 04:48:23,961 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 04:48:24,342 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 04:48:24,582 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 04:48:24,582 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 04:48:24,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:48:24 BoogieIcfgContainer [2022-01-19 04:48:24,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 04:48:24,586 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 04:48:24,586 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 04:48:24,589 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 04:48:24,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 04:48:23" (1/3) ... [2022-01-19 04:48:24,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c898502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:48:24, skipping insertion in model container [2022-01-19 04:48:24,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:48:23" (2/3) ... [2022-01-19 04:48:24,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c898502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:48:24, skipping insertion in model container [2022-01-19 04:48:24,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:48:24" (3/3) ... [2022-01-19 04:48:24,591 INFO L111 eAbstractionObserver]: Analyzing ICFG mix027_tso.i [2022-01-19 04:48:24,598 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 04:48:24,598 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 04:48:24,598 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 04:48:24,641 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,641 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,641 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,641 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,642 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,642 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,642 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,642 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,642 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,642 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,643 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,643 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,643 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,643 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,643 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,644 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,644 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,644 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,644 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,644 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,644 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,644 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,645 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,645 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,645 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,645 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,646 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,646 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,646 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,646 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,646 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,646 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,646 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,646 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,646 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,647 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,647 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,647 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,647 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,647 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,647 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,647 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,647 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,648 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,648 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,648 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,648 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,648 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,648 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,649 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,649 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,649 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,649 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,649 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,649 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,649 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,649 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,650 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,650 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,650 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,650 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,650 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,650 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,650 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,650 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,650 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,651 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,651 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,651 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,651 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,651 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,651 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,651 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,651 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,651 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,652 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,652 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,652 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,652 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,652 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,652 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,652 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,653 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,653 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,654 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,654 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,654 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,655 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,655 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,657 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,660 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,660 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,661 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,661 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,661 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,661 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,661 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,661 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,661 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,661 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,662 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,662 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,662 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,662 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,662 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,662 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,662 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,662 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,663 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,663 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,663 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,663 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,665 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,665 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,666 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,666 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,666 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,666 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,666 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,666 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,666 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,666 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,667 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,667 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,667 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,667 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,667 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,667 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,667 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,667 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,667 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,668 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,668 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,668 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,669 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,669 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,669 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,669 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,669 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,669 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,669 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,669 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,670 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,670 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,670 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,670 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,670 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,670 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,670 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,670 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,671 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,671 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,671 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,671 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:48:24,672 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 04:48:24,715 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 04:48:24,723 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 04:48:24,723 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-19 04:48:24,733 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-01-19 04:48:24,780 INFO L129 PetriNetUnfolder]: 2/133 cut-off events. [2022-01-19 04:48:24,780 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:48:24,783 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 73 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2022-01-19 04:48:24,783 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2022-01-19 04:48:24,789 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2022-01-19 04:48:24,809 INFO L129 PetriNetUnfolder]: 0/64 cut-off events. [2022-01-19 04:48:24,810 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:48:24,810 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:48:24,811 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] [2022-01-19 04:48:24,811 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:48:24,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:48:24,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1421907133, now seen corresponding path program 1 times [2022-01-19 04:48:24,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:48:24,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692560421] [2022-01-19 04:48:24,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:48:24,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:48:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:48:25,066 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 04:48:25,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:48:25,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692560421] [2022-01-19 04:48:25,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692560421] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:48:25,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:48:25,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 04:48:25,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688445341] [2022-01-19 04:48:25,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:48:25,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 04:48:25,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:48:25,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 04:48:25,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 04:48:25,106 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 137 [2022-01-19 04:48:25,111 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 133 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 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 04:48:25,112 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:48:25,112 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 137 [2022-01-19 04:48:25,113 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:48:25,380 INFO L129 PetriNetUnfolder]: 161/1031 cut-off events. [2022-01-19 04:48:25,381 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-01-19 04:48:25,386 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1333 conditions, 1031 events. 161/1031 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 6982 event pairs, 103 based on Foata normal form. 34/1000 useless extension candidates. Maximal degree in co-relation 1276. Up to 187 conditions per place. [2022-01-19 04:48:25,391 INFO L132 encePairwiseOnDemand]: 132/137 looper letters, 17 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2022-01-19 04:48:25,391 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 136 transitions, 328 flow [2022-01-19 04:48:25,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 04:48:25,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 04:48:25,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2022-01-19 04:48:25,405 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9416058394160584 [2022-01-19 04:48:25,406 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2022-01-19 04:48:25,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2022-01-19 04:48:25,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:48:25,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2022-01-19 04:48:25,421 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 04:48:25,426 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 04:48:25,426 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 04:48:25,427 INFO L186 Difference]: Start difference. First operand has 144 places, 133 transitions, 278 flow. Second operand 3 states and 387 transitions. [2022-01-19 04:48:25,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 136 transitions, 328 flow [2022-01-19 04:48:25,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 136 transitions, 322 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 04:48:25,432 INFO L242 Difference]: Finished difference. Result has 140 places, 129 transitions, 270 flow [2022-01-19 04:48:25,433 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 04:48:25,436 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, -4 predicate places. [2022-01-19 04:48:25,437 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 270 flow [2022-01-19 04:48:25,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 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 04:48:25,440 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:48:25,440 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] [2022-01-19 04:48:25,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 04:48:25,441 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:48:25,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:48:25,441 INFO L85 PathProgramCache]: Analyzing trace with hash 2065629017, now seen corresponding path program 1 times [2022-01-19 04:48:25,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:48:25,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835565962] [2022-01-19 04:48:25,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:48:25,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:48:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:48:25,629 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 04:48:25,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:48:25,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835565962] [2022-01-19 04:48:25,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835565962] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:48:25,629 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:48:25,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:48:25,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128944453] [2022-01-19 04:48:25,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:48:25,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:48:25,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:48:25,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:48:25,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:48:25,633 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-01-19 04:48:25,633 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 270 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 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 04:48:25,634 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:48:25,634 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-01-19 04:48:25,634 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:48:26,404 INFO L129 PetriNetUnfolder]: 2208/5490 cut-off events. [2022-01-19 04:48:26,404 INFO L130 PetriNetUnfolder]: For 308/308 co-relation queries the response was YES. [2022-01-19 04:48:26,419 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8992 conditions, 5490 events. 2208/5490 cut-off events. For 308/308 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 49010 event pairs, 516 based on Foata normal form. 0/5371 useless extension candidates. Maximal degree in co-relation 8936. Up to 1862 conditions per place. [2022-01-19 04:48:26,434 INFO L132 encePairwiseOnDemand]: 130/137 looper letters, 24 selfloop transitions, 3 changer transitions 62/184 dead transitions. [2022-01-19 04:48:26,434 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 184 transitions, 548 flow [2022-01-19 04:48:26,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:48:26,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:48:26,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1086 transitions. [2022-01-19 04:48:26,436 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8807785888077859 [2022-01-19 04:48:26,436 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1086 transitions. [2022-01-19 04:48:26,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1086 transitions. [2022-01-19 04:48:26,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:48:26,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1086 transitions. [2022-01-19 04:48:26,439 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 04:48:26,441 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 04:48:26,442 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 04:48:26,442 INFO L186 Difference]: Start difference. First operand has 140 places, 129 transitions, 270 flow. Second operand 9 states and 1086 transitions. [2022-01-19 04:48:26,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 184 transitions, 548 flow [2022-01-19 04:48:26,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 184 transitions, 530 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 04:48:26,447 INFO L242 Difference]: Finished difference. Result has 153 places, 117 transitions, 281 flow [2022-01-19 04:48:26,447 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=281, PETRI_PLACES=153, PETRI_TRANSITIONS=117} [2022-01-19 04:48:26,448 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 9 predicate places. [2022-01-19 04:48:26,448 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 117 transitions, 281 flow [2022-01-19 04:48:26,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 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 04:48:26,448 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:48:26,448 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] [2022-01-19 04:48:26,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 04:48:26,449 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:48:26,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:48:26,449 INFO L85 PathProgramCache]: Analyzing trace with hash 954989320, now seen corresponding path program 1 times [2022-01-19 04:48:26,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:48:26,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344975346] [2022-01-19 04:48:26,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:48:26,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:48:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:48:26,651 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 04:48:26,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:48:26,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344975346] [2022-01-19 04:48:26,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344975346] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:48:26,652 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:48:26,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:48:26,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341078357] [2022-01-19 04:48:26,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:48:26,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:48:26,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:48:26,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:48:26,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:48:26,654 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 137 [2022-01-19 04:48:26,654 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 117 transitions, 281 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 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 04:48:26,655 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:48:26,655 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 137 [2022-01-19 04:48:26,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:48:27,039 INFO L129 PetriNetUnfolder]: 1120/2139 cut-off events. [2022-01-19 04:48:27,039 INFO L130 PetriNetUnfolder]: For 1372/1384 co-relation queries the response was YES. [2022-01-19 04:48:27,049 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4797 conditions, 2139 events. 1120/2139 cut-off events. For 1372/1384 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 14198 event pairs, 201 based on Foata normal form. 66/2126 useless extension candidates. Maximal degree in co-relation 4734. Up to 757 conditions per place. [2022-01-19 04:48:27,056 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 21 selfloop transitions, 2 changer transitions 37/159 dead transitions. [2022-01-19 04:48:27,056 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 159 transitions, 503 flow [2022-01-19 04:48:27,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:48:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:48:27,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1088 transitions. [2022-01-19 04:48:27,058 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8824006488240065 [2022-01-19 04:48:27,058 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1088 transitions. [2022-01-19 04:48:27,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1088 transitions. [2022-01-19 04:48:27,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:48:27,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1088 transitions. [2022-01-19 04:48:27,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.88888888888889) internal successors, (1088), 9 states have internal predecessors, (1088), 0 states have call successors, (0), 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 04:48:27,062 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 04:48:27,063 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 04:48:27,063 INFO L186 Difference]: Start difference. First operand has 153 places, 117 transitions, 281 flow. Second operand 9 states and 1088 transitions. [2022-01-19 04:48:27,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 159 transitions, 503 flow [2022-01-19 04:48:27,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 159 transitions, 484 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-01-19 04:48:27,071 INFO L242 Difference]: Finished difference. Result has 144 places, 117 transitions, 290 flow [2022-01-19 04:48:27,072 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=290, PETRI_PLACES=144, PETRI_TRANSITIONS=117} [2022-01-19 04:48:27,072 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 0 predicate places. [2022-01-19 04:48:27,072 INFO L470 AbstractCegarLoop]: Abstraction has has 144 places, 117 transitions, 290 flow [2022-01-19 04:48:27,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 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 04:48:27,073 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:48:27,073 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] [2022-01-19 04:48:27,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 04:48:27,073 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:48:27,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:48:27,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1517397671, now seen corresponding path program 1 times [2022-01-19 04:48:27,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:48:27,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868738095] [2022-01-19 04:48:27,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:48:27,074 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:48:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:48:27,265 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 04:48:27,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:48:27,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868738095] [2022-01-19 04:48:27,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868738095] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:48:27,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:48:27,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 04:48:27,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830309604] [2022-01-19 04:48:27,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:48:27,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 04:48:27,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:48:27,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 04:48:27,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-19 04:48:27,271 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2022-01-19 04:48:27,272 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 117 transitions, 290 flow. Second operand has 10 states, 10 states have (on average 112.5) internal successors, (1125), 10 states have internal predecessors, (1125), 0 states have call successors, (0), 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 04:48:27,273 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:48:27,273 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2022-01-19 04:48:27,273 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:48:27,761 INFO L129 PetriNetUnfolder]: 1300/2478 cut-off events. [2022-01-19 04:48:27,761 INFO L130 PetriNetUnfolder]: For 2099/2149 co-relation queries the response was YES. [2022-01-19 04:48:27,772 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5683 conditions, 2478 events. 1300/2478 cut-off events. For 2099/2149 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 16195 event pairs, 255 based on Foata normal form. 58/2470 useless extension candidates. Maximal degree in co-relation 5612. Up to 1076 conditions per place. [2022-01-19 04:48:27,780 INFO L132 encePairwiseOnDemand]: 123/137 looper letters, 25 selfloop transitions, 12 changer transitions 52/185 dead transitions. [2022-01-19 04:48:27,780 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 185 transitions, 658 flow [2022-01-19 04:48:27,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 04:48:27,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 04:48:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1757 transitions. [2022-01-19 04:48:27,783 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8549878345498784 [2022-01-19 04:48:27,783 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1757 transitions. [2022-01-19 04:48:27,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1757 transitions. [2022-01-19 04:48:27,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:48:27,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1757 transitions. [2022-01-19 04:48:27,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 117.13333333333334) internal successors, (1757), 15 states have internal predecessors, (1757), 0 states have call successors, (0), 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 04:48:27,789 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 04:48:27,789 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 04:48:27,789 INFO L186 Difference]: Start difference. First operand has 144 places, 117 transitions, 290 flow. Second operand 15 states and 1757 transitions. [2022-01-19 04:48:27,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 185 transitions, 658 flow [2022-01-19 04:48:27,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 185 transitions, 614 flow, removed 20 selfloop flow, removed 8 redundant places. [2022-01-19 04:48:27,800 INFO L242 Difference]: Finished difference. Result has 155 places, 125 transitions, 384 flow [2022-01-19 04:48:27,801 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=384, PETRI_PLACES=155, PETRI_TRANSITIONS=125} [2022-01-19 04:48:27,801 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 11 predicate places. [2022-01-19 04:48:27,801 INFO L470 AbstractCegarLoop]: Abstraction has has 155 places, 125 transitions, 384 flow [2022-01-19 04:48:27,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 112.5) internal successors, (1125), 10 states have internal predecessors, (1125), 0 states have call successors, (0), 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 04:48:27,802 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:48:27,802 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] [2022-01-19 04:48:27,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 04:48:27,802 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:48:27,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:48:27,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1613543243, now seen corresponding path program 1 times [2022-01-19 04:48:27,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:48:27,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126839840] [2022-01-19 04:48:27,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:48:27,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:48:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:48:28,014 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 04:48:28,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:48:28,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126839840] [2022-01-19 04:48:28,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126839840] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:48:28,014 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:48:28,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 04:48:28,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268364660] [2022-01-19 04:48:28,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:48:28,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 04:48:28,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:48:28,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 04:48:28,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-19 04:48:28,016 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 137 [2022-01-19 04:48:28,017 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 125 transitions, 384 flow. Second operand has 10 states, 10 states have (on average 110.8) internal successors, (1108), 10 states have internal predecessors, (1108), 0 states have call successors, (0), 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 04:48:28,017 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:48:28,017 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 137 [2022-01-19 04:48:28,017 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:48:28,473 INFO L129 PetriNetUnfolder]: 1097/2256 cut-off events. [2022-01-19 04:48:28,473 INFO L130 PetriNetUnfolder]: For 7600/8267 co-relation queries the response was YES. [2022-01-19 04:48:28,484 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8506 conditions, 2256 events. 1097/2256 cut-off events. For 7600/8267 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 14552 event pairs, 547 based on Foata normal form. 50/2216 useless extension candidates. Maximal degree in co-relation 8424. Up to 1030 conditions per place. [2022-01-19 04:48:28,494 INFO L132 encePairwiseOnDemand]: 124/137 looper letters, 28 selfloop transitions, 14 changer transitions 35/171 dead transitions. [2022-01-19 04:48:28,494 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 171 transitions, 880 flow [2022-01-19 04:48:28,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 04:48:28,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 04:48:28,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1491 transitions. [2022-01-19 04:48:28,497 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.837170129140932 [2022-01-19 04:48:28,497 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1491 transitions. [2022-01-19 04:48:28,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1491 transitions. [2022-01-19 04:48:28,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:48:28,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1491 transitions. [2022-01-19 04:48:28,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 114.6923076923077) internal successors, (1491), 13 states have internal predecessors, (1491), 0 states have call successors, (0), 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 04:48:28,502 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 04:48:28,503 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 04:48:28,503 INFO L186 Difference]: Start difference. First operand has 155 places, 125 transitions, 384 flow. Second operand 13 states and 1491 transitions. [2022-01-19 04:48:28,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 171 transitions, 880 flow [2022-01-19 04:48:28,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 171 transitions, 862 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-01-19 04:48:28,512 INFO L242 Difference]: Finished difference. Result has 160 places, 128 transitions, 482 flow [2022-01-19 04:48:28,512 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=482, PETRI_PLACES=160, PETRI_TRANSITIONS=128} [2022-01-19 04:48:28,513 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 16 predicate places. [2022-01-19 04:48:28,513 INFO L470 AbstractCegarLoop]: Abstraction has has 160 places, 128 transitions, 482 flow [2022-01-19 04:48:28,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.8) internal successors, (1108), 10 states have internal predecessors, (1108), 0 states have call successors, (0), 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 04:48:28,513 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:48:28,514 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] [2022-01-19 04:48:28,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 04:48:28,514 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:48:28,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:48:28,514 INFO L85 PathProgramCache]: Analyzing trace with hash -693816265, now seen corresponding path program 1 times [2022-01-19 04:48:28,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:48:28,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814407565] [2022-01-19 04:48:28,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:48:28,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:48:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:48:28,626 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 04:48:28,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:48:28,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814407565] [2022-01-19 04:48:28,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814407565] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:48:28,627 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:48:28,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 04:48:28,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972875827] [2022-01-19 04:48:28,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:48:28,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 04:48:28,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:48:28,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 04:48:28,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-19 04:48:28,629 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-01-19 04:48:28,631 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 128 transitions, 482 flow. Second operand has 9 states, 9 states have (on average 113.66666666666667) internal successors, (1023), 9 states have internal predecessors, (1023), 0 states have call successors, (0), 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 04:48:28,631 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:48:28,631 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-01-19 04:48:28,631 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:48:29,146 INFO L129 PetriNetUnfolder]: 1067/2382 cut-off events. [2022-01-19 04:48:29,146 INFO L130 PetriNetUnfolder]: For 18495/19140 co-relation queries the response was YES. [2022-01-19 04:48:29,162 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11444 conditions, 2382 events. 1067/2382 cut-off events. For 18495/19140 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 16098 event pairs, 302 based on Foata normal form. 46/2342 useless extension candidates. Maximal degree in co-relation 11358. Up to 843 conditions per place. [2022-01-19 04:48:29,181 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 41 selfloop transitions, 9 changer transitions 46/193 dead transitions. [2022-01-19 04:48:29,181 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 193 transitions, 1384 flow [2022-01-19 04:48:29,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 04:48:29,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 04:48:29,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1657 transitions. [2022-01-19 04:48:29,184 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8639207507820647 [2022-01-19 04:48:29,184 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1657 transitions. [2022-01-19 04:48:29,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1657 transitions. [2022-01-19 04:48:29,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:48:29,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1657 transitions. [2022-01-19 04:48:29,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 118.35714285714286) internal successors, (1657), 14 states have internal predecessors, (1657), 0 states have call successors, (0), 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 04:48:29,192 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 04:48:29,193 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 04:48:29,193 INFO L186 Difference]: Start difference. First operand has 160 places, 128 transitions, 482 flow. Second operand 14 states and 1657 transitions. [2022-01-19 04:48:29,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 193 transitions, 1384 flow [2022-01-19 04:48:29,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 193 transitions, 1323 flow, removed 21 selfloop flow, removed 8 redundant places. [2022-01-19 04:48:29,209 INFO L242 Difference]: Finished difference. Result has 169 places, 132 transitions, 554 flow [2022-01-19 04:48:29,209 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=554, PETRI_PLACES=169, PETRI_TRANSITIONS=132} [2022-01-19 04:48:29,210 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 25 predicate places. [2022-01-19 04:48:29,210 INFO L470 AbstractCegarLoop]: Abstraction has has 169 places, 132 transitions, 554 flow [2022-01-19 04:48:29,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.66666666666667) internal successors, (1023), 9 states have internal predecessors, (1023), 0 states have call successors, (0), 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 04:48:29,211 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:48:29,211 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 04:48:29,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 04:48:29,211 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:48:29,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:48:29,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1659524979, now seen corresponding path program 1 times [2022-01-19 04:48:29,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:48:29,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953127296] [2022-01-19 04:48:29,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:48:29,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:48:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:48:29,356 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 04:48:29,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:48:29,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953127296] [2022-01-19 04:48:29,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953127296] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:48:29,357 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:48:29,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 04:48:29,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766105302] [2022-01-19 04:48:29,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:48:29,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 04:48:29,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:48:29,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 04:48:29,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-01-19 04:48:29,359 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2022-01-19 04:48:29,360 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 132 transitions, 554 flow. Second operand has 11 states, 11 states have (on average 111.63636363636364) internal successors, (1228), 11 states have internal predecessors, (1228), 0 states have call successors, (0), 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 04:48:29,360 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:48:29,360 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2022-01-19 04:48:29,360 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:48:29,983 INFO L129 PetriNetUnfolder]: 1234/2885 cut-off events. [2022-01-19 04:48:29,984 INFO L130 PetriNetUnfolder]: For 38118/39555 co-relation queries the response was YES. [2022-01-19 04:48:30,001 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17684 conditions, 2885 events. 1234/2885 cut-off events. For 38118/39555 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 21756 event pairs, 202 based on Foata normal form. 68/2877 useless extension candidates. Maximal degree in co-relation 17591. Up to 942 conditions per place. [2022-01-19 04:48:30,018 INFO L132 encePairwiseOnDemand]: 125/137 looper letters, 37 selfloop transitions, 13 changer transitions 37/182 dead transitions. [2022-01-19 04:48:30,018 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 182 transitions, 1520 flow [2022-01-19 04:48:30,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 04:48:30,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 04:48:30,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1504 transitions. [2022-01-19 04:48:30,021 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8444693992139247 [2022-01-19 04:48:30,021 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1504 transitions. [2022-01-19 04:48:30,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1504 transitions. [2022-01-19 04:48:30,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:48:30,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1504 transitions. [2022-01-19 04:48:30,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 115.6923076923077) internal successors, (1504), 13 states have internal predecessors, (1504), 0 states have call successors, (0), 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 04:48:30,026 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 04:48:30,027 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 04:48:30,027 INFO L186 Difference]: Start difference. First operand has 169 places, 132 transitions, 554 flow. Second operand 13 states and 1504 transitions. [2022-01-19 04:48:30,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 182 transitions, 1520 flow [2022-01-19 04:48:30,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 182 transitions, 1267 flow, removed 120 selfloop flow, removed 11 redundant places. [2022-01-19 04:48:30,053 INFO L242 Difference]: Finished difference. Result has 168 places, 135 transitions, 601 flow [2022-01-19 04:48:30,054 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=601, PETRI_PLACES=168, PETRI_TRANSITIONS=135} [2022-01-19 04:48:30,054 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 24 predicate places. [2022-01-19 04:48:30,054 INFO L470 AbstractCegarLoop]: Abstraction has has 168 places, 135 transitions, 601 flow [2022-01-19 04:48:30,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 111.63636363636364) internal successors, (1228), 11 states have internal predecessors, (1228), 0 states have call successors, (0), 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 04:48:30,055 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:48:30,055 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 04:48:30,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 04:48:30,055 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:48:30,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:48:30,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1597986154, now seen corresponding path program 1 times [2022-01-19 04:48:30,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:48:30,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004063649] [2022-01-19 04:48:30,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:48:30,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:48:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:48:30,130 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 04:48:30,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:48:30,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004063649] [2022-01-19 04:48:30,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004063649] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:48:30,130 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:48:30,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:48:30,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034714999] [2022-01-19 04:48:30,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:48:30,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:48:30,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:48:30,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:48:30,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:48:30,132 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2022-01-19 04:48:30,132 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 135 transitions, 601 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 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 04:48:30,132 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:48:30,132 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2022-01-19 04:48:30,132 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:48:32,100 INFO L129 PetriNetUnfolder]: 9029/15647 cut-off events. [2022-01-19 04:48:32,101 INFO L130 PetriNetUnfolder]: For 213954/217418 co-relation queries the response was YES. [2022-01-19 04:48:32,257 INFO L84 FinitePrefix]: Finished finitePrefix Result has 76917 conditions, 15647 events. 9029/15647 cut-off events. For 213954/217418 co-relation queries the response was YES. Maximal size of possible extension queue 961. Compared 127102 event pairs, 416 based on Foata normal form. 251/15369 useless extension candidates. Maximal degree in co-relation 76827. Up to 5572 conditions per place. [2022-01-19 04:48:32,323 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 151 selfloop transitions, 20 changer transitions 19/287 dead transitions. [2022-01-19 04:48:32,323 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 287 transitions, 2586 flow [2022-01-19 04:48:32,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:48:32,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:48:32,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1200 transitions. [2022-01-19 04:48:32,325 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8759124087591241 [2022-01-19 04:48:32,325 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1200 transitions. [2022-01-19 04:48:32,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1200 transitions. [2022-01-19 04:48:32,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:48:32,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1200 transitions. [2022-01-19 04:48:32,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 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 04:48:32,329 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 04:48:32,330 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 04:48:32,330 INFO L186 Difference]: Start difference. First operand has 168 places, 135 transitions, 601 flow. Second operand 10 states and 1200 transitions. [2022-01-19 04:48:32,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 287 transitions, 2586 flow [2022-01-19 04:48:32,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 287 transitions, 2330 flow, removed 102 selfloop flow, removed 11 redundant places. [2022-01-19 04:48:32,395 INFO L242 Difference]: Finished difference. Result has 166 places, 153 transitions, 691 flow [2022-01-19 04:48:32,396 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=691, PETRI_PLACES=166, PETRI_TRANSITIONS=153} [2022-01-19 04:48:32,398 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 22 predicate places. [2022-01-19 04:48:32,398 INFO L470 AbstractCegarLoop]: Abstraction has has 166 places, 153 transitions, 691 flow [2022-01-19 04:48:32,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 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 04:48:32,399 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:48:32,399 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 04:48:32,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 04:48:32,399 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:48:32,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:48:32,399 INFO L85 PathProgramCache]: Analyzing trace with hash 377017635, now seen corresponding path program 1 times [2022-01-19 04:48:32,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:48:32,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994890848] [2022-01-19 04:48:32,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:48:32,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:48:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:48:32,488 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 04:48:32,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:48:32,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994890848] [2022-01-19 04:48:32,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994890848] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:48:32,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:48:32,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:48:32,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63591698] [2022-01-19 04:48:32,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:48:32,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:48:32,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:48:32,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:48:32,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:48:32,490 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2022-01-19 04:48:32,490 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 153 transitions, 691 flow. Second operand has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 0 states have call successors, (0), 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 04:48:32,490 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:48:32,490 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2022-01-19 04:48:32,491 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:48:34,480 INFO L129 PetriNetUnfolder]: 8128/14932 cut-off events. [2022-01-19 04:48:34,480 INFO L130 PetriNetUnfolder]: For 144709/148208 co-relation queries the response was YES. [2022-01-19 04:48:34,543 INFO L84 FinitePrefix]: Finished finitePrefix Result has 73456 conditions, 14932 events. 8128/14932 cut-off events. For 144709/148208 co-relation queries the response was YES. Maximal size of possible extension queue 1011. Compared 130088 event pairs, 265 based on Foata normal form. 488/15136 useless extension candidates. Maximal degree in co-relation 73368. Up to 3312 conditions per place. [2022-01-19 04:48:34,591 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 173 selfloop transitions, 38 changer transitions 30/338 dead transitions. [2022-01-19 04:48:34,591 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 338 transitions, 3181 flow [2022-01-19 04:48:34,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 04:48:34,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 04:48:34,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1564 transitions. [2022-01-19 04:48:34,594 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8781583380123527 [2022-01-19 04:48:34,594 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1564 transitions. [2022-01-19 04:48:34,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1564 transitions. [2022-01-19 04:48:34,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:48:34,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1564 transitions. [2022-01-19 04:48:34,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 120.3076923076923) internal successors, (1564), 13 states have internal predecessors, (1564), 0 states have call successors, (0), 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 04:48:34,599 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 04:48:34,600 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 04:48:34,600 INFO L186 Difference]: Start difference. First operand has 166 places, 153 transitions, 691 flow. Second operand 13 states and 1564 transitions. [2022-01-19 04:48:34,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 338 transitions, 3181 flow [2022-01-19 04:48:34,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 338 transitions, 3179 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 04:48:34,700 INFO L242 Difference]: Finished difference. Result has 183 places, 172 transitions, 976 flow [2022-01-19 04:48:34,700 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=976, PETRI_PLACES=183, PETRI_TRANSITIONS=172} [2022-01-19 04:48:34,701 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 39 predicate places. [2022-01-19 04:48:34,701 INFO L470 AbstractCegarLoop]: Abstraction has has 183 places, 172 transitions, 976 flow [2022-01-19 04:48:34,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 0 states have call successors, (0), 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 04:48:34,702 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:48:34,702 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] [2022-01-19 04:48:34,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 04:48:34,702 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:48:34,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:48:34,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1408953923, now seen corresponding path program 1 times [2022-01-19 04:48:34,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:48:34,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398307677] [2022-01-19 04:48:34,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:48:34,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:48:34,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:48:34,835 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 04:48:34,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:48:34,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398307677] [2022-01-19 04:48:34,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398307677] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:48:34,837 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:48:34,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 04:48:34,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870463049] [2022-01-19 04:48:34,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:48:34,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 04:48:34,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:48:34,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 04:48:34,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-19 04:48:34,839 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 137 [2022-01-19 04:48:34,840 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 172 transitions, 976 flow. Second operand has 12 states, 12 states have (on average 108.83333333333333) internal successors, (1306), 12 states have internal predecessors, (1306), 0 states have call successors, (0), 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 04:48:34,840 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:48:34,840 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 137 [2022-01-19 04:48:34,841 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:48:36,703 INFO L129 PetriNetUnfolder]: 3491/11613 cut-off events. [2022-01-19 04:48:36,703 INFO L130 PetriNetUnfolder]: For 59980/68373 co-relation queries the response was YES. [2022-01-19 04:48:36,770 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47307 conditions, 11613 events. 3491/11613 cut-off events. For 59980/68373 co-relation queries the response was YES. Maximal size of possible extension queue 1145. Compared 144734 event pairs, 246 based on Foata normal form. 201/11113 useless extension candidates. Maximal degree in co-relation 47206. Up to 2746 conditions per place. [2022-01-19 04:48:36,819 INFO L132 encePairwiseOnDemand]: 123/137 looper letters, 137 selfloop transitions, 40 changer transitions 1/309 dead transitions. [2022-01-19 04:48:36,820 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 309 transitions, 2934 flow [2022-01-19 04:48:36,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 04:48:36,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 04:48:36,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1949 transitions. [2022-01-19 04:48:36,823 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.836839845427222 [2022-01-19 04:48:36,823 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1949 transitions. [2022-01-19 04:48:36,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1949 transitions. [2022-01-19 04:48:36,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:48:36,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1949 transitions. [2022-01-19 04:48:36,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 114.6470588235294) internal successors, (1949), 17 states have internal predecessors, (1949), 0 states have call successors, (0), 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 04:48:36,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 137.0) internal successors, (2466), 18 states have internal predecessors, (2466), 0 states have call successors, (0), 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 04:48:36,830 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 137.0) internal successors, (2466), 18 states have internal predecessors, (2466), 0 states have call successors, (0), 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 04:48:36,830 INFO L186 Difference]: Start difference. First operand has 183 places, 172 transitions, 976 flow. Second operand 17 states and 1949 transitions. [2022-01-19 04:48:36,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 309 transitions, 2934 flow [2022-01-19 04:48:37,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 309 transitions, 2839 flow, removed 38 selfloop flow, removed 4 redundant places. [2022-01-19 04:48:37,451 INFO L242 Difference]: Finished difference. Result has 205 places, 203 transitions, 1339 flow [2022-01-19 04:48:37,451 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1339, PETRI_PLACES=205, PETRI_TRANSITIONS=203} [2022-01-19 04:48:37,451 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 61 predicate places. [2022-01-19 04:48:37,451 INFO L470 AbstractCegarLoop]: Abstraction has has 205 places, 203 transitions, 1339 flow [2022-01-19 04:48:37,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 108.83333333333333) internal successors, (1306), 12 states have internal predecessors, (1306), 0 states have call successors, (0), 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 04:48:37,455 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:48:37,455 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] [2022-01-19 04:48:37,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 04:48:37,456 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:48:37,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:48:37,456 INFO L85 PathProgramCache]: Analyzing trace with hash -923004269, now seen corresponding path program 2 times [2022-01-19 04:48:37,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:48:37,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743208733] [2022-01-19 04:48:37,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:48:37,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:48:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:48:37,735 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 04:48:37,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:48:37,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743208733] [2022-01-19 04:48:37,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743208733] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:48:37,735 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:48:37,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-19 04:48:37,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957146589] [2022-01-19 04:48:37,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:48:37,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 04:48:37,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:48:37,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 04:48:37,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-19 04:48:37,737 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 137 [2022-01-19 04:48:37,738 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 203 transitions, 1339 flow. Second operand has 14 states, 14 states have (on average 110.42857142857143) internal successors, (1546), 14 states have internal predecessors, (1546), 0 states have call successors, (0), 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 04:48:37,738 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:48:37,739 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 137 [2022-01-19 04:48:37,739 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:48:39,455 INFO L129 PetriNetUnfolder]: 3328/11185 cut-off events. [2022-01-19 04:48:39,455 INFO L130 PetriNetUnfolder]: For 61590/64987 co-relation queries the response was YES. [2022-01-19 04:48:39,545 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43946 conditions, 11185 events. 3328/11185 cut-off events. For 61590/64987 co-relation queries the response was YES. Maximal size of possible extension queue 1146. Compared 140929 event pairs, 334 based on Foata normal form. 200/10661 useless extension candidates. Maximal degree in co-relation 43833. Up to 1933 conditions per place. [2022-01-19 04:48:39,596 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 72 selfloop transitions, 34 changer transitions 9/253 dead transitions. [2022-01-19 04:48:39,596 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 253 transitions, 2309 flow [2022-01-19 04:48:39,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 04:48:39,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 04:48:39,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1596 transitions. [2022-01-19 04:48:39,600 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8321167883211679 [2022-01-19 04:48:39,600 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1596 transitions. [2022-01-19 04:48:39,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1596 transitions. [2022-01-19 04:48:39,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:48:39,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1596 transitions. [2022-01-19 04:48:39,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 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 04:48:39,606 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 04:48:39,607 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 04:48:39,607 INFO L186 Difference]: Start difference. First operand has 205 places, 203 transitions, 1339 flow. Second operand 14 states and 1596 transitions. [2022-01-19 04:48:39,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 253 transitions, 2309 flow [2022-01-19 04:48:39,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 253 transitions, 2164 flow, removed 71 selfloop flow, removed 2 redundant places. [2022-01-19 04:48:39,987 INFO L242 Difference]: Finished difference. Result has 221 places, 213 transitions, 1455 flow [2022-01-19 04:48:39,988 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1455, PETRI_PLACES=221, PETRI_TRANSITIONS=213} [2022-01-19 04:48:39,988 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 77 predicate places. [2022-01-19 04:48:39,988 INFO L470 AbstractCegarLoop]: Abstraction has has 221 places, 213 transitions, 1455 flow [2022-01-19 04:48:39,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 110.42857142857143) internal successors, (1546), 14 states have internal predecessors, (1546), 0 states have call successors, (0), 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 04:48:39,989 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:48:39,989 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] [2022-01-19 04:48:39,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 04:48:39,990 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:48:39,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:48:39,990 INFO L85 PathProgramCache]: Analyzing trace with hash 111988404, now seen corresponding path program 1 times [2022-01-19 04:48:39,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:48:39,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696444287] [2022-01-19 04:48:39,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:48:39,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:48:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:48:40,108 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 04:48:40,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:48:40,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696444287] [2022-01-19 04:48:40,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696444287] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:48:40,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:48:40,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 04:48:40,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405279677] [2022-01-19 04:48:40,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:48:40,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 04:48:40,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:48:40,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 04:48:40,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 04:48:40,110 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2022-01-19 04:48:40,160 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 213 transitions, 1455 flow. Second operand has 8 states, 8 states have (on average 112.25) internal successors, (898), 8 states have internal predecessors, (898), 0 states have call successors, (0), 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 04:48:40,160 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:48:40,161 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2022-01-19 04:48:40,161 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:48:44,991 INFO L129 PetriNetUnfolder]: 17610/32781 cut-off events. [2022-01-19 04:48:44,991 INFO L130 PetriNetUnfolder]: For 398449/406962 co-relation queries the response was YES. [2022-01-19 04:48:45,328 INFO L84 FinitePrefix]: Finished finitePrefix Result has 175253 conditions, 32781 events. 17610/32781 cut-off events. For 398449/406962 co-relation queries the response was YES. Maximal size of possible extension queue 2125. Compared 324450 event pairs, 406 based on Foata normal form. 1355/33637 useless extension candidates. Maximal degree in co-relation 175136. Up to 7020 conditions per place. [2022-01-19 04:48:45,392 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 244 selfloop transitions, 59 changer transitions 118/523 dead transitions. [2022-01-19 04:48:45,393 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 523 transitions, 6209 flow [2022-01-19 04:48:45,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 04:48:45,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 04:48:45,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1926 transitions. [2022-01-19 04:48:45,395 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8786496350364964 [2022-01-19 04:48:45,395 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1926 transitions. [2022-01-19 04:48:45,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1926 transitions. [2022-01-19 04:48:45,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:48:45,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1926 transitions. [2022-01-19 04:48:45,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 120.375) internal successors, (1926), 16 states have internal predecessors, (1926), 0 states have call successors, (0), 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 04:48:45,399 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 04:48:45,399 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 04:48:45,399 INFO L186 Difference]: Start difference. First operand has 221 places, 213 transitions, 1455 flow. Second operand 16 states and 1926 transitions. [2022-01-19 04:48:45,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 523 transitions, 6209 flow [2022-01-19 04:48:47,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 523 transitions, 5859 flow, removed 130 selfloop flow, removed 10 redundant places. [2022-01-19 04:48:47,408 INFO L242 Difference]: Finished difference. Result has 231 places, 214 transitions, 1532 flow [2022-01-19 04:48:47,408 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1532, PETRI_PLACES=231, PETRI_TRANSITIONS=214} [2022-01-19 04:48:47,409 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 87 predicate places. [2022-01-19 04:48:47,409 INFO L470 AbstractCegarLoop]: Abstraction has has 231 places, 214 transitions, 1532 flow [2022-01-19 04:48:47,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.25) internal successors, (898), 8 states have internal predecessors, (898), 0 states have call successors, (0), 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 04:48:47,409 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:48:47,409 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] [2022-01-19 04:48:47,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 04:48:47,409 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:48:47,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:48:47,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1578018289, now seen corresponding path program 1 times [2022-01-19 04:48:47,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:48:47,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412694605] [2022-01-19 04:48:47,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:48:47,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:48:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:48:47,499 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 04:48:47,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:48:47,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412694605] [2022-01-19 04:48:47,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412694605] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:48:47,499 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:48:47,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 04:48:47,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196749820] [2022-01-19 04:48:47,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:48:47,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 04:48:47,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:48:47,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 04:48:47,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-19 04:48:47,501 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2022-01-19 04:48:47,502 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 214 transitions, 1532 flow. Second operand has 9 states, 9 states have (on average 112.22222222222223) internal successors, (1010), 9 states have internal predecessors, (1010), 0 states have call successors, (0), 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 04:48:47,502 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:48:47,502 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2022-01-19 04:48:47,502 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:48:52,409 INFO L129 PetriNetUnfolder]: 17420/32312 cut-off events. [2022-01-19 04:48:52,410 INFO L130 PetriNetUnfolder]: For 412281/420011 co-relation queries the response was YES. [2022-01-19 04:48:52,721 INFO L84 FinitePrefix]: Finished finitePrefix Result has 182746 conditions, 32312 events. 17420/32312 cut-off events. For 412281/420011 co-relation queries the response was YES. Maximal size of possible extension queue 2132. Compared 322111 event pairs, 333 based on Foata normal form. 1072/32918 useless extension candidates. Maximal degree in co-relation 182696. Up to 7033 conditions per place. [2022-01-19 04:48:52,786 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 225 selfloop transitions, 64 changer transitions 102/493 dead transitions. [2022-01-19 04:48:52,786 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 493 transitions, 5561 flow [2022-01-19 04:48:52,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-19 04:48:52,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-01-19 04:48:52,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2244 transitions. [2022-01-19 04:48:52,788 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8620822128313484 [2022-01-19 04:48:52,788 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2244 transitions. [2022-01-19 04:48:52,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2244 transitions. [2022-01-19 04:48:52,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:48:52,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2244 transitions. [2022-01-19 04:48:52,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 118.10526315789474) internal successors, (2244), 19 states have internal predecessors, (2244), 0 states have call successors, (0), 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 04:48:52,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 137.0) internal successors, (2740), 20 states have internal predecessors, (2740), 0 states have call successors, (0), 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 04:48:52,793 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 137.0) internal successors, (2740), 20 states have internal predecessors, (2740), 0 states have call successors, (0), 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 04:48:52,793 INFO L186 Difference]: Start difference. First operand has 231 places, 214 transitions, 1532 flow. Second operand 19 states and 2244 transitions. [2022-01-19 04:48:52,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 493 transitions, 5561 flow [2022-01-19 04:48:58,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 493 transitions, 4712 flow, removed 264 selfloop flow, removed 22 redundant places. [2022-01-19 04:48:58,245 INFO L242 Difference]: Finished difference. Result has 222 places, 210 transitions, 1314 flow [2022-01-19 04:48:58,246 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1157, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1314, PETRI_PLACES=222, PETRI_TRANSITIONS=210} [2022-01-19 04:48:58,246 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 78 predicate places. [2022-01-19 04:48:58,246 INFO L470 AbstractCegarLoop]: Abstraction has has 222 places, 210 transitions, 1314 flow [2022-01-19 04:48:58,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.22222222222223) internal successors, (1010), 9 states have internal predecessors, (1010), 0 states have call successors, (0), 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 04:48:58,247 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:48:58,247 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 04:48:58,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 04:48:58,247 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:48:58,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:48:58,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1050054001, now seen corresponding path program 1 times [2022-01-19 04:48:58,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:48:58,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898210657] [2022-01-19 04:48:58,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:48:58,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:48:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:48:58,334 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 04:48:58,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:48:58,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898210657] [2022-01-19 04:48:58,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898210657] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:48:58,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:48:58,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:48:58,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338711515] [2022-01-19 04:48:58,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:48:58,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:48:58,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:48:58,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:48:58,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:48:58,335 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-01-19 04:48:58,336 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 210 transitions, 1314 flow. Second operand has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 0 states have call successors, (0), 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 04:48:58,336 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:48:58,336 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-01-19 04:48:58,336 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:49:00,187 INFO L129 PetriNetUnfolder]: 4862/15940 cut-off events. [2022-01-19 04:49:00,187 INFO L130 PetriNetUnfolder]: For 51446/53490 co-relation queries the response was YES. [2022-01-19 04:49:00,322 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56745 conditions, 15940 events. 4862/15940 cut-off events. For 51446/53490 co-relation queries the response was YES. Maximal size of possible extension queue 1852. Compared 220552 event pairs, 61 based on Foata normal form. 23/15207 useless extension candidates. Maximal degree in co-relation 56702. Up to 1486 conditions per place. [2022-01-19 04:49:00,364 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 72 selfloop transitions, 2 changer transitions 6/249 dead transitions. [2022-01-19 04:49:00,364 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 249 transitions, 1824 flow [2022-01-19 04:49:00,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 04:49:00,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 04:49:00,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 821 transitions. [2022-01-19 04:49:00,366 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8561001042752867 [2022-01-19 04:49:00,366 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 821 transitions. [2022-01-19 04:49:00,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 821 transitions. [2022-01-19 04:49:00,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:49:00,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 821 transitions. [2022-01-19 04:49:00,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 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 04:49:00,368 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 04:49:00,368 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 04:49:00,368 INFO L186 Difference]: Start difference. First operand has 222 places, 210 transitions, 1314 flow. Second operand 7 states and 821 transitions. [2022-01-19 04:49:00,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 249 transitions, 1824 flow [2022-01-19 04:49:02,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 249 transitions, 1521 flow, removed 91 selfloop flow, removed 23 redundant places. [2022-01-19 04:49:02,086 INFO L242 Difference]: Finished difference. Result has 207 places, 211 transitions, 1118 flow [2022-01-19 04:49:02,087 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1099, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1118, PETRI_PLACES=207, PETRI_TRANSITIONS=211} [2022-01-19 04:49:02,087 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 63 predicate places. [2022-01-19 04:49:02,087 INFO L470 AbstractCegarLoop]: Abstraction has has 207 places, 211 transitions, 1118 flow [2022-01-19 04:49:02,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 0 states have call successors, (0), 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 04:49:02,087 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:49:02,088 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 04:49:02,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 04:49:02,088 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:49:02,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:49:02,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2057706717, now seen corresponding path program 2 times [2022-01-19 04:49:02,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:49:02,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709842228] [2022-01-19 04:49:02,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:49:02,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:49:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:49:02,174 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 04:49:02,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:49:02,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709842228] [2022-01-19 04:49:02,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709842228] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:49:02,175 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:49:02,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:49:02,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563767201] [2022-01-19 04:49:02,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:49:02,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:49:02,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:49:02,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:49:02,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:49:02,176 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-01-19 04:49:02,176 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 211 transitions, 1118 flow. Second operand has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 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 04:49:02,176 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:49:02,176 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-01-19 04:49:02,176 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:49:04,937 INFO L129 PetriNetUnfolder]: 9013/29472 cut-off events. [2022-01-19 04:49:04,937 INFO L130 PetriNetUnfolder]: For 50570/51852 co-relation queries the response was YES. [2022-01-19 04:49:05,177 INFO L84 FinitePrefix]: Finished finitePrefix Result has 86618 conditions, 29472 events. 9013/29472 cut-off events. For 50570/51852 co-relation queries the response was YES. Maximal size of possible extension queue 3764. Compared 448950 event pairs, 152 based on Foata normal form. 66/27796 useless extension candidates. Maximal degree in co-relation 86582. Up to 2849 conditions per place. [2022-01-19 04:49:05,200 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 30 selfloop transitions, 2 changer transitions 51/244 dead transitions. [2022-01-19 04:49:05,201 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 244 transitions, 1505 flow [2022-01-19 04:49:05,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 04:49:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 04:49:05,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 706 transitions. [2022-01-19 04:49:05,202 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8588807785888077 [2022-01-19 04:49:05,202 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 706 transitions. [2022-01-19 04:49:05,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 706 transitions. [2022-01-19 04:49:05,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:49:05,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 706 transitions. [2022-01-19 04:49:05,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 states have internal predecessors, (706), 0 states have call successors, (0), 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 04:49:05,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 137.0) internal successors, (959), 7 states have internal predecessors, (959), 0 states have call successors, (0), 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 04:49:05,203 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 137.0) internal successors, (959), 7 states have internal predecessors, (959), 0 states have call successors, (0), 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 04:49:05,203 INFO L186 Difference]: Start difference. First operand has 207 places, 211 transitions, 1118 flow. Second operand 6 states and 706 transitions. [2022-01-19 04:49:05,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 244 transitions, 1505 flow [2022-01-19 04:49:10,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 244 transitions, 1494 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-01-19 04:49:10,068 INFO L242 Difference]: Finished difference. Result has 209 places, 188 transitions, 946 flow [2022-01-19 04:49:10,068 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=946, PETRI_PLACES=209, PETRI_TRANSITIONS=188} [2022-01-19 04:49:10,068 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 65 predicate places. [2022-01-19 04:49:10,068 INFO L470 AbstractCegarLoop]: Abstraction has has 209 places, 188 transitions, 946 flow [2022-01-19 04:49:10,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 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 04:49:10,069 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:49:10,069 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 04:49:10,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 04:49:10,069 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:49:10,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:49:10,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1901245257, now seen corresponding path program 3 times [2022-01-19 04:49:10,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:49:10,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586814398] [2022-01-19 04:49:10,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:49:10,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:49:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:49:10,280 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 04:49:10,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:49:10,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586814398] [2022-01-19 04:49:10,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586814398] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:49:10,281 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:49:10,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-19 04:49:10,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056531300] [2022-01-19 04:49:10,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:49:10,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 04:49:10,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:49:10,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 04:49:10,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-01-19 04:49:10,283 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 137 [2022-01-19 04:49:10,284 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 188 transitions, 946 flow. Second operand has 13 states, 13 states have (on average 108.92307692307692) internal successors, (1416), 13 states have internal predecessors, (1416), 0 states have call successors, (0), 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 04:49:10,284 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:49:10,284 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 137 [2022-01-19 04:49:10,284 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:49:11,273 INFO L129 PetriNetUnfolder]: 3150/10697 cut-off events. [2022-01-19 04:49:11,273 INFO L130 PetriNetUnfolder]: For 17284/17849 co-relation queries the response was YES. [2022-01-19 04:49:11,366 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30840 conditions, 10697 events. 3150/10697 cut-off events. For 17284/17849 co-relation queries the response was YES. Maximal size of possible extension queue 1327. Compared 140226 event pairs, 10 based on Foata normal form. 5/10087 useless extension candidates. Maximal degree in co-relation 30803. Up to 1169 conditions per place. [2022-01-19 04:49:11,379 INFO L132 encePairwiseOnDemand]: 124/137 looper letters, 27 selfloop transitions, 12 changer transitions 8/203 dead transitions. [2022-01-19 04:49:11,380 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 203 transitions, 1116 flow [2022-01-19 04:49:11,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 04:49:11,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 04:49:11,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1328 transitions. [2022-01-19 04:49:11,381 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8077858880778589 [2022-01-19 04:49:11,381 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1328 transitions. [2022-01-19 04:49:11,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1328 transitions. [2022-01-19 04:49:11,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:49:11,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1328 transitions. [2022-01-19 04:49:11,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 110.66666666666667) internal successors, (1328), 12 states have internal predecessors, (1328), 0 states have call successors, (0), 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 04:49:11,384 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 04:49:11,384 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 04:49:11,384 INFO L186 Difference]: Start difference. First operand has 209 places, 188 transitions, 946 flow. Second operand 12 states and 1328 transitions. [2022-01-19 04:49:11,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 203 transitions, 1116 flow [2022-01-19 04:49:12,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 203 transitions, 1075 flow, removed 14 selfloop flow, removed 12 redundant places. [2022-01-19 04:49:12,118 INFO L242 Difference]: Finished difference. Result has 202 places, 190 transitions, 970 flow [2022-01-19 04:49:12,118 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=970, PETRI_PLACES=202, PETRI_TRANSITIONS=190} [2022-01-19 04:49:12,118 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 58 predicate places. [2022-01-19 04:49:12,118 INFO L470 AbstractCegarLoop]: Abstraction has has 202 places, 190 transitions, 970 flow [2022-01-19 04:49:12,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 108.92307692307692) internal successors, (1416), 13 states have internal predecessors, (1416), 0 states have call successors, (0), 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 04:49:12,119 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:49:12,119 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 04:49:12,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 04:49:12,119 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:49:12,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:49:12,119 INFO L85 PathProgramCache]: Analyzing trace with hash -906036655, now seen corresponding path program 4 times [2022-01-19 04:49:12,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:49:12,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033466597] [2022-01-19 04:49:12,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:49:12,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:49:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:49:12,524 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 04:49:12,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:49:12,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033466597] [2022-01-19 04:49:12,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033466597] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:49:12,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:49:12,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-19 04:49:12,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337331621] [2022-01-19 04:49:12,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:49:12,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-19 04:49:12,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:49:12,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-19 04:49:12,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-01-19 04:49:12,527 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 137 [2022-01-19 04:49:12,528 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 190 transitions, 970 flow. Second operand has 17 states, 17 states have (on average 105.6470588235294) internal successors, (1796), 17 states have internal predecessors, (1796), 0 states have call successors, (0), 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 04:49:12,528 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:49:12,528 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 137 [2022-01-19 04:49:12,528 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:49:13,958 INFO L129 PetriNetUnfolder]: 4398/14371 cut-off events. [2022-01-19 04:49:13,959 INFO L130 PetriNetUnfolder]: For 24396/24997 co-relation queries the response was YES. [2022-01-19 04:49:14,069 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42151 conditions, 14371 events. 4398/14371 cut-off events. For 24396/24997 co-relation queries the response was YES. Maximal size of possible extension queue 1736. Compared 195333 event pairs, 38 based on Foata normal form. 20/13585 useless extension candidates. Maximal degree in co-relation 42118. Up to 1546 conditions per place. [2022-01-19 04:49:14,084 INFO L132 encePairwiseOnDemand]: 124/137 looper letters, 46 selfloop transitions, 13 changer transitions 20/231 dead transitions. [2022-01-19 04:49:14,085 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 231 transitions, 1401 flow [2022-01-19 04:49:14,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 04:49:14,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 04:49:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1520 transitions. [2022-01-19 04:49:14,087 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7924921793534933 [2022-01-19 04:49:14,087 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1520 transitions. [2022-01-19 04:49:14,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1520 transitions. [2022-01-19 04:49:14,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:49:14,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1520 transitions. [2022-01-19 04:49:14,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 108.57142857142857) internal successors, (1520), 14 states have internal predecessors, (1520), 0 states have call successors, (0), 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 04:49:14,090 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 04:49:14,090 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 04:49:14,090 INFO L186 Difference]: Start difference. First operand has 202 places, 190 transitions, 970 flow. Second operand 14 states and 1520 transitions. [2022-01-19 04:49:14,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 231 transitions, 1401 flow [2022-01-19 04:49:15,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 231 transitions, 1321 flow, removed 23 selfloop flow, removed 10 redundant places. [2022-01-19 04:49:15,484 INFO L242 Difference]: Finished difference. Result has 207 places, 193 transitions, 1002 flow [2022-01-19 04:49:15,484 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1002, PETRI_PLACES=207, PETRI_TRANSITIONS=193} [2022-01-19 04:49:15,484 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 63 predicate places. [2022-01-19 04:49:15,484 INFO L470 AbstractCegarLoop]: Abstraction has has 207 places, 193 transitions, 1002 flow [2022-01-19 04:49:15,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 105.6470588235294) internal successors, (1796), 17 states have internal predecessors, (1796), 0 states have call successors, (0), 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 04:49:15,485 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:49:15,485 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 04:49:15,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 04:49:15,485 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:49:15,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:49:15,486 INFO L85 PathProgramCache]: Analyzing trace with hash -667273481, now seen corresponding path program 5 times [2022-01-19 04:49:15,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:49:15,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121217548] [2022-01-19 04:49:15,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:49:15,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:49:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:49:15,518 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 04:49:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:49:15,591 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 04:49:15,591 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 04:49:15,591 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-01-19 04:49:15,592 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-01-19 04:49:15,593 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-01-19 04:49:15,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-01-19 04:49:15,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-01-19 04:49:15,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2022-01-19 04:49:15,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-01-19 04:49:15,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 04:49:15,599 INFO L732 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:49:15,602 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 04:49:15,603 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 04:49:15,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 04:49:15 BasicIcfg [2022-01-19 04:49:15,714 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 04:49:15,714 INFO L158 Benchmark]: Toolchain (without parser) took 52433.10ms. Allocated memory was 364.9MB in the beginning and 11.0GB in the end (delta: 10.7GB). Free memory was 309.1MB in the beginning and 7.4GB in the end (delta: -7.1GB). Peak memory consumption was 3.5GB. Max. memory is 16.0GB. [2022-01-19 04:49:15,715 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 364.9MB. Free memory is still 327.9MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 04:49:15,715 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.60ms. Allocated memory is still 364.9MB. Free memory was 308.9MB in the beginning and 322.1MB in the end (delta: -13.2MB). Peak memory consumption was 13.9MB. Max. memory is 16.0GB. [2022-01-19 04:49:15,715 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.53ms. Allocated memory is still 364.9MB. Free memory was 322.1MB in the beginning and 319.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-19 04:49:15,715 INFO L158 Benchmark]: Boogie Preprocessor took 48.81ms. Allocated memory is still 364.9MB. Free memory was 319.0MB in the beginning and 315.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:49:15,715 INFO L158 Benchmark]: RCFGBuilder took 818.44ms. Allocated memory is still 364.9MB. Free memory was 315.9MB in the beginning and 228.8MB in the end (delta: 87.0MB). Peak memory consumption was 88.1MB. Max. memory is 16.0GB. [2022-01-19 04:49:15,716 INFO L158 Benchmark]: TraceAbstraction took 51128.54ms. Allocated memory was 364.9MB in the beginning and 11.0GB in the end (delta: 10.7GB). Free memory was 228.8MB in the beginning and 7.4GB in the end (delta: -7.2GB). Peak memory consumption was 3.4GB. Max. memory is 16.0GB. [2022-01-19 04:49:15,716 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.10ms. Allocated memory is still 364.9MB. Free memory is still 327.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 364.60ms. Allocated memory is still 364.9MB. Free memory was 308.9MB in the beginning and 322.1MB in the end (delta: -13.2MB). Peak memory consumption was 13.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 68.53ms. Allocated memory is still 364.9MB. Free memory was 322.1MB in the beginning and 319.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 48.81ms. Allocated memory is still 364.9MB. Free memory was 319.0MB in the beginning and 315.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 818.44ms. Allocated memory is still 364.9MB. Free memory was 315.9MB in the beginning and 228.8MB in the end (delta: 87.0MB). Peak memory consumption was 88.1MB. Max. memory is 16.0GB. * TraceAbstraction took 51128.54ms. Allocated memory was 364.9MB in the beginning and 11.0GB in the end (delta: 10.7GB). Free memory was 228.8MB in the beginning and 7.4GB in the end (delta: -7.2GB). Peak memory consumption was 3.4GB. 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L723] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L724] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L725] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L726] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L727] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L728] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L729] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0] [L730] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0] [L731] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L732] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L733] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L734] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0] [L735] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0] [L736] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L737] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L738] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L739] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L740] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L742] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L851] 0 pthread_t t737; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t737={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L852] FCALL, FORK 0 pthread_create(&t737, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t737, ((void *)0), P0, ((void *)0))=-3, t737={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L853] 0 pthread_t t738; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t737={5:0}, t738={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L854] FCALL, FORK 0 pthread_create(&t738, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t738, ((void *)0), P1, ((void *)0))=-2, t737={5:0}, t738={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L855] 0 pthread_t t739; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t737={5:0}, t738={6:0}, t739={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t739, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t739, ((void *)0), P2, ((void *)0))=-1, t737={5:0}, t738={6:0}, t739={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L857] 0 pthread_t t740; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L858] FCALL, FORK 0 pthread_create(&t740, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t740, ((void *)0), P3, ((void *)0))=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L826] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L829] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L829] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L830] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L830] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L831] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L832] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L833] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L833] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 x$flush_delayed = weak$$choice2 [L874] 0 x$mem_tmp = x [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L876] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L877] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L877] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L878] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L878] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L879] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L880] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L881] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L883] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L883] 0 x = x$flush_delayed ? x$mem_tmp : x [L884] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - 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: 858]: 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: 852]: 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: 856]: 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: 854]: 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, 174 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: 50.9s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 47.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1268 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1268 mSDsluCounter, 887 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1789 mSDsCounter, 437 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3012 IncrementalHoareTripleChecker+Invalid, 3449 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 437 mSolverCounterUnsat, 158 mSDtfsCounter, 3012 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 266 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1532occurred in iteration=12, InterpolantAutomatonStates: 204, 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.6s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1693 NumberOfCodeBlocks, 1693 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1570 ConstructedInterpolants, 0 QuantifiedInterpolants, 9223 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 04:49:15,750 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...