/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 20:05:59,463 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 20:05:59,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 20:05:59,493 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 20:05:59,493 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 20:05:59,495 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 20:05:59,497 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 20:05:59,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 20:05:59,504 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 20:05:59,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 20:05:59,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 20:05:59,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 20:05:59,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 20:05:59,512 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 20:05:59,513 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 20:05:59,514 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 20:05:59,516 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 20:05:59,517 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 20:05:59,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 20:05:59,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 20:05:59,526 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 20:05:59,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 20:05:59,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 20:05:59,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 20:05:59,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 20:05:59,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 20:05:59,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 20:05:59,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 20:05:59,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 20:05:59,531 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 20:05:59,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 20:05:59,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 20:05:59,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 20:05:59,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 20:05:59,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 20:05:59,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 20:05:59,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 20:05:59,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 20:05:59,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 20:05:59,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 20:05:59,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 20:05:59,538 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-SemanticLbe.epf [2021-03-11 20:05:59,567 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 20:05:59,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 20:05:59,570 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 20:05:59,571 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 20:05:59,571 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 20:05:59,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 20:05:59,571 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 20:05:59,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 20:05:59,572 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 20:05:59,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 20:05:59,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 20:05:59,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 20:05:59,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 20:05:59,573 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 20:05:59,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 20:05:59,573 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 20:05:59,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 20:05:59,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 20:05:59,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 20:05:59,573 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 20:05:59,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 20:05:59,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:05:59,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 20:05:59,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 20:05:59,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 20:05:59,574 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 20:05:59,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 20:05:59,574 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 20:05:59,574 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 [2021-03-11 20:05:59,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 20:05:59,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 20:05:59,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 20:05:59,812 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 20:05:59,812 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 20:05:59,813 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_power.oepc.i [2021-03-11 20:05:59,856 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcb3b6610/9f5b18c43b4247b188235cab24c571dd/FLAG5265088f3 [2021-03-11 20:06:00,246 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 20:06:00,246 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_power.oepc.i [2021-03-11 20:06:00,260 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcb3b6610/9f5b18c43b4247b188235cab24c571dd/FLAG5265088f3 [2021-03-11 20:06:00,592 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcb3b6610/9f5b18c43b4247b188235cab24c571dd [2021-03-11 20:06:00,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 20:06:00,598 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 20:06:00,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 20:06:00,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 20:06:00,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 20:06:00,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:06:00" (1/1) ... [2021-03-11 20:06:00,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cafc8ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:06:00, skipping insertion in model container [2021-03-11 20:06:00,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:06:00" (1/1) ... [2021-03-11 20:06:00,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 20:06:00,662 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 20:06:00,761 WARN L226 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_power.oepc.i[951,964] [2021-03-11 20:06:00,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:06:00,905 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 20:06:00,912 WARN L226 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_power.oepc.i[951,964] [2021-03-11 20:06:00,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:06:01,012 INFO L208 MainTranslator]: Completed translation [2021-03-11 20:06:01,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:06:01 WrapperNode [2021-03-11 20:06:01,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 20:06:01,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 20:06:01,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 20:06:01,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 20:06:01,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:06:01" (1/1) ... [2021-03-11 20:06:01,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:06:01" (1/1) ... [2021-03-11 20:06:01,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 20:06:01,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 20:06:01,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 20:06:01,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 20:06:01,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:06:01" (1/1) ... [2021-03-11 20:06:01,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:06:01" (1/1) ... [2021-03-11 20:06:01,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:06:01" (1/1) ... [2021-03-11 20:06:01,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:06:01" (1/1) ... [2021-03-11 20:06:01,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:06:01" (1/1) ... [2021-03-11 20:06:01,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:06:01" (1/1) ... [2021-03-11 20:06:01,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:06:01" (1/1) ... [2021-03-11 20:06:01,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 20:06:01,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 20:06:01,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 20:06:01,083 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 20:06:01,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:06:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:06:01,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 20:06:01,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 20:06:01,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 20:06:01,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 20:06:01,160 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 20:06:01,160 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 20:06:01,161 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 20:06:01,161 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 20:06:01,161 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 20:06:01,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 20:06:01,162 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-11 20:06:01,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-11 20:06:01,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 20:06:01,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 20:06:01,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 20:06:01,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 20:06:01,163 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 20:06:02,688 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 20:06:02,688 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 20:06:02,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:06:02 BoogieIcfgContainer [2021-03-11 20:06:02,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 20:06:02,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 20:06:02,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 20:06:02,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 20:06:02,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 08:06:00" (1/3) ... [2021-03-11 20:06:02,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e244f5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:06:02, skipping insertion in model container [2021-03-11 20:06:02,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:06:01" (2/3) ... [2021-03-11 20:06:02,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e244f5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:06:02, skipping insertion in model container [2021-03-11 20:06:02,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:06:02" (3/3) ... [2021-03-11 20:06:02,694 INFO L111 eAbstractionObserver]: Analyzing ICFG mix027_power.oepc.i [2021-03-11 20:06:02,698 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 20:06:02,701 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 20:06:02,701 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 20:06:02,728 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,728 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,729 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,729 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,729 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,729 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,729 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,729 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,730 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,730 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,732 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,733 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,733 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,733 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,735 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,735 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,736 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,736 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,738 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,738 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,738 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,738 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,738 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,738 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,738 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,739 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,742 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,742 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,742 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,743 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,743 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,743 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,743 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,743 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,743 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,747 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,747 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,747 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,747 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,751 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,751 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,751 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,753 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,753 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,754 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,754 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,756 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,756 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,756 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,756 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,756 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:02,760 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 20:06:02,772 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-11 20:06:02,784 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 20:06:02,784 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 20:06:02,784 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 20:06:02,784 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 20:06:02,784 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 20:06:02,784 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 20:06:02,784 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 20:06:02,784 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 20:06:02,791 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 254 flow [2021-03-11 20:06:02,818 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-11 20:06:02,818 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:06:02,821 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 88 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2021-03-11 20:06:02,821 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 117 transitions, 254 flow [2021-03-11 20:06:02,824 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 113 transitions, 238 flow [2021-03-11 20:06:02,827 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 20:06:02,832 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-11 20:06:02,834 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-11 20:06:02,834 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 238 flow [2021-03-11 20:06:02,849 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-11 20:06:02,849 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:06:02,849 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 90 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2021-03-11 20:06:02,851 INFO L116 LiptonReduction]: Number of co-enabled transitions 2774 [2021-03-11 20:06:03,438 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-11 20:06:03,846 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-11 20:06:03,965 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-11 20:06:07,051 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-11 20:06:07,193 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-11 20:06:07,485 WARN L205 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-11 20:06:07,621 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-11 20:06:07,625 INFO L131 LiptonReduction]: Checked pairs total: 8408 [2021-03-11 20:06:07,625 INFO L133 LiptonReduction]: Total number of compositions: 92 [2021-03-11 20:06:07,626 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4802 [2021-03-11 20:06:07,630 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-03-11 20:06:07,630 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:06:07,630 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:06:07,631 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-03-11 20:06:07,631 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:06:07,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:06:07,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1209357, now seen corresponding path program 1 times [2021-03-11 20:06:07,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:06:07,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116394908] [2021-03-11 20:06:07,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:06:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:06:07,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:07,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:07,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:06:07,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116394908] [2021-03-11 20:06:07,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:06:07,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:06:07,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739754763] [2021-03-11 20:06:07,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:06:07,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:06:07,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:06:07,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:06:07,799 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 209 [2021-03-11 20:06:07,803 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:07,803 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:06:07,803 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 209 [2021-03-11 20:06:07,804 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:06:07,896 INFO L129 PetriNetUnfolder]: 133/316 cut-off events. [2021-03-11 20:06:07,896 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:06:07,899 INFO L84 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 316 events. 133/316 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1676 event pairs, 110 based on Foata normal form. 33/320 useless extension candidates. Maximal degree in co-relation 524. Up to 153 conditions per place. [2021-03-11 20:06:07,901 INFO L132 encePairwiseOnDemand]: 205/209 looper letters, 11 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2021-03-11 20:06:07,901 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 108 flow [2021-03-11 20:06:07,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:06:07,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:06:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 550 transitions. [2021-03-11 20:06:07,915 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8771929824561403 [2021-03-11 20:06:07,915 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 550 transitions. [2021-03-11 20:06:07,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 550 transitions. [2021-03-11 20:06:07,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:06:07,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 550 transitions. [2021-03-11 20:06:07,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:07,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:07,927 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:07,928 INFO L185 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 550 transitions. [2021-03-11 20:06:07,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 108 flow [2021-03-11 20:06:07,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 35 transitions, 104 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-11 20:06:07,931 INFO L241 Difference]: Finished difference. Result has 41 places, 30 transitions, 72 flow [2021-03-11 20:06:07,932 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2021-03-11 20:06:07,933 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2021-03-11 20:06:07,933 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 72 flow [2021-03-11 20:06:07,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:07,933 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:06:07,933 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:06:07,934 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 20:06:07,934 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:06:07,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:06:07,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1045958963, now seen corresponding path program 1 times [2021-03-11 20:06:07,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:06:07,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707759468] [2021-03-11 20:06:07,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:06:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:06:08,016 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-11 20:06:08,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:06:08,024 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 20:06:08,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:06:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:06:08,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707759468] [2021-03-11 20:06:08,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:06:08,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:06:08,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532015490] [2021-03-11 20:06:08,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:06:08,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:06:08,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:06:08,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:06:08,030 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 209 [2021-03-11 20:06:08,030 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:08,030 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:06:08,030 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 209 [2021-03-11 20:06:08,030 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:06:08,212 INFO L129 PetriNetUnfolder]: 811/1537 cut-off events. [2021-03-11 20:06:08,212 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:06:08,215 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2758 conditions, 1537 events. 811/1537 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 9884 event pairs, 156 based on Foata normal form. 0/1435 useless extension candidates. Maximal degree in co-relation 2749. Up to 412 conditions per place. [2021-03-11 20:06:08,220 INFO L132 encePairwiseOnDemand]: 198/209 looper letters, 10 selfloop transitions, 8 changer transitions 19/56 dead transitions. [2021-03-11 20:06:08,220 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 198 flow [2021-03-11 20:06:08,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:06:08,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:06:08,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 814 transitions. [2021-03-11 20:06:08,222 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7789473684210526 [2021-03-11 20:06:08,222 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 814 transitions. [2021-03-11 20:06:08,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 814 transitions. [2021-03-11 20:06:08,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:06:08,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 814 transitions. [2021-03-11 20:06:08,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:08,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:08,227 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:08,227 INFO L185 Difference]: Start difference. First operand has 41 places, 30 transitions, 72 flow. Second operand 5 states and 814 transitions. [2021-03-11 20:06:08,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 198 flow [2021-03-11 20:06:08,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:06:08,228 INFO L241 Difference]: Finished difference. Result has 47 places, 36 transitions, 146 flow [2021-03-11 20:06:08,228 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2021-03-11 20:06:08,228 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2021-03-11 20:06:08,229 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 146 flow [2021-03-11 20:06:08,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:08,229 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:06:08,229 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:06:08,229 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 20:06:08,229 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:06:08,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:06:08,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1901021539, now seen corresponding path program 1 times [2021-03-11 20:06:08,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:06:08,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6454749] [2021-03-11 20:06:08,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:06:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:06:08,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:08,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:08,304 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-11 20:06:08,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:06:08,314 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 20:06:08,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:06:08,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:06:08,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6454749] [2021-03-11 20:06:08,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:06:08,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:06:08,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673023328] [2021-03-11 20:06:08,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:06:08,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:06:08,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:06:08,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:06:08,322 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 209 [2021-03-11 20:06:08,325 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:08,325 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:06:08,325 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 209 [2021-03-11 20:06:08,325 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:06:08,468 INFO L129 PetriNetUnfolder]: 435/1031 cut-off events. [2021-03-11 20:06:08,469 INFO L130 PetriNetUnfolder]: For 712/967 co-relation queries the response was YES. [2021-03-11 20:06:08,470 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3125 conditions, 1031 events. 435/1031 cut-off events. For 712/967 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7119 event pairs, 48 based on Foata normal form. 56/1070 useless extension candidates. Maximal degree in co-relation 3112. Up to 410 conditions per place. [2021-03-11 20:06:08,474 INFO L132 encePairwiseOnDemand]: 199/209 looper letters, 15 selfloop transitions, 12 changer transitions 20/66 dead transitions. [2021-03-11 20:06:08,474 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 418 flow [2021-03-11 20:06:08,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:06:08,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:06:08,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1128 transitions. [2021-03-11 20:06:08,477 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7710184552289815 [2021-03-11 20:06:08,477 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1128 transitions. [2021-03-11 20:06:08,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1128 transitions. [2021-03-11 20:06:08,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:06:08,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1128 transitions. [2021-03-11 20:06:08,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 161.14285714285714) internal successors, (1128), 7 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:08,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:08,481 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:08,481 INFO L185 Difference]: Start difference. First operand has 47 places, 36 transitions, 146 flow. Second operand 7 states and 1128 transitions. [2021-03-11 20:06:08,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 418 flow [2021-03-11 20:06:08,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 66 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:06:08,487 INFO L241 Difference]: Finished difference. Result has 54 places, 43 transitions, 236 flow [2021-03-11 20:06:08,487 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=236, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2021-03-11 20:06:08,487 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places. [2021-03-11 20:06:08,488 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 236 flow [2021-03-11 20:06:08,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:08,488 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:06:08,488 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:06:08,489 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 20:06:08,489 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:06:08,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:06:08,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1984063827, now seen corresponding path program 1 times [2021-03-11 20:06:08,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:06:08,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225046006] [2021-03-11 20:06:08,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:06:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:06:08,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:08,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:08,544 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-11 20:06:08,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:06:08,556 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 20:06:08,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:06:08,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:06:08,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225046006] [2021-03-11 20:06:08,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:06:08,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:06:08,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575064651] [2021-03-11 20:06:08,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:06:08,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:06:08,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:06:08,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:06:08,561 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 209 [2021-03-11 20:06:08,562 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 236 flow. Second operand has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:08,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:06:08,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 209 [2021-03-11 20:06:08,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:06:08,698 INFO L129 PetriNetUnfolder]: 386/967 cut-off events. [2021-03-11 20:06:08,698 INFO L130 PetriNetUnfolder]: For 2539/2906 co-relation queries the response was YES. [2021-03-11 20:06:08,700 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3466 conditions, 967 events. 386/967 cut-off events. For 2539/2906 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6843 event pairs, 76 based on Foata normal form. 73/1030 useless extension candidates. Maximal degree in co-relation 3447. Up to 380 conditions per place. [2021-03-11 20:06:08,704 INFO L132 encePairwiseOnDemand]: 199/209 looper letters, 20 selfloop transitions, 18 changer transitions 22/79 dead transitions. [2021-03-11 20:06:08,705 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 79 transitions, 622 flow [2021-03-11 20:06:08,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:06:08,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:06:08,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1130 transitions. [2021-03-11 20:06:08,707 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7723855092276145 [2021-03-11 20:06:08,708 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1130 transitions. [2021-03-11 20:06:08,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1130 transitions. [2021-03-11 20:06:08,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:06:08,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1130 transitions. [2021-03-11 20:06:08,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 161.42857142857142) internal successors, (1130), 7 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:08,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:08,716 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:08,717 INFO L185 Difference]: Start difference. First operand has 54 places, 43 transitions, 236 flow. Second operand 7 states and 1130 transitions. [2021-03-11 20:06:08,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 79 transitions, 622 flow [2021-03-11 20:06:08,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 79 transitions, 614 flow, removed 4 selfloop flow, removed 0 redundant places. [2021-03-11 20:06:08,724 INFO L241 Difference]: Finished difference. Result has 63 places, 53 transitions, 410 flow [2021-03-11 20:06:08,724 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=410, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2021-03-11 20:06:08,725 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2021-03-11 20:06:08,725 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 410 flow [2021-03-11 20:06:08,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:08,725 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:06:08,725 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:06:08,725 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 20:06:08,725 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:06:08,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:06:08,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1246927747, now seen corresponding path program 1 times [2021-03-11 20:06:08,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:06:08,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800393544] [2021-03-11 20:06:08,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:06:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:06:08,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:08,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:08,773 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-11 20:06:08,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:06:08,783 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 20:06:08,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:06:08,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:06:08,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800393544] [2021-03-11 20:06:08,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:06:08,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:06:08,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725370410] [2021-03-11 20:06:08,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:06:08,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:06:08,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:06:08,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:06:08,788 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 209 [2021-03-11 20:06:08,788 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 410 flow. Second operand has 5 states, 5 states have (on average 156.0) internal successors, (780), 5 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:08,788 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:06:08,788 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 209 [2021-03-11 20:06:08,789 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:06:08,925 INFO L129 PetriNetUnfolder]: 286/737 cut-off events. [2021-03-11 20:06:08,925 INFO L130 PetriNetUnfolder]: For 3643/4165 co-relation queries the response was YES. [2021-03-11 20:06:08,927 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3254 conditions, 737 events. 286/737 cut-off events. For 3643/4165 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4834 event pairs, 25 based on Foata normal form. 59/785 useless extension candidates. Maximal degree in co-relation 3230. Up to 295 conditions per place. [2021-03-11 20:06:08,930 INFO L132 encePairwiseOnDemand]: 200/209 looper letters, 35 selfloop transitions, 13 changer transitions 23/90 dead transitions. [2021-03-11 20:06:08,930 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 90 transitions, 940 flow [2021-03-11 20:06:08,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:06:08,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:06:08,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1125 transitions. [2021-03-11 20:06:08,932 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7689678742310321 [2021-03-11 20:06:08,932 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1125 transitions. [2021-03-11 20:06:08,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1125 transitions. [2021-03-11 20:06:08,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:06:08,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1125 transitions. [2021-03-11 20:06:08,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 160.71428571428572) internal successors, (1125), 7 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) [2021-03-11 20:06:08,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:08,935 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:08,935 INFO L185 Difference]: Start difference. First operand has 63 places, 53 transitions, 410 flow. Second operand 7 states and 1125 transitions. [2021-03-11 20:06:08,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 90 transitions, 940 flow [2021-03-11 20:06:08,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 90 transitions, 922 flow, removed 9 selfloop flow, removed 2 redundant places. [2021-03-11 20:06:08,944 INFO L241 Difference]: Finished difference. Result has 70 places, 60 transitions, 564 flow [2021-03-11 20:06:08,944 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=564, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2021-03-11 20:06:08,944 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 26 predicate places. [2021-03-11 20:06:08,944 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 564 flow [2021-03-11 20:06:08,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 156.0) internal successors, (780), 5 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:08,945 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:06:08,945 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:06:08,945 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 20:06:08,945 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:06:08,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:06:08,945 INFO L82 PathProgramCache]: Analyzing trace with hash 120748781, now seen corresponding path program 1 times [2021-03-11 20:06:08,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:06:08,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600805946] [2021-03-11 20:06:08,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:06:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:06:08,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:08,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:08,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:08,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:08,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:08,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:06:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:06:08,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600805946] [2021-03-11 20:06:08,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:06:08,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:06:08,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005561051] [2021-03-11 20:06:08,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:06:08,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:06:08,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:06:08,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:06:08,990 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 209 [2021-03-11 20:06:08,990 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 564 flow. Second operand has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:08,991 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:06:08,991 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 209 [2021-03-11 20:06:08,991 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:06:09,170 INFO L129 PetriNetUnfolder]: 868/1817 cut-off events. [2021-03-11 20:06:09,171 INFO L130 PetriNetUnfolder]: For 4039/4262 co-relation queries the response was YES. [2021-03-11 20:06:09,179 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5466 conditions, 1817 events. 868/1817 cut-off events. For 4039/4262 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 14346 event pairs, 380 based on Foata normal form. 138/1792 useless extension candidates. Maximal degree in co-relation 5437. Up to 959 conditions per place. [2021-03-11 20:06:09,188 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 10 selfloop transitions, 10 changer transitions 0/73 dead transitions. [2021-03-11 20:06:09,188 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 73 transitions, 630 flow [2021-03-11 20:06:09,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:06:09,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:06:09,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 877 transitions. [2021-03-11 20:06:09,190 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8392344497607656 [2021-03-11 20:06:09,190 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 877 transitions. [2021-03-11 20:06:09,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 877 transitions. [2021-03-11 20:06:09,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:06:09,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 877 transitions. [2021-03-11 20:06:09,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 175.4) internal successors, (877), 5 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:09,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:09,193 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:09,193 INFO L185 Difference]: Start difference. First operand has 70 places, 60 transitions, 564 flow. Second operand 5 states and 877 transitions. [2021-03-11 20:06:09,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 73 transitions, 630 flow [2021-03-11 20:06:09,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 73 transitions, 610 flow, removed 8 selfloop flow, removed 5 redundant places. [2021-03-11 20:06:09,206 INFO L241 Difference]: Finished difference. Result has 69 places, 69 transitions, 619 flow [2021-03-11 20:06:09,206 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=619, PETRI_PLACES=69, PETRI_TRANSITIONS=69} [2021-03-11 20:06:09,206 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 25 predicate places. [2021-03-11 20:06:09,206 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 619 flow [2021-03-11 20:06:09,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:09,207 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:06:09,207 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:06:09,207 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 20:06:09,207 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:06:09,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:06:09,207 INFO L82 PathProgramCache]: Analyzing trace with hash 236807102, now seen corresponding path program 1 times [2021-03-11 20:06:09,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:06:09,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010336941] [2021-03-11 20:06:09,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:06:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:06:09,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:09,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:06:09,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:09,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:09,247 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 20:06:09,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:06:09,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:06:09,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010336941] [2021-03-11 20:06:09,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:06:09,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:06:09,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469431736] [2021-03-11 20:06:09,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:06:09,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:06:09,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:06:09,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:06:09,251 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 209 [2021-03-11 20:06:09,252 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 619 flow. Second operand has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:09,252 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:06:09,252 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 209 [2021-03-11 20:06:09,252 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:06:09,515 INFO L129 PetriNetUnfolder]: 1345/2849 cut-off events. [2021-03-11 20:06:09,516 INFO L130 PetriNetUnfolder]: For 6422/7421 co-relation queries the response was YES. [2021-03-11 20:06:09,528 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9875 conditions, 2849 events. 1345/2849 cut-off events. For 6422/7421 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 24882 event pairs, 636 based on Foata normal form. 103/2637 useless extension candidates. Maximal degree in co-relation 9842. Up to 1688 conditions per place. [2021-03-11 20:06:09,536 INFO L132 encePairwiseOnDemand]: 205/209 looper letters, 8 selfloop transitions, 13 changer transitions 2/73 dead transitions. [2021-03-11 20:06:09,536 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 73 transitions, 707 flow [2021-03-11 20:06:09,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:06:09,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:06:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 886 transitions. [2021-03-11 20:06:09,538 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8478468899521531 [2021-03-11 20:06:09,538 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 886 transitions. [2021-03-11 20:06:09,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 886 transitions. [2021-03-11 20:06:09,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:06:09,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 886 transitions. [2021-03-11 20:06:09,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 177.2) internal successors, (886), 5 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:09,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:09,542 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:09,542 INFO L185 Difference]: Start difference. First operand has 69 places, 69 transitions, 619 flow. Second operand 5 states and 886 transitions. [2021-03-11 20:06:09,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 73 transitions, 707 flow [2021-03-11 20:06:09,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 73 transitions, 690 flow, removed 6 selfloop flow, removed 3 redundant places. [2021-03-11 20:06:09,557 INFO L241 Difference]: Finished difference. Result has 73 places, 70 transitions, 666 flow [2021-03-11 20:06:09,557 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=666, PETRI_PLACES=73, PETRI_TRANSITIONS=70} [2021-03-11 20:06:09,557 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 29 predicate places. [2021-03-11 20:06:09,558 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 70 transitions, 666 flow [2021-03-11 20:06:09,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:09,558 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:06:09,558 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:06:09,558 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 20:06:09,558 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:06:09,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:06:09,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1172994182, now seen corresponding path program 1 times [2021-03-11 20:06:09,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:06:09,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318733602] [2021-03-11 20:06:09,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:06:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:06:09,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:09,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:09,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:09,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:09,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:09,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:09,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:09,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:06:09,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:06:09,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318733602] [2021-03-11 20:06:09,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:06:09,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:06:09,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152142721] [2021-03-11 20:06:09,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:06:09,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:06:09,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:06:09,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:06:09,624 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 209 [2021-03-11 20:06:09,625 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 666 flow. Second operand has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:09,625 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:06:09,625 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 209 [2021-03-11 20:06:09,625 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:06:09,856 INFO L129 PetriNetUnfolder]: 905/2092 cut-off events. [2021-03-11 20:06:09,856 INFO L130 PetriNetUnfolder]: For 5208/7673 co-relation queries the response was YES. [2021-03-11 20:06:09,867 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8514 conditions, 2092 events. 905/2092 cut-off events. For 5208/7673 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 18064 event pairs, 177 based on Foata normal form. 666/2595 useless extension candidates. Maximal degree in co-relation 8480. Up to 1402 conditions per place. [2021-03-11 20:06:09,875 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 10 selfloop transitions, 19 changer transitions 0/83 dead transitions. [2021-03-11 20:06:09,875 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 83 transitions, 800 flow [2021-03-11 20:06:09,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:06:09,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:06:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1228 transitions. [2021-03-11 20:06:09,877 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8393711551606289 [2021-03-11 20:06:09,877 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1228 transitions. [2021-03-11 20:06:09,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1228 transitions. [2021-03-11 20:06:09,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:06:09,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1228 transitions. [2021-03-11 20:06:09,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 175.42857142857142) internal successors, (1228), 7 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) [2021-03-11 20:06:09,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:09,881 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:09,881 INFO L185 Difference]: Start difference. First operand has 73 places, 70 transitions, 666 flow. Second operand 7 states and 1228 transitions. [2021-03-11 20:06:09,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 83 transitions, 800 flow [2021-03-11 20:06:09,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 83 transitions, 755 flow, removed 5 selfloop flow, removed 3 redundant places. [2021-03-11 20:06:09,895 INFO L241 Difference]: Finished difference. Result has 79 places, 79 transitions, 755 flow [2021-03-11 20:06:09,896 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=755, PETRI_PLACES=79, PETRI_TRANSITIONS=79} [2021-03-11 20:06:09,896 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 35 predicate places. [2021-03-11 20:06:09,896 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 79 transitions, 755 flow [2021-03-11 20:06:09,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:09,896 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:06:09,896 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:06:09,896 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 20:06:09,896 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:06:09,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:06:09,897 INFO L82 PathProgramCache]: Analyzing trace with hash -15413750, now seen corresponding path program 1 times [2021-03-11 20:06:09,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:06:09,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60235132] [2021-03-11 20:06:09,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:06:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:06:09,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:09,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:09,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:09,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:09,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:09,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:09,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:09,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:09,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:09,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:06:09,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:06:09,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60235132] [2021-03-11 20:06:09,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:06:09,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:06:09,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396615442] [2021-03-11 20:06:09,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:06:09,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:06:09,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:06:09,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:06:09,981 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 209 [2021-03-11 20:06:09,982 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 79 transitions, 755 flow. Second operand has 6 states, 6 states have (on average 171.83333333333334) internal successors, (1031), 6 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:09,982 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:06:09,982 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 209 [2021-03-11 20:06:09,982 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:06:10,235 INFO L129 PetriNetUnfolder]: 707/1687 cut-off events. [2021-03-11 20:06:10,235 INFO L130 PetriNetUnfolder]: For 7843/14300 co-relation queries the response was YES. [2021-03-11 20:06:10,245 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9139 conditions, 1687 events. 707/1687 cut-off events. For 7843/14300 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 14356 event pairs, 34 based on Foata normal form. 959/2515 useless extension candidates. Maximal degree in co-relation 9103. Up to 1256 conditions per place. [2021-03-11 20:06:10,258 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 6 selfloop transitions, 28 changer transitions 6/91 dead transitions. [2021-03-11 20:06:10,258 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 91 transitions, 938 flow [2021-03-11 20:06:10,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 20:06:10,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 20:06:10,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1579 transitions. [2021-03-11 20:06:10,262 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8394471026049973 [2021-03-11 20:06:10,262 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1579 transitions. [2021-03-11 20:06:10,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1579 transitions. [2021-03-11 20:06:10,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:06:10,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1579 transitions. [2021-03-11 20:06:10,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 175.44444444444446) internal successors, (1579), 9 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:10,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:10,267 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:10,267 INFO L185 Difference]: Start difference. First operand has 79 places, 79 transitions, 755 flow. Second operand 9 states and 1579 transitions. [2021-03-11 20:06:10,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 91 transitions, 938 flow [2021-03-11 20:06:10,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 91 transitions, 886 flow, removed 18 selfloop flow, removed 3 redundant places. [2021-03-11 20:06:10,302 INFO L241 Difference]: Finished difference. Result has 87 places, 85 transitions, 840 flow [2021-03-11 20:06:10,303 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=840, PETRI_PLACES=87, PETRI_TRANSITIONS=85} [2021-03-11 20:06:10,303 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 43 predicate places. [2021-03-11 20:06:10,303 INFO L480 AbstractCegarLoop]: Abstraction has has 87 places, 85 transitions, 840 flow [2021-03-11 20:06:10,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 171.83333333333334) internal successors, (1031), 6 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:10,303 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:06:10,303 INFO L255 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] [2021-03-11 20:06:10,303 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 20:06:10,303 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:06:10,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:06:10,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1047649717, now seen corresponding path program 1 times [2021-03-11 20:06:10,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:06:10,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070030053] [2021-03-11 20:06:10,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:06:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:06:10,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:10,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:10,403 INFO L142 QuantifierPusher]: treesize reduction 2, result has 88.9 percent of original size [2021-03-11 20:06:10,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:06:10,412 INFO L142 QuantifierPusher]: treesize reduction 9, result has 62.5 percent of original size [2021-03-11 20:06:10,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-11 20:06:10,426 INFO L142 QuantifierPusher]: treesize reduction 19, result has 73.2 percent of original size [2021-03-11 20:06:10,428 INFO L147 QuantifierPusher]: treesize reduction 9, result has 82.7 percent of original size 43 [2021-03-11 20:06:10,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:10,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:10,467 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 20:06:10,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:06:10,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:06:10,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070030053] [2021-03-11 20:06:10,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:06:10,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 20:06:10,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870716130] [2021-03-11 20:06:10,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 20:06:10,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:06:10,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 20:06:10,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-11 20:06:10,477 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 209 [2021-03-11 20:06:10,477 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 85 transitions, 840 flow. Second operand has 8 states, 8 states have (on average 155.125) internal successors, (1241), 8 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:10,477 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:06:10,478 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 209 [2021-03-11 20:06:10,478 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:06:11,242 INFO L129 PetriNetUnfolder]: 2831/6765 cut-off events. [2021-03-11 20:06:11,243 INFO L130 PetriNetUnfolder]: For 34640/42563 co-relation queries the response was YES. [2021-03-11 20:06:11,286 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31245 conditions, 6765 events. 2831/6765 cut-off events. For 34640/42563 co-relation queries the response was YES. Maximal size of possible extension queue 1011. Compared 73365 event pairs, 186 based on Foata normal form. 494/6679 useless extension candidates. Maximal degree in co-relation 31206. Up to 2992 conditions per place. [2021-03-11 20:06:11,313 INFO L132 encePairwiseOnDemand]: 199/209 looper letters, 18 selfloop transitions, 18 changer transitions 5/114 dead transitions. [2021-03-11 20:06:11,313 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 114 transitions, 1105 flow [2021-03-11 20:06:11,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 20:06:11,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-11 20:06:11,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1269 transitions. [2021-03-11 20:06:11,315 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7589712918660287 [2021-03-11 20:06:11,315 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1269 transitions. [2021-03-11 20:06:11,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1269 transitions. [2021-03-11 20:06:11,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:06:11,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1269 transitions. [2021-03-11 20:06:11,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 158.625) internal successors, (1269), 8 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:11,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:11,319 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:11,319 INFO L185 Difference]: Start difference. First operand has 87 places, 85 transitions, 840 flow. Second operand 8 states and 1269 transitions. [2021-03-11 20:06:11,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 114 transitions, 1105 flow [2021-03-11 20:06:12,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 114 transitions, 988 flow, removed 44 selfloop flow, removed 7 redundant places. [2021-03-11 20:06:12,357 INFO L241 Difference]: Finished difference. Result has 90 places, 103 transitions, 925 flow [2021-03-11 20:06:12,357 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=925, PETRI_PLACES=90, PETRI_TRANSITIONS=103} [2021-03-11 20:06:12,357 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 46 predicate places. [2021-03-11 20:06:12,357 INFO L480 AbstractCegarLoop]: Abstraction has has 90 places, 103 transitions, 925 flow [2021-03-11 20:06:12,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 155.125) internal successors, (1241), 8 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:12,358 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:06:12,358 INFO L255 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] [2021-03-11 20:06:12,358 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 20:06:12,358 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:06:12,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:06:12,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1069112661, now seen corresponding path program 2 times [2021-03-11 20:06:12,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:06:12,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348405276] [2021-03-11 20:06:12,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:06:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:06:12,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:12,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:12,400 INFO L142 QuantifierPusher]: treesize reduction 9, result has 66.7 percent of original size [2021-03-11 20:06:12,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-11 20:06:12,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:12,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:06:12,424 INFO L142 QuantifierPusher]: treesize reduction 28, result has 58.8 percent of original size [2021-03-11 20:06:12,425 INFO L147 QuantifierPusher]: treesize reduction 9, result has 77.5 percent of original size 31 [2021-03-11 20:06:12,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:12,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:12,445 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 20:06:12,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:06:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:06:12,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348405276] [2021-03-11 20:06:12,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:06:12,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 20:06:12,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522914982] [2021-03-11 20:06:12,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 20:06:12,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:06:12,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 20:06:12,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-03-11 20:06:12,456 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 209 [2021-03-11 20:06:12,457 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 103 transitions, 925 flow. Second operand has 8 states, 8 states have (on average 153.125) internal successors, (1225), 8 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:12,457 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:06:12,457 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 209 [2021-03-11 20:06:12,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:06:13,302 INFO L129 PetriNetUnfolder]: 3589/8403 cut-off events. [2021-03-11 20:06:13,302 INFO L130 PetriNetUnfolder]: For 33131/37016 co-relation queries the response was YES. [2021-03-11 20:06:13,341 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32122 conditions, 8403 events. 3589/8403 cut-off events. For 33131/37016 co-relation queries the response was YES. Maximal size of possible extension queue 1319. Compared 93343 event pairs, 160 based on Foata normal form. 756/8368 useless extension candidates. Maximal degree in co-relation 32080. Up to 2255 conditions per place. [2021-03-11 20:06:13,364 INFO L132 encePairwiseOnDemand]: 200/209 looper letters, 22 selfloop transitions, 25 changer transitions 4/124 dead transitions. [2021-03-11 20:06:13,364 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 124 transitions, 1204 flow [2021-03-11 20:06:13,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 20:06:13,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-11 20:06:13,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1252 transitions. [2021-03-11 20:06:13,367 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7488038277511961 [2021-03-11 20:06:13,367 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1252 transitions. [2021-03-11 20:06:13,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1252 transitions. [2021-03-11 20:06:13,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:06:13,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1252 transitions. [2021-03-11 20:06:13,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 156.5) internal successors, (1252), 8 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:13,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:13,371 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:13,372 INFO L185 Difference]: Start difference. First operand has 90 places, 103 transitions, 925 flow. Second operand 8 states and 1252 transitions. [2021-03-11 20:06:13,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 124 transitions, 1204 flow [2021-03-11 20:06:14,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 124 transitions, 1197 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-11 20:06:14,507 INFO L241 Difference]: Finished difference. Result has 98 places, 112 transitions, 1092 flow [2021-03-11 20:06:14,507 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1092, PETRI_PLACES=98, PETRI_TRANSITIONS=112} [2021-03-11 20:06:14,507 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 54 predicate places. [2021-03-11 20:06:14,507 INFO L480 AbstractCegarLoop]: Abstraction has has 98 places, 112 transitions, 1092 flow [2021-03-11 20:06:14,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 153.125) internal successors, (1225), 8 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:14,508 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:06:14,508 INFO L255 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] [2021-03-11 20:06:14,508 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 20:06:14,508 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:06:14,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:06:14,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2073995975, now seen corresponding path program 3 times [2021-03-11 20:06:14,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:06:14,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907127301] [2021-03-11 20:06:14,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:06:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:06:14,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:14,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:14,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:14,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:14,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:14,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:14,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:14,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:14,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:14,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:14,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:14,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:06:14,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:06:14,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907127301] [2021-03-11 20:06:14,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:06:14,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 20:06:14,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892170797] [2021-03-11 20:06:14,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 20:06:14,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:06:14,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 20:06:14,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-11 20:06:14,576 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 209 [2021-03-11 20:06:14,577 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 112 transitions, 1092 flow. Second operand has 7 states, 7 states have (on average 171.85714285714286) internal successors, (1203), 7 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:14,577 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:06:14,578 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 209 [2021-03-11 20:06:14,578 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:06:15,323 INFO L129 PetriNetUnfolder]: 3271/7557 cut-off events. [2021-03-11 20:06:15,323 INFO L130 PetriNetUnfolder]: For 46631/72205 co-relation queries the response was YES. [2021-03-11 20:06:15,356 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34122 conditions, 7557 events. 3271/7557 cut-off events. For 46631/72205 co-relation queries the response was YES. Maximal size of possible extension queue 1284. Compared 82889 event pairs, 92 based on Foata normal form. 5989/12766 useless extension candidates. Maximal degree in co-relation 34086. Up to 2202 conditions per place. [2021-03-11 20:06:15,367 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 4 selfloop transitions, 33 changer transitions 9/116 dead transitions. [2021-03-11 20:06:15,367 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 116 transitions, 1211 flow [2021-03-11 20:06:15,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-11 20:06:15,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-11 20:06:15,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1922 transitions. [2021-03-11 20:06:15,370 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8360156589821661 [2021-03-11 20:06:15,370 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1922 transitions. [2021-03-11 20:06:15,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1922 transitions. [2021-03-11 20:06:15,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:06:15,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1922 transitions. [2021-03-11 20:06:15,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 174.72727272727272) internal successors, (1922), 11 states have internal predecessors, (1922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:15,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 209.0) internal successors, (2508), 12 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:15,376 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 209.0) internal successors, (2508), 12 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:15,376 INFO L185 Difference]: Start difference. First operand has 98 places, 112 transitions, 1092 flow. Second operand 11 states and 1922 transitions. [2021-03-11 20:06:15,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 116 transitions, 1211 flow [2021-03-11 20:06:16,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 116 transitions, 1172 flow, removed 7 selfloop flow, removed 5 redundant places. [2021-03-11 20:06:16,236 INFO L241 Difference]: Finished difference. Result has 105 places, 107 transitions, 1073 flow [2021-03-11 20:06:16,236 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1073, PETRI_PLACES=105, PETRI_TRANSITIONS=107} [2021-03-11 20:06:16,236 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 61 predicate places. [2021-03-11 20:06:16,236 INFO L480 AbstractCegarLoop]: Abstraction has has 105 places, 107 transitions, 1073 flow [2021-03-11 20:06:16,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 171.85714285714286) internal successors, (1203), 7 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:16,237 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:06:16,237 INFO L255 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] [2021-03-11 20:06:16,237 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 20:06:16,237 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:06:16,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:06:16,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1638504732, now seen corresponding path program 1 times [2021-03-11 20:06:16,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:06:16,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200571397] [2021-03-11 20:06:16,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:06:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:06:16,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:16,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:06:16,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:16,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:16,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:16,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:16,293 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-11 20:06:16,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:06:16,302 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 20:06:16,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:06:16,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:06:16,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200571397] [2021-03-11 20:06:16,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:06:16,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:06:16,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461449418] [2021-03-11 20:06:16,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:06:16,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:06:16,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:06:16,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:06:16,309 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 209 [2021-03-11 20:06:16,310 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 107 transitions, 1073 flow. Second operand has 6 states, 6 states have (on average 153.83333333333334) internal successors, (923), 6 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:16,310 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:06:16,310 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 209 [2021-03-11 20:06:16,310 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:06:16,830 INFO L129 PetriNetUnfolder]: 2549/5852 cut-off events. [2021-03-11 20:06:16,830 INFO L130 PetriNetUnfolder]: For 40128/44113 co-relation queries the response was YES. [2021-03-11 20:06:16,856 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26540 conditions, 5852 events. 2549/5852 cut-off events. For 40128/44113 co-relation queries the response was YES. Maximal size of possible extension queue 968. Compared 61007 event pairs, 47 based on Foata normal form. 333/5603 useless extension candidates. Maximal degree in co-relation 26493. Up to 1678 conditions per place. [2021-03-11 20:06:16,864 INFO L132 encePairwiseOnDemand]: 198/209 looper letters, 30 selfloop transitions, 35 changer transitions 20/145 dead transitions. [2021-03-11 20:06:16,864 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 145 transitions, 1706 flow [2021-03-11 20:06:16,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:06:16,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:06:16,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1100 transitions. [2021-03-11 20:06:16,873 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7518796992481203 [2021-03-11 20:06:16,874 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1100 transitions. [2021-03-11 20:06:16,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1100 transitions. [2021-03-11 20:06:16,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:06:16,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1100 transitions. [2021-03-11 20:06:16,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 157.14285714285714) internal successors, (1100), 7 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:16,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:16,881 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:16,881 INFO L185 Difference]: Start difference. First operand has 105 places, 107 transitions, 1073 flow. Second operand 7 states and 1100 transitions. [2021-03-11 20:06:16,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 145 transitions, 1706 flow [2021-03-11 20:06:17,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 145 transitions, 1507 flow, removed 57 selfloop flow, removed 13 redundant places. [2021-03-11 20:06:17,402 INFO L241 Difference]: Finished difference. Result has 101 places, 115 transitions, 1166 flow [2021-03-11 20:06:17,402 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1166, PETRI_PLACES=101, PETRI_TRANSITIONS=115} [2021-03-11 20:06:17,402 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 57 predicate places. [2021-03-11 20:06:17,402 INFO L480 AbstractCegarLoop]: Abstraction has has 101 places, 115 transitions, 1166 flow [2021-03-11 20:06:17,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 153.83333333333334) internal successors, (923), 6 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:17,402 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:06:17,402 INFO L255 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] [2021-03-11 20:06:17,402 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-11 20:06:17,402 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:06:17,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:06:17,403 INFO L82 PathProgramCache]: Analyzing trace with hash 157606264, now seen corresponding path program 2 times [2021-03-11 20:06:17,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:06:17,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471290027] [2021-03-11 20:06:17,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:06:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:06:17,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:17,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:06:17,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:17,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:17,446 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-11 20:06:17,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:06:17,455 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 20:06:17,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:06:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:06:17,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471290027] [2021-03-11 20:06:17,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:06:17,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:06:17,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238335007] [2021-03-11 20:06:17,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:06:17,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:06:17,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:06:17,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:06:17,460 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 209 [2021-03-11 20:06:17,460 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 115 transitions, 1166 flow. Second operand has 5 states, 5 states have (on average 157.0) internal successors, (785), 5 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:17,461 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:06:17,461 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 209 [2021-03-11 20:06:17,461 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:06:18,088 INFO L129 PetriNetUnfolder]: 3093/7122 cut-off events. [2021-03-11 20:06:18,088 INFO L130 PetriNetUnfolder]: For 27508/30186 co-relation queries the response was YES. [2021-03-11 20:06:18,113 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26844 conditions, 7122 events. 3093/7122 cut-off events. For 27508/30186 co-relation queries the response was YES. Maximal size of possible extension queue 1406. Compared 76849 event pairs, 52 based on Foata normal form. 289/6670 useless extension candidates. Maximal degree in co-relation 26809. Up to 2079 conditions per place. [2021-03-11 20:06:18,118 INFO L132 encePairwiseOnDemand]: 200/209 looper letters, 10 selfloop transitions, 4 changer transitions 56/131 dead transitions. [2021-03-11 20:06:18,118 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 131 transitions, 1524 flow [2021-03-11 20:06:18,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:06:18,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:06:18,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 799 transitions. [2021-03-11 20:06:18,119 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7645933014354067 [2021-03-11 20:06:18,120 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 799 transitions. [2021-03-11 20:06:18,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 799 transitions. [2021-03-11 20:06:18,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:06:18,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 799 transitions. [2021-03-11 20:06:18,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 159.8) internal successors, (799), 5 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:18,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:18,122 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:18,122 INFO L185 Difference]: Start difference. First operand has 101 places, 115 transitions, 1166 flow. Second operand 5 states and 799 transitions. [2021-03-11 20:06:18,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 131 transitions, 1524 flow [2021-03-11 20:06:18,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 131 transitions, 1514 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-11 20:06:18,820 INFO L241 Difference]: Finished difference. Result has 104 places, 75 transitions, 546 flow [2021-03-11 20:06:18,820 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=1158, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=546, PETRI_PLACES=104, PETRI_TRANSITIONS=75} [2021-03-11 20:06:18,820 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 60 predicate places. [2021-03-11 20:06:18,820 INFO L480 AbstractCegarLoop]: Abstraction has has 104 places, 75 transitions, 546 flow [2021-03-11 20:06:18,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 157.0) internal successors, (785), 5 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:18,820 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:06:18,820 INFO L255 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] [2021-03-11 20:06:18,821 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-11 20:06:18,821 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:06:18,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:06:18,821 INFO L82 PathProgramCache]: Analyzing trace with hash -274172106, now seen corresponding path program 3 times [2021-03-11 20:06:18,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:06:18,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110147245] [2021-03-11 20:06:18,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:06:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:06:18,890 INFO L142 QuantifierPusher]: treesize reduction 30, result has 38.8 percent of original size [2021-03-11 20:06:18,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:06:18,902 INFO L142 QuantifierPusher]: treesize reduction 46, result has 69.9 percent of original size [2021-03-11 20:06:18,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 107 [2021-03-11 20:06:18,967 INFO L142 QuantifierPusher]: treesize reduction 34, result has 74.2 percent of original size [2021-03-11 20:06:18,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 98 [2021-03-11 20:06:19,026 INFO L142 QuantifierPusher]: treesize reduction 34, result has 71.9 percent of original size [2021-03-11 20:06:19,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 87 [2021-03-11 20:06:19,077 INFO L142 QuantifierPusher]: treesize reduction 34, result has 70.2 percent of original size [2021-03-11 20:06:19,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 80 [2021-03-11 20:06:19,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:19,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:06:19,127 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 20:06:19,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:06:19,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:06:19,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110147245] [2021-03-11 20:06:19,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:06:19,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 20:06:19,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564494570] [2021-03-11 20:06:19,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 20:06:19,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:06:19,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 20:06:19,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-03-11 20:06:19,135 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 209 [2021-03-11 20:06:19,136 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 75 transitions, 546 flow. Second operand has 9 states, 9 states have (on average 143.11111111111111) internal successors, (1288), 9 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:19,136 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:06:19,136 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 209 [2021-03-11 20:06:19,136 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:06:19,377 INFO L129 PetriNetUnfolder]: 720/1720 cut-off events. [2021-03-11 20:06:19,377 INFO L130 PetriNetUnfolder]: For 7141/8209 co-relation queries the response was YES. [2021-03-11 20:06:19,383 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6387 conditions, 1720 events. 720/1720 cut-off events. For 7141/8209 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 14860 event pairs, 11 based on Foata normal form. 114/1662 useless extension candidates. Maximal degree in co-relation 6353. Up to 505 conditions per place. [2021-03-11 20:06:19,385 INFO L132 encePairwiseOnDemand]: 200/209 looper letters, 22 selfloop transitions, 7 changer transitions 21/98 dead transitions. [2021-03-11 20:06:19,385 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 98 transitions, 855 flow [2021-03-11 20:06:19,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 20:06:19,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-11 20:06:19,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1162 transitions. [2021-03-11 20:06:19,387 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6949760765550239 [2021-03-11 20:06:19,387 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1162 transitions. [2021-03-11 20:06:19,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1162 transitions. [2021-03-11 20:06:19,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:06:19,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1162 transitions. [2021-03-11 20:06:19,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 145.25) internal successors, (1162), 8 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:19,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:19,391 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:19,391 INFO L185 Difference]: Start difference. First operand has 104 places, 75 transitions, 546 flow. Second operand 8 states and 1162 transitions. [2021-03-11 20:06:19,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 98 transitions, 855 flow [2021-03-11 20:06:19,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 98 transitions, 786 flow, removed 9 selfloop flow, removed 20 redundant places. [2021-03-11 20:06:19,441 INFO L241 Difference]: Finished difference. Result has 93 places, 72 transitions, 514 flow [2021-03-11 20:06:19,441 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=514, PETRI_PLACES=93, PETRI_TRANSITIONS=72} [2021-03-11 20:06:19,441 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 49 predicate places. [2021-03-11 20:06:19,441 INFO L480 AbstractCegarLoop]: Abstraction has has 93 places, 72 transitions, 514 flow [2021-03-11 20:06:19,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 143.11111111111111) internal successors, (1288), 9 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:19,442 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:06:19,442 INFO L255 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] [2021-03-11 20:06:19,442 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-11 20:06:19,442 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:06:19,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:06:19,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1063395108, now seen corresponding path program 4 times [2021-03-11 20:06:19,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:06:19,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048510976] [2021-03-11 20:06:19,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:06:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:06:19,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:19,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:06:19,497 INFO L142 QuantifierPusher]: treesize reduction 2, result has 93.9 percent of original size [2021-03-11 20:06:19,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-11 20:06:19,519 INFO L142 QuantifierPusher]: treesize reduction 9, result has 70.0 percent of original size [2021-03-11 20:06:19,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:06:19,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:19,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:06:19,545 INFO L142 QuantifierPusher]: treesize reduction 17, result has 71.7 percent of original size [2021-03-11 20:06:19,546 INFO L147 QuantifierPusher]: treesize reduction 9, result has 79.1 percent of original size 34 [2021-03-11 20:06:19,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:19,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:19,574 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 20:06:19,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:06:19,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:06:19,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048510976] [2021-03-11 20:06:19,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:06:19,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 20:06:19,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347313675] [2021-03-11 20:06:19,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 20:06:19,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:06:19,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 20:06:19,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-03-11 20:06:19,582 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 209 [2021-03-11 20:06:19,583 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 72 transitions, 514 flow. Second operand has 9 states, 9 states have (on average 152.11111111111111) internal successors, (1369), 9 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:19,583 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:06:19,583 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 209 [2021-03-11 20:06:19,583 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:06:19,820 INFO L129 PetriNetUnfolder]: 515/1232 cut-off events. [2021-03-11 20:06:19,820 INFO L130 PetriNetUnfolder]: For 6730/7305 co-relation queries the response was YES. [2021-03-11 20:06:19,824 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4616 conditions, 1232 events. 515/1232 cut-off events. For 6730/7305 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 10069 event pairs, 19 based on Foata normal form. 73/1184 useless extension candidates. Maximal degree in co-relation 4587. Up to 355 conditions per place. [2021-03-11 20:06:19,825 INFO L132 encePairwiseOnDemand]: 201/209 looper letters, 18 selfloop transitions, 9 changer transitions 10/84 dead transitions. [2021-03-11 20:06:19,825 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 84 transitions, 705 flow [2021-03-11 20:06:19,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 20:06:19,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-11 20:06:19,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1234 transitions. [2021-03-11 20:06:19,827 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7380382775119617 [2021-03-11 20:06:19,827 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1234 transitions. [2021-03-11 20:06:19,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1234 transitions. [2021-03-11 20:06:19,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:06:19,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1234 transitions. [2021-03-11 20:06:19,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 154.25) internal successors, (1234), 8 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:19,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:19,831 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:19,831 INFO L185 Difference]: Start difference. First operand has 93 places, 72 transitions, 514 flow. Second operand 8 states and 1234 transitions. [2021-03-11 20:06:19,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 84 transitions, 705 flow [2021-03-11 20:06:19,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 84 transitions, 637 flow, removed 26 selfloop flow, removed 8 redundant places. [2021-03-11 20:06:19,857 INFO L241 Difference]: Finished difference. Result has 94 places, 70 transitions, 501 flow [2021-03-11 20:06:19,857 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=501, PETRI_PLACES=94, PETRI_TRANSITIONS=70} [2021-03-11 20:06:19,857 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 50 predicate places. [2021-03-11 20:06:19,857 INFO L480 AbstractCegarLoop]: Abstraction has has 94 places, 70 transitions, 501 flow [2021-03-11 20:06:19,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 152.11111111111111) internal successors, (1369), 9 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:19,857 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:06:19,857 INFO L255 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] [2021-03-11 20:06:19,857 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-11 20:06:19,858 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:06:19,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:06:19,858 INFO L82 PathProgramCache]: Analyzing trace with hash 970056698, now seen corresponding path program 5 times [2021-03-11 20:06:19,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:06:19,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436197609] [2021-03-11 20:06:19,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:06:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:06:19,891 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:06:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:06:19,921 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:06:19,954 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 20:06:19,954 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 20:06:19,954 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-11 20:06:20,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 08:06:20 BasicIcfg [2021-03-11 20:06:20,021 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 20:06:20,022 INFO L168 Benchmark]: Toolchain (without parser) took 19427.03 ms. Allocated memory was 255.9 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 235.2 MB in the beginning and 650.4 MB in the end (delta: -415.2 MB). Peak memory consumption was 1.0 GB. Max. memory is 16.0 GB. [2021-03-11 20:06:20,022 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 255.9 MB. Free memory was 237.6 MB in the beginning and 237.5 MB in the end (delta: 92.7 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 20:06:20,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.80 ms. Allocated memory was 255.9 MB in the beginning and 371.2 MB in the end (delta: 115.3 MB). Free memory was 234.8 MB in the beginning and 330.2 MB in the end (delta: -95.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. [2021-03-11 20:06:20,022 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.76 ms. Allocated memory is still 371.2 MB. Free memory was 330.2 MB in the beginning and 327.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:06:20,023 INFO L168 Benchmark]: Boogie Preprocessor took 20.48 ms. Allocated memory is still 371.2 MB. Free memory was 327.8 MB in the beginning and 325.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:06:20,023 INFO L168 Benchmark]: RCFGBuilder took 1606.22 ms. Allocated memory was 371.2 MB in the beginning and 446.7 MB in the end (delta: 75.5 MB). Free memory was 325.4 MB in the beginning and 399.0 MB in the end (delta: -73.6 MB). Peak memory consumption was 66.0 MB. Max. memory is 16.0 GB. [2021-03-11 20:06:20,023 INFO L168 Benchmark]: TraceAbstraction took 17331.21 ms. Allocated memory was 446.7 MB in the beginning and 1.7 GB in the end (delta: 1.2 GB). Free memory was 398.0 MB in the beginning and 650.4 MB in the end (delta: -252.4 MB). Peak memory consumption was 995.4 MB. Max. memory is 16.0 GB. [2021-03-11 20:06:20,024 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.09 ms. Allocated memory is still 255.9 MB. Free memory was 237.6 MB in the beginning and 237.5 MB in the end (delta: 92.7 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 405.80 ms. Allocated memory was 255.9 MB in the beginning and 371.2 MB in the end (delta: 115.3 MB). Free memory was 234.8 MB in the beginning and 330.2 MB in the end (delta: -95.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 47.76 ms. Allocated memory is still 371.2 MB. Free memory was 330.2 MB in the beginning and 327.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 20.48 ms. Allocated memory is still 371.2 MB. Free memory was 327.8 MB in the beginning and 325.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1606.22 ms. Allocated memory was 371.2 MB in the beginning and 446.7 MB in the end (delta: 75.5 MB). Free memory was 325.4 MB in the beginning and 399.0 MB in the end (delta: -73.6 MB). Peak memory consumption was 66.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 17331.21 ms. Allocated memory was 446.7 MB in the beginning and 1.7 GB in the end (delta: 1.2 GB). Free memory was 398.0 MB in the beginning and 650.4 MB in the end (delta: -252.4 MB). Peak memory consumption was 995.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4791.0ms, 124 PlacesBefore, 44 PlacesAfterwards, 113 TransitionsBefore, 32 TransitionsAfterwards, 2774 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 8408 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3734, positive: 3502, positive conditional: 0, positive unconditional: 3502, negative: 232, negative conditional: 0, negative unconditional: 232, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1955, positive: 1882, positive conditional: 0, positive unconditional: 1882, negative: 73, negative conditional: 0, negative unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1955, positive: 1842, positive conditional: 0, positive unconditional: 1842, negative: 113, negative conditional: 0, negative unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 113, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 73, negative conditional: 0, negative unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 723, positive: 69, positive conditional: 0, positive unconditional: 69, negative: 654, negative conditional: 0, negative unconditional: 654, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3734, positive: 1620, positive conditional: 0, positive unconditional: 1620, negative: 159, negative conditional: 0, negative unconditional: 159, unknown: 1955, unknown conditional: 0, unknown unconditional: 1955] , Statistics on independence cache: Total cache size (in pairs): 305, Positive cache size: 273, Positive conditional cache size: 0, Positive unconditional cache size: 273, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32 - 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; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t713; [L865] FCALL, FORK 0 pthread_create(&t713, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L866] 0 pthread_t t714; [L867] FCALL, FORK 0 pthread_create(&t714, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L786] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L786] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L786] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L868] 0 pthread_t t715; [L869] FCALL, FORK 0 pthread_create(&t715, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=1, z=1] [L806] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L806] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L806] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L870] 0 pthread_t t716; [L871] FCALL, FORK 0 pthread_create(&t716, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=1, z=2] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L831] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L831] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L832] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L832] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L833] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L833] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L834] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L835] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L835] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L836] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=49, weak$$choice2=0, x=2, y=1, z=2] [L842] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L842] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L842] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L877] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L877] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L877] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L884] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 116 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 17173.1ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 10575.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4844.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 171 SDtfs, 155 SDslu, 239 SDs, 0 SdLazy, 752 SolverSat, 147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 683.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 786.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1166occurred in iteration=13, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 38.6ms SsaConstructionTime, 399.9ms SatisfiabilityAnalysisTime, 1074.5ms InterpolantComputationTime, 347 NumberOfCodeBlocks, 347 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 302 ConstructedInterpolants, 0 QuantifiedInterpolants, 3032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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! Received shutdown request...