/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix039_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:30:55,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:30:55,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:30:55,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:30:55,223 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:30:55,226 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:30:55,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:30:55,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:30:55,236 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:30:55,243 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:30:55,244 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:30:55,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:30:55,246 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:30:55,247 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:30:55,248 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:30:55,250 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:30:55,252 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:30:55,253 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:30:55,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:30:55,262 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:30:55,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:30:55,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:30:55,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:30:55,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:30:55,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:30:55,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:30:55,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:30:55,275 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:30:55,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:30:55,276 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:30:55,276 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:30:55,277 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:30:55,278 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:30:55,279 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:30:55,280 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:30:55,280 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:30:55,280 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:30:55,281 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:30:55,281 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:30:55,281 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:30:55,282 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:30:55,286 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2021-03-25 14:30:55,318 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:30:55,318 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:30:55,321 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:30:55,322 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:30:55,322 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:30:55,322 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:30:55,322 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:30:55,322 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:30:55,322 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:30:55,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:30:55,324 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:30:55,324 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:30:55,324 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:30:55,324 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:30:55,324 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:30:55,324 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:30:55,324 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:30:55,325 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:30:55,325 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:30:55,325 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:30:55,325 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:30:55,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:30:55,325 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:30:55,326 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:30:55,326 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:30:55,326 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:30:55,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:30:55,326 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:30:55,326 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:30:55,326 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true 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-25 14:30:55,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:30:55,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:30:55,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:30:55,655 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:30:55,658 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:30:55,659 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039_power.oepc.i [2021-03-25 14:30:55,722 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/257a45761/49b328d6592844dea78f800c3a8cb737/FLAG8e3a6ddde [2021-03-25 14:30:56,158 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:30:56,159 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039_power.oepc.i [2021-03-25 14:30:56,171 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/257a45761/49b328d6592844dea78f800c3a8cb737/FLAG8e3a6ddde [2021-03-25 14:30:56,183 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/257a45761/49b328d6592844dea78f800c3a8cb737 [2021-03-25 14:30:56,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:30:56,186 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:30:56,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:30:56,187 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:30:56,189 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:30:56,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:30:56" (1/1) ... [2021-03-25 14:30:56,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a2ad63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:30:56, skipping insertion in model container [2021-03-25 14:30:56,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:30:56" (1/1) ... [2021-03-25 14:30:56,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:30:56,231 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:30:56,375 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/mix039_power.oepc.i[951,964] [2021-03-25 14:30:56,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:30:56,615 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:30:56,624 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/mix039_power.oepc.i[951,964] [2021-03-25 14:30:56,696 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:30:56,771 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:30:56,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:30:56 WrapperNode [2021-03-25 14:30:56,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:30:56,774 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:30:56,774 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:30:56,774 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:30:56,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:30:56" (1/1) ... [2021-03-25 14:30:56,813 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:30:56" (1/1) ... [2021-03-25 14:30:56,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:30:56,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:30:56,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:30:56,848 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:30:56,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:30:56" (1/1) ... [2021-03-25 14:30:56,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:30:56" (1/1) ... [2021-03-25 14:30:56,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:30:56" (1/1) ... [2021-03-25 14:30:56,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:30:56" (1/1) ... [2021-03-25 14:30:56,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:30:56" (1/1) ... [2021-03-25 14:30:56,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:30:56" (1/1) ... [2021-03-25 14:30:56,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:30:56" (1/1) ... [2021-03-25 14:30:56,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:30:56,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:30:56,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:30:56,906 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:30:56,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:30:56" (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-25 14:30:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:30:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:30:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:30:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:30:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:30:56,970 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:30:56,970 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:30:56,971 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:30:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:30:56,971 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:30:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 14:30:56,971 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 14:30:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:30:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:30:56,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:30:56,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:30:56,973 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:30:58,842 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:30:58,842 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:30:58,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:30:58 BoogieIcfgContainer [2021-03-25 14:30:58,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:30:58,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:30:58,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:30:58,851 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:30:58,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:30:56" (1/3) ... [2021-03-25 14:30:58,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5bc33d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:30:58, skipping insertion in model container [2021-03-25 14:30:58,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:30:56" (2/3) ... [2021-03-25 14:30:58,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5bc33d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:30:58, skipping insertion in model container [2021-03-25 14:30:58,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:30:58" (3/3) ... [2021-03-25 14:30:58,854 INFO L111 eAbstractionObserver]: Analyzing ICFG mix039_power.oepc.i [2021-03-25 14:30:58,859 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:30:58,862 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:30:58,863 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:30:58,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,904 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,904 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,904 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,904 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,904 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,904 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,904 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,905 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,905 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,905 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,905 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,905 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,905 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,905 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,909 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,909 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,909 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,910 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,910 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,910 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,910 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,910 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,910 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,910 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,910 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,911 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,911 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,911 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,911 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,913 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,913 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,913 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,913 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,913 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,914 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,914 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,914 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,914 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,914 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,915 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,915 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,915 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,915 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,915 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,915 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,915 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,916 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,916 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,916 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,917 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,917 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,917 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,917 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,917 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,917 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,917 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,918 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,918 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,918 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,918 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,918 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,919 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,919 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,919 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,919 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,919 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,919 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,919 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,920 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,920 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,920 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,921 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,921 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,924 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,925 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,925 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,925 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,930 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,933 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,933 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,933 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,933 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,935 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,935 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,935 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,936 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,936 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,936 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,936 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,936 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,936 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,936 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,936 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,936 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,936 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,936 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,936 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,936 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,937 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,937 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,937 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,937 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,937 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,937 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,937 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,937 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,937 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,937 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,938 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,938 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,938 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,938 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,938 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,938 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,938 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,938 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,938 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,938 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,938 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,938 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,940 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,940 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,940 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,940 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,940 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,941 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,941 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,941 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,941 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,941 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,941 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,941 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,941 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,941 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,942 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,942 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,942 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,942 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,944 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,944 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,944 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,944 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,944 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,944 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,944 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,944 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,944 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,945 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,945 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,945 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,945 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,945 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,945 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,945 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,945 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,945 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,945 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,946 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,946 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,946 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,946 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,946 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,946 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,946 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,946 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,946 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,946 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,946 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,947 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,947 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,947 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,954 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,954 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,954 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,956 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,956 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,964 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,964 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:58,966 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:30:58,981 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 14:30:59,009 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:30:59,009 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:30:59,009 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:30:59,009 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:30:59,009 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:30:59,010 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:30:59,010 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:30:59,010 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:30:59,021 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 120 transitions, 260 flow [2021-03-25 14:30:59,075 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-25 14:30:59,075 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:30:59,086 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 91 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-25 14:30:59,086 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 120 transitions, 260 flow [2021-03-25 14:30:59,095 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 116 transitions, 244 flow [2021-03-25 14:30:59,096 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:30:59,105 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-25 14:30:59,108 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-25 14:30:59,111 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 244 flow [2021-03-25 14:30:59,146 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-25 14:30:59,146 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:30:59,147 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 91 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-25 14:30:59,151 INFO L142 LiptonReduction]: Number of co-enabled transitions 2876 [2021-03-25 14:31:00,572 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:31:00,982 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:31:01,117 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:31:02,610 INFO L154 LiptonReduction]: Checked pairs total: 5194 [2021-03-25 14:31:02,611 INFO L156 LiptonReduction]: Total number of compositions: 76 [2021-03-25 14:31:02,613 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3517 [2021-03-25 14:31:02,629 INFO L129 PetriNetUnfolder]: 0/13 cut-off events. [2021-03-25 14:31:02,629 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:31:02,629 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:31:02,630 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:31:02,630 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:31:02,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:31:02,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1584989629, now seen corresponding path program 1 times [2021-03-25 14:31:02,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:31:02,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862241706] [2021-03-25 14:31:02,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:31:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:31:02,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:02,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:31:02,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:02,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:31:02,855 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-25 14:31:02,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862241706] [2021-03-25 14:31:02,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:31:02,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:31:02,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688717245] [2021-03-25 14:31:02,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:31:02,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:31:02,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:31:02,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:31:02,875 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 196 [2021-03-25 14:31:02,877 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 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-25 14:31:02,877 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:31:02,877 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 196 [2021-03-25 14:31:02,878 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:31:03,002 INFO L129 PetriNetUnfolder]: 133/384 cut-off events. [2021-03-25 14:31:03,002 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:31:03,006 INFO L84 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 384 events. 133/384 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2174 event pairs, 110 based on Foata normal form. 32/387 useless extension candidates. Maximal degree in co-relation 581. Up to 153 conditions per place. [2021-03-25 14:31:03,009 INFO L132 encePairwiseOnDemand]: 192/196 looper letters, 11 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2021-03-25 14:31:03,009 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 51 transitions, 140 flow [2021-03-25 14:31:03,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:31:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:31:03,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 538 transitions. [2021-03-25 14:31:03,026 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9149659863945578 [2021-03-25 14:31:03,027 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 538 transitions. [2021-03-25 14:31:03,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 538 transitions. [2021-03-25 14:31:03,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:31:03,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 538 transitions. [2021-03-25 14:31:03,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 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-25 14:31:03,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 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-25 14:31:03,047 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 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-25 14:31:03,048 INFO L185 Difference]: Start difference. First operand has 61 places, 49 transitions, 110 flow. Second operand 3 states and 538 transitions. [2021-03-25 14:31:03,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 51 transitions, 140 flow [2021-03-25 14:31:03,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 51 transitions, 136 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 14:31:03,055 INFO L241 Difference]: Finished difference. Result has 57 places, 46 transitions, 104 flow [2021-03-25 14:31:03,057 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2021-03-25 14:31:03,058 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2021-03-25 14:31:03,058 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:31:03,058 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 46 transitions, 104 flow [2021-03-25 14:31:03,059 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 46 transitions, 104 flow [2021-03-25 14:31:03,059 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 46 transitions, 104 flow [2021-03-25 14:31:03,065 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2021-03-25 14:31:03,065 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:31:03,065 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 46 events. 0/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:31:03,067 INFO L142 LiptonReduction]: Number of co-enabled transitions 652 [2021-03-25 14:31:04,087 INFO L154 LiptonReduction]: Checked pairs total: 2761 [2021-03-25 14:31:04,088 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-25 14:31:04,088 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1030 [2021-03-25 14:31:04,092 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 80 flow [2021-03-25 14:31:04,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 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-25 14:31:04,092 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:31:04,092 INFO L263 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] [2021-03-25 14:31:04,093 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:31:04,093 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:31:04,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:31:04,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1061219016, now seen corresponding path program 1 times [2021-03-25 14:31:04,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:31:04,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458938540] [2021-03-25 14:31:04,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:31:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:31:04,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:04,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:31:04,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:04,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:31:04,217 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:31:04,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:31:04,232 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:31:04,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:31:04,236 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-25 14:31:04,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458938540] [2021-03-25 14:31:04,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:31:04,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:31:04,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417665621] [2021-03-25 14:31:04,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:31:04,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:31:04,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:31:04,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:31:04,239 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 208 [2021-03-25 14:31:04,240 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 165.0) internal successors, (825), 5 states have internal predecessors, (825), 0 states have call successors, (0), 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-25 14:31:04,240 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:31:04,240 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 208 [2021-03-25 14:31:04,240 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:31:04,376 INFO L129 PetriNetUnfolder]: 241/518 cut-off events. [2021-03-25 14:31:04,376 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 14:31:04,378 INFO L84 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 518 events. 241/518 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2751 event pairs, 21 based on Foata normal form. 0/475 useless extension candidates. Maximal degree in co-relation 903. Up to 157 conditions per place. [2021-03-25 14:31:04,380 INFO L132 encePairwiseOnDemand]: 199/208 looper letters, 10 selfloop transitions, 7 changer transitions 18/59 dead transitions. [2021-03-25 14:31:04,380 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 59 transitions, 200 flow [2021-03-25 14:31:04,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:31:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:31:04,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1185 transitions. [2021-03-25 14:31:04,384 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8138736263736264 [2021-03-25 14:31:04,384 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1185 transitions. [2021-03-25 14:31:04,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1185 transitions. [2021-03-25 14:31:04,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:31:04,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1185 transitions. [2021-03-25 14:31:04,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 169.28571428571428) internal successors, (1185), 7 states have internal predecessors, (1185), 0 states have call successors, (0), 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-25 14:31:04,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 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-25 14:31:04,391 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 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-25 14:31:04,391 INFO L185 Difference]: Start difference. First operand has 45 places, 34 transitions, 80 flow. Second operand 7 states and 1185 transitions. [2021-03-25 14:31:04,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 59 transitions, 200 flow [2021-03-25 14:31:04,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:31:04,393 INFO L241 Difference]: Finished difference. Result has 54 places, 38 transitions, 136 flow [2021-03-25 14:31:04,393 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2021-03-25 14:31:04,394 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -7 predicate places. [2021-03-25 14:31:04,394 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:31:04,394 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 38 transitions, 136 flow [2021-03-25 14:31:04,395 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 38 transitions, 136 flow [2021-03-25 14:31:04,395 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 38 transitions, 136 flow [2021-03-25 14:31:04,437 INFO L129 PetriNetUnfolder]: 106/309 cut-off events. [2021-03-25 14:31:04,437 INFO L130 PetriNetUnfolder]: For 101/153 co-relation queries the response was YES. [2021-03-25 14:31:04,438 INFO L84 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 309 events. 106/309 cut-off events. For 101/153 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1801 event pairs, 61 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 667. Up to 153 conditions per place. [2021-03-25 14:31:04,441 INFO L142 LiptonReduction]: Number of co-enabled transitions 514 [2021-03-25 14:31:05,072 INFO L154 LiptonReduction]: Checked pairs total: 1125 [2021-03-25 14:31:05,073 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:31:05,073 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 679 [2021-03-25 14:31:05,073 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 130 flow [2021-03-25 14:31:05,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 165.0) internal successors, (825), 5 states have internal predecessors, (825), 0 states have call successors, (0), 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-25 14:31:05,074 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:31:05,074 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:31:05,074 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:31:05,074 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:31:05,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:31:05,075 INFO L82 PathProgramCache]: Analyzing trace with hash 2031713254, now seen corresponding path program 1 times [2021-03-25 14:31:05,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:31:05,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674324720] [2021-03-25 14:31:05,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:31:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:31:05,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:05,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:31:05,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:05,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:31:05,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-25 14:31:05,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674324720] [2021-03-25 14:31:05,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:31:05,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:31:05,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944365752] [2021-03-25 14:31:05,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:31:05,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:31:05,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:31:05,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:31:05,136 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 211 [2021-03-25 14:31:05,137 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 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-25 14:31:05,137 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:31:05,137 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 211 [2021-03-25 14:31:05,137 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:31:05,176 INFO L129 PetriNetUnfolder]: 93/269 cut-off events. [2021-03-25 14:31:05,176 INFO L130 PetriNetUnfolder]: For 192/294 co-relation queries the response was YES. [2021-03-25 14:31:05,177 INFO L84 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 269 events. 93/269 cut-off events. For 192/294 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1486 event pairs, 52 based on Foata normal form. 3/246 useless extension candidates. Maximal degree in co-relation 660. Up to 139 conditions per place. [2021-03-25 14:31:05,179 INFO L132 encePairwiseOnDemand]: 207/211 looper letters, 5 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2021-03-25 14:31:05,179 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 166 flow [2021-03-25 14:31:05,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:31:05,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:31:05,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2021-03-25 14:31:05,181 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8878357030015798 [2021-03-25 14:31:05,181 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 562 transitions. [2021-03-25 14:31:05,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 562 transitions. [2021-03-25 14:31:05,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:31:05,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 562 transitions. [2021-03-25 14:31:05,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 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-25 14:31:05,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 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-25 14:31:05,184 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 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-25 14:31:05,184 INFO L185 Difference]: Start difference. First operand has 47 places, 35 transitions, 130 flow. Second operand 3 states and 562 transitions. [2021-03-25 14:31:05,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 166 flow [2021-03-25 14:31:05,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 38 transitions, 150 flow, removed 7 selfloop flow, removed 3 redundant places. [2021-03-25 14:31:05,187 INFO L241 Difference]: Finished difference. Result has 47 places, 38 transitions, 152 flow [2021-03-25 14:31:05,187 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2021-03-25 14:31:05,188 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -14 predicate places. [2021-03-25 14:31:05,188 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:31:05,188 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 152 flow [2021-03-25 14:31:05,188 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 152 flow [2021-03-25 14:31:05,188 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 152 flow [2021-03-25 14:31:05,218 INFO L129 PetriNetUnfolder]: 93/273 cut-off events. [2021-03-25 14:31:05,218 INFO L130 PetriNetUnfolder]: For 131/159 co-relation queries the response was YES. [2021-03-25 14:31:05,219 INFO L84 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 273 events. 93/273 cut-off events. For 131/159 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1516 event pairs, 37 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 586. Up to 139 conditions per place. [2021-03-25 14:31:05,222 INFO L142 LiptonReduction]: Number of co-enabled transitions 572 [2021-03-25 14:31:05,593 WARN L205 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-25 14:31:05,763 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-25 14:31:06,130 WARN L205 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-25 14:31:06,285 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-25 14:31:06,293 INFO L154 LiptonReduction]: Checked pairs total: 978 [2021-03-25 14:31:06,293 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:31:06,294 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1106 [2021-03-25 14:31:06,294 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 150 flow [2021-03-25 14:31:06,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 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-25 14:31:06,295 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:31:06,295 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:31:06,295 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:31:06,295 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:31:06,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:31:06,296 INFO L82 PathProgramCache]: Analyzing trace with hash -600934187, now seen corresponding path program 1 times [2021-03-25 14:31:06,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:31:06,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092535090] [2021-03-25 14:31:06,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:31:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:31:06,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:06,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:31:06,413 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:31:06,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:31:06,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:06,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:31:06,421 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-25 14:31:06,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092535090] [2021-03-25 14:31:06,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:31:06,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:31:06,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528431092] [2021-03-25 14:31:06,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:31:06,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:31:06,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:31:06,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:31:06,424 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 212 [2021-03-25 14:31:06,425 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 177.75) internal successors, (711), 4 states have internal predecessors, (711), 0 states have call successors, (0), 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-25 14:31:06,425 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:31:06,425 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 212 [2021-03-25 14:31:06,425 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:31:06,584 INFO L129 PetriNetUnfolder]: 754/1413 cut-off events. [2021-03-25 14:31:06,584 INFO L130 PetriNetUnfolder]: For 301/399 co-relation queries the response was YES. [2021-03-25 14:31:06,591 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3044 conditions, 1413 events. 754/1413 cut-off events. For 301/399 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 10155 event pairs, 314 based on Foata normal form. 89/1208 useless extension candidates. Maximal degree in co-relation 3030. Up to 924 conditions per place. [2021-03-25 14:31:06,598 INFO L132 encePairwiseOnDemand]: 205/212 looper letters, 12 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2021-03-25 14:31:06,598 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 51 transitions, 222 flow [2021-03-25 14:31:06,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:31:06,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:31:06,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 909 transitions. [2021-03-25 14:31:06,601 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8575471698113207 [2021-03-25 14:31:06,601 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 909 transitions. [2021-03-25 14:31:06,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 909 transitions. [2021-03-25 14:31:06,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:31:06,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 909 transitions. [2021-03-25 14:31:06,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 181.8) internal successors, (909), 5 states have internal predecessors, (909), 0 states have call successors, (0), 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-25 14:31:06,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 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-25 14:31:06,606 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 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-25 14:31:06,606 INFO L185 Difference]: Start difference. First operand has 46 places, 37 transitions, 150 flow. Second operand 5 states and 909 transitions. [2021-03-25 14:31:06,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 51 transitions, 222 flow [2021-03-25 14:31:06,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:31:06,611 INFO L241 Difference]: Finished difference. Result has 52 places, 46 transitions, 221 flow [2021-03-25 14:31:06,611 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2021-03-25 14:31:06,612 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -9 predicate places. [2021-03-25 14:31:06,612 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:31:06,612 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 46 transitions, 221 flow [2021-03-25 14:31:06,612 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 46 transitions, 221 flow [2021-03-25 14:31:06,613 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 46 transitions, 221 flow [2021-03-25 14:31:06,716 INFO L129 PetriNetUnfolder]: 583/1157 cut-off events. [2021-03-25 14:31:06,716 INFO L130 PetriNetUnfolder]: For 843/1256 co-relation queries the response was YES. [2021-03-25 14:31:06,723 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3261 conditions, 1157 events. 583/1157 cut-off events. For 843/1256 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 8511 event pairs, 273 based on Foata normal form. 5/1013 useless extension candidates. Maximal degree in co-relation 3245. Up to 703 conditions per place. [2021-03-25 14:31:06,736 INFO L142 LiptonReduction]: Number of co-enabled transitions 844 [2021-03-25 14:31:07,082 INFO L154 LiptonReduction]: Checked pairs total: 1146 [2021-03-25 14:31:07,082 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:31:07,082 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 470 [2021-03-25 14:31:07,083 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 215 flow [2021-03-25 14:31:07,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 177.75) internal successors, (711), 4 states have internal predecessors, (711), 0 states have call successors, (0), 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-25 14:31:07,084 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:31:07,084 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:31:07,084 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:31:07,084 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:31:07,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:31:07,084 INFO L82 PathProgramCache]: Analyzing trace with hash -380942309, now seen corresponding path program 1 times [2021-03-25 14:31:07,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:31:07,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074793489] [2021-03-25 14:31:07,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:31:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:31:07,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:07,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:31:07,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:07,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:31:07,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:07,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:31:07,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:07,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 14:31:07,204 INFO L142 QuantifierPusher]: treesize reduction 14, result has 67.4 percent of original size [2021-03-25 14:31:07,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 14:31:07,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:07,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:31:07,231 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-25 14:31:07,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074793489] [2021-03-25 14:31:07,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:31:07,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:31:07,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524070820] [2021-03-25 14:31:07,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:31:07,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:31:07,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:31:07,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:31:07,234 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 212 [2021-03-25 14:31:07,237 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 215 flow. Second operand has 7 states, 7 states have (on average 149.42857142857142) internal successors, (1046), 7 states have internal predecessors, (1046), 0 states have call successors, (0), 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-25 14:31:07,237 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:31:07,237 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 212 [2021-03-25 14:31:07,237 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:31:08,483 INFO L129 PetriNetUnfolder]: 4926/7877 cut-off events. [2021-03-25 14:31:08,483 INFO L130 PetriNetUnfolder]: For 9084/9769 co-relation queries the response was YES. [2021-03-25 14:31:08,517 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23996 conditions, 7877 events. 4926/7877 cut-off events. For 9084/9769 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 54500 event pairs, 890 based on Foata normal form. 181/7593 useless extension candidates. Maximal degree in co-relation 23978. Up to 2544 conditions per place. [2021-03-25 14:31:08,563 INFO L132 encePairwiseOnDemand]: 198/212 looper letters, 47 selfloop transitions, 42 changer transitions 0/107 dead transitions. [2021-03-25 14:31:08,563 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 107 transitions, 674 flow [2021-03-25 14:31:08,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:31:08,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:31:08,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1252 transitions. [2021-03-25 14:31:08,566 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7382075471698113 [2021-03-25 14:31:08,566 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1252 transitions. [2021-03-25 14:31:08,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1252 transitions. [2021-03-25 14:31:08,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:31:08,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1252 transitions. [2021-03-25 14:31:08,570 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-25 14:31:08,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 0 states have call successors, (0), 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-25 14:31:08,573 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 0 states have call successors, (0), 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-25 14:31:08,573 INFO L185 Difference]: Start difference. First operand has 52 places, 45 transitions, 215 flow. Second operand 8 states and 1252 transitions. [2021-03-25 14:31:08,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 107 transitions, 674 flow [2021-03-25 14:31:08,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 107 transitions, 659 flow, removed 5 selfloop flow, removed 2 redundant places. [2021-03-25 14:31:08,754 INFO L241 Difference]: Finished difference. Result has 60 places, 79 transitions, 590 flow [2021-03-25 14:31:08,754 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=590, PETRI_PLACES=60, PETRI_TRANSITIONS=79} [2021-03-25 14:31:08,754 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -1 predicate places. [2021-03-25 14:31:08,754 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:31:08,755 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 79 transitions, 590 flow [2021-03-25 14:31:08,755 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 79 transitions, 590 flow [2021-03-25 14:31:08,755 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 79 transitions, 590 flow [2021-03-25 14:31:09,446 INFO L129 PetriNetUnfolder]: 3302/5802 cut-off events. [2021-03-25 14:31:09,446 INFO L130 PetriNetUnfolder]: For 11648/13315 co-relation queries the response was YES. [2021-03-25 14:31:09,476 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20348 conditions, 5802 events. 3302/5802 cut-off events. For 11648/13315 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 45539 event pairs, 1041 based on Foata normal form. 195/5468 useless extension candidates. Maximal degree in co-relation 20327. Up to 2359 conditions per place. [2021-03-25 14:31:09,536 INFO L142 LiptonReduction]: Number of co-enabled transitions 1310 [2021-03-25 14:31:13,566 INFO L154 LiptonReduction]: Checked pairs total: 398 [2021-03-25 14:31:13,566 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:31:13,566 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4812 [2021-03-25 14:31:13,567 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 79 transitions, 590 flow [2021-03-25 14:31:13,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 149.42857142857142) internal successors, (1046), 7 states have internal predecessors, (1046), 0 states have call successors, (0), 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-25 14:31:13,568 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:31:13,568 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:31:13,568 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:31:13,568 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:31:13,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:31:13,568 INFO L82 PathProgramCache]: Analyzing trace with hash -371212202, now seen corresponding path program 1 times [2021-03-25 14:31:13,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:31:13,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653861783] [2021-03-25 14:31:13,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:31:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:31:13,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:13,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:31:13,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:13,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:31:13,613 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-25 14:31:13,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653861783] [2021-03-25 14:31:13,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:31:13,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:31:13,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383602810] [2021-03-25 14:31:13,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:31:13,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:31:13,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:31:13,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:31:13,615 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 212 [2021-03-25 14:31:13,615 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 79 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 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-25 14:31:13,616 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:31:13,616 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 212 [2021-03-25 14:31:13,616 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:31:14,331 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1158] L795-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_149 (+ v_~__unbuffered_cnt~0_150 1)) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_150} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_149, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][34], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, Black: 161#(= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork1InUse, Black: 164#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 142#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 177#(and (= ~b$r_buff0_thd2~0 0) (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 53#P2EXITtrue, 86#L889true, Black: 179#(and (= ~b$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))) (= ~b$w_buff0_used~0 ~x~0) (= ~b$w_buff0_used~0 1)), Black: 139#true, Black: 141#(= ~__unbuffered_p3_EAX~0 0), Black: 172#(and (= ~b$r_buff0_thd2~0 0) (= ~x~0 1)), Black: 173#(and (= ~b$r_buff0_thd2~0 0) (= ~b$w_buff0_used~0 ~x~0) (= ~b$w_buff0_used~0 1)), 25#L847true, Black: 174#(and (= ~b$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 59#P0EXITtrue, 188#(= ~y~0 1), 126#P1EXITtrue, Black: 156#(= ~y~0 0)]) [2021-03-25 14:31:14,332 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-25 14:31:14,332 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 14:31:14,332 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 14:31:14,332 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 14:31:14,420 INFO L129 PetriNetUnfolder]: 3997/7005 cut-off events. [2021-03-25 14:31:14,420 INFO L130 PetriNetUnfolder]: For 18241/21249 co-relation queries the response was YES. [2021-03-25 14:31:14,458 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24703 conditions, 7005 events. 3997/7005 cut-off events. For 18241/21249 co-relation queries the response was YES. Maximal size of possible extension queue 755. Compared 57006 event pairs, 1583 based on Foata normal form. 532/6753 useless extension candidates. Maximal degree in co-relation 24680. Up to 3148 conditions per place. [2021-03-25 14:31:14,500 INFO L132 encePairwiseOnDemand]: 209/212 looper letters, 6 selfloop transitions, 16 changer transitions 0/79 dead transitions. [2021-03-25 14:31:14,500 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 79 transitions, 634 flow [2021-03-25 14:31:14,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:31:14,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:31:14,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 561 transitions. [2021-03-25 14:31:14,502 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8820754716981132 [2021-03-25 14:31:14,502 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 561 transitions. [2021-03-25 14:31:14,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 561 transitions. [2021-03-25 14:31:14,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:31:14,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 561 transitions. [2021-03-25 14:31:14,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 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-25 14:31:14,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 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-25 14:31:14,504 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 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-25 14:31:14,504 INFO L185 Difference]: Start difference. First operand has 60 places, 79 transitions, 590 flow. Second operand 3 states and 561 transitions. [2021-03-25 14:31:14,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 79 transitions, 634 flow [2021-03-25 14:31:14,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 79 transitions, 629 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-25 14:31:14,520 INFO L241 Difference]: Finished difference. Result has 62 places, 79 transitions, 635 flow [2021-03-25 14:31:14,520 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=635, PETRI_PLACES=62, PETRI_TRANSITIONS=79} [2021-03-25 14:31:14,520 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 1 predicate places. [2021-03-25 14:31:14,520 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:31:14,520 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 79 transitions, 635 flow [2021-03-25 14:31:14,520 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 79 transitions, 635 flow [2021-03-25 14:31:14,521 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 79 transitions, 635 flow [2021-03-25 14:31:15,397 INFO L129 PetriNetUnfolder]: 4213/7353 cut-off events. [2021-03-25 14:31:15,397 INFO L130 PetriNetUnfolder]: For 17732/19939 co-relation queries the response was YES. [2021-03-25 14:31:15,435 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25982 conditions, 7353 events. 4213/7353 cut-off events. For 17732/19939 co-relation queries the response was YES. Maximal size of possible extension queue 768. Compared 60165 event pairs, 1327 based on Foata normal form. 253/6864 useless extension candidates. Maximal degree in co-relation 25960. Up to 3219 conditions per place. [2021-03-25 14:31:15,509 INFO L142 LiptonReduction]: Number of co-enabled transitions 1310 [2021-03-25 14:31:19,665 INFO L154 LiptonReduction]: Checked pairs total: 347 [2021-03-25 14:31:19,665 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:31:19,665 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5145 [2021-03-25 14:31:19,666 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 79 transitions, 635 flow [2021-03-25 14:31:19,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 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-25 14:31:19,666 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:31:19,667 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:31:19,667 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:31:19,667 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:31:19,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:31:19,667 INFO L82 PathProgramCache]: Analyzing trace with hash 44744624, now seen corresponding path program 1 times [2021-03-25 14:31:19,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:31:19,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38201668] [2021-03-25 14:31:19,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:31:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:31:19,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:19,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:31:19,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:19,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:31:19,783 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:31:19,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:31:19,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:19,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:31:19,791 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-25 14:31:19,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38201668] [2021-03-25 14:31:19,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:31:19,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:31:19,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810801899] [2021-03-25 14:31:19,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:31:19,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:31:19,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:31:19,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:31:19,793 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 212 [2021-03-25 14:31:19,793 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 79 transitions, 635 flow. Second operand has 5 states, 5 states have (on average 177.8) internal successors, (889), 5 states have internal predecessors, (889), 0 states have call successors, (0), 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-25 14:31:19,793 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:31:19,794 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 212 [2021-03-25 14:31:19,794 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:31:20,420 INFO L129 PetriNetUnfolder]: 3082/5790 cut-off events. [2021-03-25 14:31:20,420 INFO L130 PetriNetUnfolder]: For 15925/21876 co-relation queries the response was YES. [2021-03-25 14:31:20,454 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21897 conditions, 5790 events. 3082/5790 cut-off events. For 15925/21876 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 48771 event pairs, 491 based on Foata normal form. 1493/6628 useless extension candidates. Maximal degree in co-relation 21873. Up to 3245 conditions per place. [2021-03-25 14:31:20,480 INFO L132 encePairwiseOnDemand]: 205/212 looper letters, 15 selfloop transitions, 14 changer transitions 0/94 dead transitions. [2021-03-25 14:31:20,481 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 94 transitions, 773 flow [2021-03-25 14:31:20,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:31:20,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:31:20,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1091 transitions. [2021-03-25 14:31:20,484 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8577044025157232 [2021-03-25 14:31:20,484 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1091 transitions. [2021-03-25 14:31:20,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1091 transitions. [2021-03-25 14:31:20,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:31:20,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1091 transitions. [2021-03-25 14:31:20,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 181.83333333333334) internal successors, (1091), 6 states have internal predecessors, (1091), 0 states have call successors, (0), 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-25 14:31:20,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-25 14:31:20,490 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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-25 14:31:20,490 INFO L185 Difference]: Start difference. First operand has 62 places, 79 transitions, 635 flow. Second operand 6 states and 1091 transitions. [2021-03-25 14:31:20,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 94 transitions, 773 flow [2021-03-25 14:31:20,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 94 transitions, 751 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-25 14:31:20,504 INFO L241 Difference]: Finished difference. Result has 69 places, 88 transitions, 741 flow [2021-03-25 14:31:20,504 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=741, PETRI_PLACES=69, PETRI_TRANSITIONS=88} [2021-03-25 14:31:20,504 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 8 predicate places. [2021-03-25 14:31:20,504 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:31:20,504 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 88 transitions, 741 flow [2021-03-25 14:31:20,504 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 88 transitions, 741 flow [2021-03-25 14:31:20,505 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 88 transitions, 741 flow [2021-03-25 14:31:20,957 INFO L129 PetriNetUnfolder]: 2313/4646 cut-off events. [2021-03-25 14:31:20,957 INFO L130 PetriNetUnfolder]: For 16988/19354 co-relation queries the response was YES. [2021-03-25 14:31:20,980 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20652 conditions, 4646 events. 2313/4646 cut-off events. For 16988/19354 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 40168 event pairs, 390 based on Foata normal form. 340/4686 useless extension candidates. Maximal degree in co-relation 20626. Up to 2497 conditions per place. [2021-03-25 14:31:21,021 INFO L142 LiptonReduction]: Number of co-enabled transitions 1812 [2021-03-25 14:31:21,983 INFO L154 LiptonReduction]: Checked pairs total: 454 [2021-03-25 14:31:21,983 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:31:21,983 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1479 [2021-03-25 14:31:21,984 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 88 transitions, 741 flow [2021-03-25 14:31:21,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 177.8) internal successors, (889), 5 states have internal predecessors, (889), 0 states have call successors, (0), 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-25 14:31:21,984 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:31:21,984 INFO L263 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-25 14:31:21,984 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:31:21,984 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:31:21,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:31:21,985 INFO L82 PathProgramCache]: Analyzing trace with hash -334565284, now seen corresponding path program 1 times [2021-03-25 14:31:21,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:31:21,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385359012] [2021-03-25 14:31:21,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:31:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:31:22,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:22,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:31:22,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:22,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:31:22,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:22,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:31:22,069 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:31:22,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:31:22,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:22,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:31:22,076 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-25 14:31:22,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385359012] [2021-03-25 14:31:22,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:31:22,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:31:22,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962291061] [2021-03-25 14:31:22,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:31:22,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:31:22,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:31:22,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:31:22,079 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 212 [2021-03-25 14:31:22,080 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 88 transitions, 741 flow. Second operand has 6 states, 6 states have (on average 177.83333333333334) internal successors, (1067), 6 states have internal predecessors, (1067), 0 states have call successors, (0), 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-25 14:31:22,080 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:31:22,080 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 212 [2021-03-25 14:31:22,080 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:31:22,623 INFO L129 PetriNetUnfolder]: 2457/4778 cut-off events. [2021-03-25 14:31:22,623 INFO L130 PetriNetUnfolder]: For 27741/40173 co-relation queries the response was YES. [2021-03-25 14:31:22,649 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22991 conditions, 4778 events. 2457/4778 cut-off events. For 27741/40173 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 40456 event pairs, 160 based on Foata normal form. 1913/6138 useless extension candidates. Maximal degree in co-relation 22963. Up to 3046 conditions per place. [2021-03-25 14:31:22,675 INFO L132 encePairwiseOnDemand]: 205/212 looper letters, 12 selfloop transitions, 23 changer transitions 4/104 dead transitions. [2021-03-25 14:31:22,675 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 104 transitions, 951 flow [2021-03-25 14:31:22,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:31:22,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:31:22,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1455 transitions. [2021-03-25 14:31:22,679 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8579009433962265 [2021-03-25 14:31:22,679 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1455 transitions. [2021-03-25 14:31:22,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1455 transitions. [2021-03-25 14:31:22,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:31:22,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1455 transitions. [2021-03-25 14:31:22,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 181.875) internal successors, (1455), 8 states have internal predecessors, (1455), 0 states have call successors, (0), 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-25 14:31:22,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 0 states have call successors, (0), 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-25 14:31:22,686 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 0 states have call successors, (0), 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-25 14:31:22,686 INFO L185 Difference]: Start difference. First operand has 69 places, 88 transitions, 741 flow. Second operand 8 states and 1455 transitions. [2021-03-25 14:31:22,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 104 transitions, 951 flow [2021-03-25 14:31:23,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 104 transitions, 907 flow, removed 17 selfloop flow, removed 2 redundant places. [2021-03-25 14:31:23,007 INFO L241 Difference]: Finished difference. Result has 77 places, 97 transitions, 873 flow [2021-03-25 14:31:23,007 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=873, PETRI_PLACES=77, PETRI_TRANSITIONS=97} [2021-03-25 14:31:23,007 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 16 predicate places. [2021-03-25 14:31:23,007 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:31:23,007 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 97 transitions, 873 flow [2021-03-25 14:31:23,007 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 97 transitions, 873 flow [2021-03-25 14:31:23,008 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 77 places, 97 transitions, 873 flow [2021-03-25 14:31:23,264 INFO L129 PetriNetUnfolder]: 1643/3699 cut-off events. [2021-03-25 14:31:23,264 INFO L130 PetriNetUnfolder]: For 15518/16389 co-relation queries the response was YES. [2021-03-25 14:31:23,281 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16644 conditions, 3699 events. 1643/3699 cut-off events. For 15518/16389 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 34004 event pairs, 109 based on Foata normal form. 186/3704 useless extension candidates. Maximal degree in co-relation 16615. Up to 1666 conditions per place. [2021-03-25 14:31:23,318 INFO L142 LiptonReduction]: Number of co-enabled transitions 1986 [2021-03-25 14:31:24,026 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:31:24,156 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:31:24,953 INFO L154 LiptonReduction]: Checked pairs total: 467 [2021-03-25 14:31:24,953 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:31:24,953 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1946 [2021-03-25 14:31:24,954 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 97 transitions, 885 flow [2021-03-25 14:31:24,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 177.83333333333334) internal successors, (1067), 6 states have internal predecessors, (1067), 0 states have call successors, (0), 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-25 14:31:24,954 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:31:24,954 INFO L263 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] [2021-03-25 14:31:24,954 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:31:24,954 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:31:24,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:31:24,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1042577144, now seen corresponding path program 1 times [2021-03-25 14:31:24,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:31:24,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489529029] [2021-03-25 14:31:24,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:31:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:31:24,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:25,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:31:25,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:25,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:31:25,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:25,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:31:25,006 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-25 14:31:25,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489529029] [2021-03-25 14:31:25,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:31:25,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:31:25,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914040132] [2021-03-25 14:31:25,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:31:25,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:31:25,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:31:25,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:31:25,008 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 213 [2021-03-25 14:31:25,009 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 97 transitions, 885 flow. Second operand has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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-25 14:31:25,009 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:31:25,009 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 213 [2021-03-25 14:31:25,009 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:31:25,285 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1072] L768-->L775: Formula: (let ((.cse8 (= (mod v_~b$w_buff0_used~0_455 256) 0)) (.cse9 (= (mod v_~b$r_buff1_thd1~0_58 256) 0)) (.cse13 (= (mod v_~b$w_buff1_used~0_360 256) 0)) (.cse12 (= (mod v_~b$r_buff0_thd1~0_71 256) 0)) (.cse14 (= (mod v_~b$w_buff0_used~0_456 256) 0))) (let ((.cse2 (or .cse12 .cse14)) (.cse0 (not .cse14)) (.cse11 (not .cse13)) (.cse7 (not .cse9)) (.cse3 (not .cse8)) (.cse1 (not .cse12)) (.cse10 (or .cse9 .cse13)) (.cse4 (or .cse12 .cse8))) (and (or (and .cse0 (= v_~b$w_buff0_used~0_455 0) .cse1) (and (= v_~b$w_buff0_used~0_456 v_~b$w_buff0_used~0_455) .cse2)) (or (and .cse3 (= v_~b$r_buff0_thd1~0_70 0) .cse1) (and .cse4 (= v_~b$r_buff0_thd1~0_71 v_~b$r_buff0_thd1~0_70))) (let ((.cse5 (= (mod v_~b$r_buff0_thd1~0_70 256) 0)) (.cse6 (= (mod v_~b$w_buff1_used~0_359 256) 0))) (or (and (= v_~b$r_buff1_thd1~0_57 0) (or (and .cse3 (not .cse5)) (and (not .cse6) .cse7))) (and (= v_~b$r_buff1_thd1~0_58 v_~b$r_buff1_thd1~0_57) (or .cse8 .cse5) (or .cse6 .cse9)))) (or (and (= |v_P0_#t~ite5_37| v_~b~0_146) (or (and (= |v_P0_#t~ite5_37| v_~b~0_147) .cse10) (and (= v_~b$w_buff1~0_102 |v_P0_#t~ite5_37|) .cse11 .cse7)) .cse2) (and (= v_~b~0_146 v_~b$w_buff0~0_83) .cse0 .cse1 (= |v_P0_#t~ite5_37| |v_P0Thread1of1ForFork1_#t~ite5_1|))) (or (and (or (and .cse11 .cse7) (and .cse3 .cse1)) (= v_~b$w_buff1_used~0_359 0)) (and (= v_~b$w_buff1_used~0_359 v_~b$w_buff1_used~0_360) .cse10 .cse4))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_456, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_71, P0Thread1of1ForFork1_#t~ite5=|v_P0Thread1of1ForFork1_#t~ite5_1|, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_58, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_360, ~b~0=v_~b~0_147, ~b$w_buff1~0=v_~b$w_buff1~0_102, ~b$w_buff0~0=v_~b$w_buff0~0_83} OutVars{P0Thread1of1ForFork1_#t~ite10=|v_P0Thread1of1ForFork1_#t~ite10_1|, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_70, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_57, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_455, P0Thread1of1ForFork1_#t~ite5=|v_P0Thread1of1ForFork1_#t~ite5_2|, P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_1|, P0Thread1of1ForFork1_#t~ite9=|v_P0Thread1of1ForFork1_#t~ite9_1|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_359, ~b~0=v_~b~0_146, P0Thread1of1ForFork1_#t~ite6=|v_P0Thread1of1ForFork1_#t~ite6_1|, P0Thread1of1ForFork1_#t~ite7=|v_P0Thread1of1ForFork1_#t~ite7_1|, ~b$w_buff1~0=v_~b$w_buff1~0_102, ~b$w_buff0~0=v_~b$w_buff0~0_83} AuxVars[|v_P0_#t~ite5_37|] AssignedVars[P0Thread1of1ForFork1_#t~ite10, ~b$w_buff0_used~0, ~b$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite5, ~b$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9, ~b$w_buff1_used~0, ~b~0, P0Thread1of1ForFork1_#t~ite6, P0Thread1of1ForFork1_#t~ite7][6], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 69#L785true, P0Thread1of1ForFork1InUse, Black: 194#(<= ~__unbuffered_cnt~0 1), Black: 195#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 197#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), 139#true, 204#(= ~__unbuffered_cnt~0 0), 78#L854true, Black: 211#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 206#(<= ~__unbuffered_cnt~0 2), Black: 141#(= ~__unbuffered_p3_EAX~0 0), Black: 207#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 88#L878-1true, Black: 142#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 218#(= ~z~0 1), 28#L815true, Black: 156#(= ~y~0 0), 161#(= ~__unbuffered_cnt~0 0), Black: 164#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 177#(and (= ~b$r_buff0_thd2~0 0) (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 114#L775true, Black: 179#(and (= ~b$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))) (= ~b$w_buff0_used~0 ~x~0) (= ~b$w_buff0_used~0 1)), Black: 172#(and (= ~b$r_buff0_thd2~0 0) (= ~x~0 1)), Black: 173#(and (= ~b$r_buff0_thd2~0 0) (= ~b$w_buff0_used~0 ~x~0) (= ~b$w_buff0_used~0 1)), Black: 174#(and (= ~b$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 188#(= ~y~0 1)]) [2021-03-25 14:31:25,285 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-25 14:31:25,285 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:31:25,285 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:31:25,285 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 14:31:25,510 INFO L129 PetriNetUnfolder]: 2621/5668 cut-off events. [2021-03-25 14:31:25,510 INFO L130 PetriNetUnfolder]: For 28453/30489 co-relation queries the response was YES. [2021-03-25 14:31:25,535 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26166 conditions, 5668 events. 2621/5668 cut-off events. For 28453/30489 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 54030 event pairs, 264 based on Foata normal form. 368/5655 useless extension candidates. Maximal degree in co-relation 26135. Up to 2665 conditions per place. [2021-03-25 14:31:25,555 INFO L132 encePairwiseOnDemand]: 209/213 looper letters, 6 selfloop transitions, 6 changer transitions 0/100 dead transitions. [2021-03-25 14:31:25,555 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 100 transitions, 933 flow [2021-03-25 14:31:25,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:31:25,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:31:25,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 736 transitions. [2021-03-25 14:31:25,557 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.863849765258216 [2021-03-25 14:31:25,557 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 736 transitions. [2021-03-25 14:31:25,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 736 transitions. [2021-03-25 14:31:25,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:31:25,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 736 transitions. [2021-03-25 14:31:25,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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-25 14:31:25,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 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-25 14:31:25,561 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 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-25 14:31:25,561 INFO L185 Difference]: Start difference. First operand has 77 places, 97 transitions, 885 flow. Second operand 4 states and 736 transitions. [2021-03-25 14:31:25,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 100 transitions, 933 flow [2021-03-25 14:31:26,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 100 transitions, 832 flow, removed 41 selfloop flow, removed 4 redundant places. [2021-03-25 14:31:26,233 INFO L241 Difference]: Finished difference. Result has 78 places, 100 transitions, 841 flow [2021-03-25 14:31:26,233 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=841, PETRI_PLACES=78, PETRI_TRANSITIONS=100} [2021-03-25 14:31:26,234 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 17 predicate places. [2021-03-25 14:31:26,234 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:31:26,234 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 100 transitions, 841 flow [2021-03-25 14:31:26,234 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 100 transitions, 841 flow [2021-03-25 14:31:26,234 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 78 places, 100 transitions, 841 flow [2021-03-25 14:31:26,688 INFO L129 PetriNetUnfolder]: 2685/5964 cut-off events. [2021-03-25 14:31:26,688 INFO L130 PetriNetUnfolder]: For 16432/17595 co-relation queries the response was YES. [2021-03-25 14:31:26,713 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21394 conditions, 5964 events. 2685/5964 cut-off events. For 16432/17595 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 58730 event pairs, 207 based on Foata normal form. 382/6017 useless extension candidates. Maximal degree in co-relation 21364. Up to 1396 conditions per place. [2021-03-25 14:31:26,755 INFO L142 LiptonReduction]: Number of co-enabled transitions 2036 [2021-03-25 14:31:30,795 INFO L154 LiptonReduction]: Checked pairs total: 425 [2021-03-25 14:31:30,795 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:31:30,795 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4561 [2021-03-25 14:31:30,796 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 100 transitions, 844 flow [2021-03-25 14:31:30,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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-25 14:31:30,796 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:31:30,796 INFO L263 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] [2021-03-25 14:31:30,796 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:31:30,796 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:31:30,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:31:30,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1003763402, now seen corresponding path program 2 times [2021-03-25 14:31:30,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:31:30,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606195493] [2021-03-25 14:31:30,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:31:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:31:30,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:30,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:31:30,885 INFO L142 QuantifierPusher]: treesize reduction 5, result has 87.8 percent of original size [2021-03-25 14:31:30,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 14:31:30,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:30,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:31:30,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:30,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:31:30,921 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-25 14:31:30,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606195493] [2021-03-25 14:31:30,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:31:30,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:31:30,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692077541] [2021-03-25 14:31:30,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:31:30,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:31:30,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:31:30,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:31:30,923 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 214 [2021-03-25 14:31:30,924 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 100 transitions, 844 flow. Second operand has 6 states, 6 states have (on average 162.33333333333334) internal successors, (974), 6 states have internal predecessors, (974), 0 states have call successors, (0), 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-25 14:31:30,924 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:31:30,924 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 214 [2021-03-25 14:31:30,924 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:31:32,172 INFO L129 PetriNetUnfolder]: 5757/12587 cut-off events. [2021-03-25 14:31:32,172 INFO L130 PetriNetUnfolder]: For 39669/42548 co-relation queries the response was YES. [2021-03-25 14:31:32,229 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46761 conditions, 12587 events. 5757/12587 cut-off events. For 39669/42548 co-relation queries the response was YES. Maximal size of possible extension queue 1543. Compared 137039 event pairs, 297 based on Foata normal form. 821/12763 useless extension candidates. Maximal degree in co-relation 46729. Up to 2902 conditions per place. [2021-03-25 14:31:32,258 INFO L132 encePairwiseOnDemand]: 205/214 looper letters, 33 selfloop transitions, 22 changer transitions 7/137 dead transitions. [2021-03-25 14:31:32,258 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 137 transitions, 1266 flow [2021-03-25 14:31:32,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:31:32,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:31:32,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1159 transitions. [2021-03-25 14:31:32,261 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7736982643524699 [2021-03-25 14:31:32,261 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1159 transitions. [2021-03-25 14:31:32,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1159 transitions. [2021-03-25 14:31:32,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:31:32,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1159 transitions. [2021-03-25 14:31:32,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 165.57142857142858) internal successors, (1159), 7 states have internal predecessors, (1159), 0 states have call successors, (0), 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-25 14:31:32,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 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-25 14:31:32,267 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 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-25 14:31:32,267 INFO L185 Difference]: Start difference. First operand has 78 places, 100 transitions, 844 flow. Second operand 7 states and 1159 transitions. [2021-03-25 14:31:32,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 137 transitions, 1266 flow [2021-03-25 14:31:33,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 137 transitions, 1264 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:31:33,644 INFO L241 Difference]: Finished difference. Result has 86 places, 117 transitions, 1064 flow [2021-03-25 14:31:33,644 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1064, PETRI_PLACES=86, PETRI_TRANSITIONS=117} [2021-03-25 14:31:33,645 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 25 predicate places. [2021-03-25 14:31:33,645 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:31:33,645 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 117 transitions, 1064 flow [2021-03-25 14:31:33,645 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 117 transitions, 1064 flow [2021-03-25 14:31:33,646 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 117 transitions, 1064 flow [2021-03-25 14:31:34,726 INFO L129 PetriNetUnfolder]: 5565/12342 cut-off events. [2021-03-25 14:31:34,726 INFO L130 PetriNetUnfolder]: For 37018/39418 co-relation queries the response was YES. [2021-03-25 14:31:34,778 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45676 conditions, 12342 events. 5565/12342 cut-off events. For 37018/39418 co-relation queries the response was YES. Maximal size of possible extension queue 1585. Compared 136296 event pairs, 314 based on Foata normal form. 644/12303 useless extension candidates. Maximal degree in co-relation 45642. Up to 2957 conditions per place. [2021-03-25 14:31:34,871 INFO L142 LiptonReduction]: Number of co-enabled transitions 2668 [2021-03-25 14:31:35,424 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:31:35,424 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:31:35,424 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1779 [2021-03-25 14:31:35,425 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 117 transitions, 1064 flow [2021-03-25 14:31:35,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 162.33333333333334) internal successors, (974), 6 states have internal predecessors, (974), 0 states have call successors, (0), 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-25 14:31:35,426 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:31:35,426 INFO L263 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] [2021-03-25 14:31:35,426 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:31:35,426 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:31:35,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:31:35,426 INFO L82 PathProgramCache]: Analyzing trace with hash 2025294216, now seen corresponding path program 1 times [2021-03-25 14:31:35,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:31:35,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538641502] [2021-03-25 14:31:35,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:31:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:31:35,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:35,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:31:35,496 INFO L142 QuantifierPusher]: treesize reduction 4, result has 87.9 percent of original size [2021-03-25 14:31:35,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 14:31:35,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:35,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:31:35,532 INFO L142 QuantifierPusher]: treesize reduction 26, result has 54.4 percent of original size [2021-03-25 14:31:35,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 14:31:35,559 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:31:35,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:31:35,572 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-25 14:31:35,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538641502] [2021-03-25 14:31:35,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:31:35,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:31:35,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133209047] [2021-03-25 14:31:35,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:31:35,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:31:35,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:31:35,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:31:35,575 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 214 [2021-03-25 14:31:35,576 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 117 transitions, 1064 flow. Second operand has 7 states, 7 states have (on average 145.71428571428572) internal successors, (1020), 7 states have internal predecessors, (1020), 0 states have call successors, (0), 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-25 14:31:35,576 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:31:35,576 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 214 [2021-03-25 14:31:35,577 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:31:37,684 INFO L129 PetriNetUnfolder]: 8471/17866 cut-off events. [2021-03-25 14:31:37,684 INFO L130 PetriNetUnfolder]: For 67719/74260 co-relation queries the response was YES. [2021-03-25 14:31:37,757 INFO L84 FinitePrefix]: Finished finitePrefix Result has 73073 conditions, 17866 events. 8471/17866 cut-off events. For 67719/74260 co-relation queries the response was YES. Maximal size of possible extension queue 2335. Compared 197437 event pairs, 274 based on Foata normal form. 1094/18170 useless extension candidates. Maximal degree in co-relation 73037. Up to 4035 conditions per place. [2021-03-25 14:31:37,792 INFO L132 encePairwiseOnDemand]: 199/214 looper letters, 80 selfloop transitions, 116 changer transitions 16/250 dead transitions. [2021-03-25 14:31:37,792 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 250 transitions, 2861 flow [2021-03-25 14:31:37,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:31:37,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:31:37,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1223 transitions. [2021-03-25 14:31:37,795 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7143691588785047 [2021-03-25 14:31:37,796 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1223 transitions. [2021-03-25 14:31:37,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1223 transitions. [2021-03-25 14:31:37,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:31:37,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1223 transitions. [2021-03-25 14:31:37,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 152.875) internal successors, (1223), 8 states have internal predecessors, (1223), 0 states have call successors, (0), 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-25 14:31:37,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 214.0) internal successors, (1926), 9 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:31:37,802 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 214.0) internal successors, (1926), 9 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:31:37,802 INFO L185 Difference]: Start difference. First operand has 86 places, 117 transitions, 1064 flow. Second operand 8 states and 1223 transitions. [2021-03-25 14:31:37,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 250 transitions, 2861 flow [2021-03-25 14:31:40,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 250 transitions, 2848 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-25 14:31:40,132 INFO L241 Difference]: Finished difference. Result has 96 places, 198 transitions, 2408 flow [2021-03-25 14:31:40,132 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2408, PETRI_PLACES=96, PETRI_TRANSITIONS=198} [2021-03-25 14:31:40,132 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 35 predicate places. [2021-03-25 14:31:40,133 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:31:40,133 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 198 transitions, 2408 flow [2021-03-25 14:31:40,133 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 198 transitions, 2408 flow [2021-03-25 14:31:40,134 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 96 places, 198 transitions, 2408 flow [2021-03-25 14:31:40,281 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1078] L785-->L788: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][36], [Black: 249#(and (= ~b$r_buff0_thd2~0 0) (= ~b$w_buff0~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))) (= 0 ~b$r_buff1_thd2~0) (= ~b$r_buff0_thd1~0 1) (= ~b$w_buff0_used~0 1)), P1Thread1of1ForFork2InUse, Black: 251#(and (= ~b$r_buff0_thd2~0 0) (= ~b~0 1) (<= ~b$w_buff0_used~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))) (<= 0 ~b$w_buff0_used~0) (= 0 ~b$r_buff1_thd2~0)), P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(<= ~__unbuffered_cnt~0 1), Black: 195#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 197#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), 204#(= ~__unbuffered_cnt~0 0), 142#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 78#L854true, Black: 211#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 206#(<= ~__unbuffered_cnt~0 2), Black: 139#true, Black: 207#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 141#(= ~__unbuffered_p3_EAX~0 0), 88#L878-1true, 218#(= ~z~0 1), Black: 156#(= ~y~0 0), 95#L788true, Black: 221#(and (= ~__unbuffered_p2_EAX~0 1) (= ~z~0 1)), 228#(and (= 0 ~b$r_buff1_thd4~0) (= ~b$r_buff0_thd4~0 0) (= ~b$w_buff0~0 1) (= ~b$r_buff0_thd1~0 1) (= ~b$w_buff0_used~0 1)), 106#L805true, Black: 229#(and (= 0 ~b$r_buff1_thd4~0) (= ~b$r_buff0_thd4~0 0) (= ~b~0 1)), 177#(and (= ~b$r_buff0_thd2~0 0) (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 51#L768true, Black: 179#(and (= ~b$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))) (= ~b$w_buff0_used~0 ~x~0) (= ~b$w_buff0_used~0 1)), 247#(and (= ~b$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 172#(and (= ~b$r_buff0_thd2~0 0) (= ~x~0 1)), Black: 173#(and (= ~b$r_buff0_thd2~0 0) (= ~b$w_buff0_used~0 ~x~0) (= ~b$w_buff0_used~0 1)), Black: 174#(and (= ~b$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 188#(= ~y~0 1), Black: 242#(and (= ~b$r_buff0_thd2~0 0) (= ~b$w_buff0~0 1) (= 0 ~b$r_buff1_thd2~0) (= ~b$r_buff0_thd1~0 1) (= ~b$w_buff0_used~0 1)), Black: 243#(and (= ~b$r_buff0_thd2~0 0) (= ~b~0 1) (<= ~b$w_buff0_used~0 0) (<= 0 ~b$w_buff0_used~0) (= 0 ~b$r_buff1_thd2~0))]) [2021-03-25 14:31:40,281 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 14:31:40,281 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 14:31:40,281 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 14:31:40,281 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 14:31:41,815 INFO L129 PetriNetUnfolder]: 8140/17813 cut-off events. [2021-03-25 14:31:41,815 INFO L130 PetriNetUnfolder]: For 81499/85621 co-relation queries the response was YES. [2021-03-25 14:31:41,898 INFO L84 FinitePrefix]: Finished finitePrefix Result has 73113 conditions, 17813 events. 8140/17813 cut-off events. For 81499/85621 co-relation queries the response was YES. Maximal size of possible extension queue 2529. Compared 208446 event pairs, 382 based on Foata normal form. 1034/18101 useless extension candidates. Maximal degree in co-relation 73074. Up to 4395 conditions per place. [2021-03-25 14:31:42,056 INFO L142 LiptonReduction]: Number of co-enabled transitions 4400 [2021-03-25 14:31:43,154 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:31:43,155 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:31:43,155 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3022 [2021-03-25 14:31:43,155 INFO L480 AbstractCegarLoop]: Abstraction has has 96 places, 198 transitions, 2408 flow [2021-03-25 14:31:43,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 145.71428571428572) internal successors, (1020), 7 states have internal predecessors, (1020), 0 states have call successors, (0), 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-25 14:31:43,156 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:31:43,156 INFO L263 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] [2021-03-25 14:31:43,156 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:31:43,156 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:31:43,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:31:43,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1390655896, now seen corresponding path program 1 times [2021-03-25 14:31:43,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:31:43,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447475190] [2021-03-25 14:31:43,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:31:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:31:43,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:43,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:31:43,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:43,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:31:43,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:43,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:31:43,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:43,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:31:43,246 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:31:43,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:31:43,255 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-25 14:31:43,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447475190] [2021-03-25 14:31:43,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:31:43,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:31:43,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567153947] [2021-03-25 14:31:43,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:31:43,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:31:43,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:31:43,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:31:43,259 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 214 [2021-03-25 14:31:43,260 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 198 transitions, 2408 flow. Second operand has 7 states, 7 states have (on average 178.85714285714286) internal successors, (1252), 7 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-25 14:31:43,260 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:31:43,260 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 214 [2021-03-25 14:31:43,260 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:31:44,665 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1072] L768-->L775: Formula: (let ((.cse8 (= (mod v_~b$w_buff0_used~0_455 256) 0)) (.cse9 (= (mod v_~b$r_buff1_thd1~0_58 256) 0)) (.cse13 (= (mod v_~b$w_buff1_used~0_360 256) 0)) (.cse12 (= (mod v_~b$r_buff0_thd1~0_71 256) 0)) (.cse14 (= (mod v_~b$w_buff0_used~0_456 256) 0))) (let ((.cse2 (or .cse12 .cse14)) (.cse0 (not .cse14)) (.cse11 (not .cse13)) (.cse7 (not .cse9)) (.cse3 (not .cse8)) (.cse1 (not .cse12)) (.cse10 (or .cse9 .cse13)) (.cse4 (or .cse12 .cse8))) (and (or (and .cse0 (= v_~b$w_buff0_used~0_455 0) .cse1) (and (= v_~b$w_buff0_used~0_456 v_~b$w_buff0_used~0_455) .cse2)) (or (and .cse3 (= v_~b$r_buff0_thd1~0_70 0) .cse1) (and .cse4 (= v_~b$r_buff0_thd1~0_71 v_~b$r_buff0_thd1~0_70))) (let ((.cse5 (= (mod v_~b$r_buff0_thd1~0_70 256) 0)) (.cse6 (= (mod v_~b$w_buff1_used~0_359 256) 0))) (or (and (= v_~b$r_buff1_thd1~0_57 0) (or (and .cse3 (not .cse5)) (and (not .cse6) .cse7))) (and (= v_~b$r_buff1_thd1~0_58 v_~b$r_buff1_thd1~0_57) (or .cse8 .cse5) (or .cse6 .cse9)))) (or (and (= |v_P0_#t~ite5_37| v_~b~0_146) (or (and (= |v_P0_#t~ite5_37| v_~b~0_147) .cse10) (and (= v_~b$w_buff1~0_102 |v_P0_#t~ite5_37|) .cse11 .cse7)) .cse2) (and (= v_~b~0_146 v_~b$w_buff0~0_83) .cse0 .cse1 (= |v_P0_#t~ite5_37| |v_P0Thread1of1ForFork1_#t~ite5_1|))) (or (and (or (and .cse11 .cse7) (and .cse3 .cse1)) (= v_~b$w_buff1_used~0_359 0)) (and (= v_~b$w_buff1_used~0_359 v_~b$w_buff1_used~0_360) .cse10 .cse4))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_456, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_71, P0Thread1of1ForFork1_#t~ite5=|v_P0Thread1of1ForFork1_#t~ite5_1|, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_58, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_360, ~b~0=v_~b~0_147, ~b$w_buff1~0=v_~b$w_buff1~0_102, ~b$w_buff0~0=v_~b$w_buff0~0_83} OutVars{P0Thread1of1ForFork1_#t~ite10=|v_P0Thread1of1ForFork1_#t~ite10_1|, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_70, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_57, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_455, P0Thread1of1ForFork1_#t~ite5=|v_P0Thread1of1ForFork1_#t~ite5_2|, P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_1|, P0Thread1of1ForFork1_#t~ite9=|v_P0Thread1of1ForFork1_#t~ite9_1|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_359, ~b~0=v_~b~0_146, P0Thread1of1ForFork1_#t~ite6=|v_P0Thread1of1ForFork1_#t~ite6_1|, P0Thread1of1ForFork1_#t~ite7=|v_P0Thread1of1ForFork1_#t~ite7_1|, ~b$w_buff1~0=v_~b$w_buff1~0_102, ~b$w_buff0~0=v_~b$w_buff0~0_83} AuxVars[|v_P0_#t~ite5_37|] AssignedVars[P0Thread1of1ForFork1_#t~ite10, ~b$w_buff0_used~0, ~b$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite5, ~b$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9, ~b$w_buff1_used~0, ~b~0, P0Thread1of1ForFork1_#t~ite6, P0Thread1of1ForFork1_#t~ite7][95], [P1Thread1of1ForFork2InUse, Black: 249#(and (= ~b$r_buff0_thd2~0 0) (= ~b$w_buff0~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))) (= 0 ~b$r_buff1_thd2~0) (= ~b$r_buff0_thd1~0 1) (= ~b$w_buff0_used~0 1)), Black: 251#(and (= ~b$r_buff0_thd2~0 0) (= ~b~0 1) (<= ~b$w_buff0_used~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))) (<= 0 ~b$w_buff0_used~0) (= 0 ~b$r_buff1_thd2~0)), P3Thread1of1ForFork0InUse, 260#(= ~__unbuffered_cnt~0 0), P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(<= ~__unbuffered_cnt~0 1), Black: 195#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 197#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), 139#true, 204#(= ~__unbuffered_cnt~0 0), 78#L854true, Black: 211#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 206#(<= ~__unbuffered_cnt~0 2), Black: 141#(= ~__unbuffered_p3_EAX~0 0), Black: 207#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 88#L878-1true, Black: 142#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 28#L815true, 221#(and (= ~__unbuffered_p2_EAX~0 1) (= ~z~0 1)), Black: 156#(= ~y~0 0), 30#L795true, Black: 218#(= ~z~0 1), 227#(= ~b$r_buff0_thd4~0 0), Black: 228#(and (= 0 ~b$r_buff1_thd4~0) (= ~b$r_buff0_thd4~0 0) (= ~b$w_buff0~0 1) (= ~b$r_buff0_thd1~0 1) (= ~b$w_buff0_used~0 1)), Black: 229#(and (= 0 ~b$r_buff1_thd4~0) (= ~b$r_buff0_thd4~0 0) (= ~b~0 1)), 241#(= ~b$r_buff0_thd2~0 0), 177#(and (= ~b$r_buff0_thd2~0 0) (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 114#L775true, Black: 179#(and (= ~b$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))) (= ~b$w_buff0_used~0 ~x~0) (= ~b$w_buff0_used~0 1)), Black: 172#(and (= ~b$r_buff0_thd2~0 0) (= ~x~0 1)), Black: 173#(and (= ~b$r_buff0_thd2~0 0) (= ~b$w_buff0_used~0 ~x~0) (= ~b$w_buff0_used~0 1)), Black: 174#(and (= ~b$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 188#(= ~y~0 1), Black: 242#(and (= ~b$r_buff0_thd2~0 0) (= ~b$w_buff0~0 1) (= 0 ~b$r_buff1_thd2~0) (= ~b$r_buff0_thd1~0 1) (= ~b$w_buff0_used~0 1)), Black: 243#(and (= ~b$r_buff0_thd2~0 0) (= ~b~0 1) (<= ~b$w_buff0_used~0 0) (<= 0 ~b$w_buff0_used~0) (= 0 ~b$r_buff1_thd2~0)), Black: 247#(and (= ~b$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))))]) [2021-03-25 14:31:44,665 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-25 14:31:44,665 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 14:31:44,665 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 14:31:44,665 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 14:31:44,958 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1072] L768-->L775: Formula: (let ((.cse8 (= (mod v_~b$w_buff0_used~0_455 256) 0)) (.cse9 (= (mod v_~b$r_buff1_thd1~0_58 256) 0)) (.cse13 (= (mod v_~b$w_buff1_used~0_360 256) 0)) (.cse12 (= (mod v_~b$r_buff0_thd1~0_71 256) 0)) (.cse14 (= (mod v_~b$w_buff0_used~0_456 256) 0))) (let ((.cse2 (or .cse12 .cse14)) (.cse0 (not .cse14)) (.cse11 (not .cse13)) (.cse7 (not .cse9)) (.cse3 (not .cse8)) (.cse1 (not .cse12)) (.cse10 (or .cse9 .cse13)) (.cse4 (or .cse12 .cse8))) (and (or (and .cse0 (= v_~b$w_buff0_used~0_455 0) .cse1) (and (= v_~b$w_buff0_used~0_456 v_~b$w_buff0_used~0_455) .cse2)) (or (and .cse3 (= v_~b$r_buff0_thd1~0_70 0) .cse1) (and .cse4 (= v_~b$r_buff0_thd1~0_71 v_~b$r_buff0_thd1~0_70))) (let ((.cse5 (= (mod v_~b$r_buff0_thd1~0_70 256) 0)) (.cse6 (= (mod v_~b$w_buff1_used~0_359 256) 0))) (or (and (= v_~b$r_buff1_thd1~0_57 0) (or (and .cse3 (not .cse5)) (and (not .cse6) .cse7))) (and (= v_~b$r_buff1_thd1~0_58 v_~b$r_buff1_thd1~0_57) (or .cse8 .cse5) (or .cse6 .cse9)))) (or (and (= |v_P0_#t~ite5_37| v_~b~0_146) (or (and (= |v_P0_#t~ite5_37| v_~b~0_147) .cse10) (and (= v_~b$w_buff1~0_102 |v_P0_#t~ite5_37|) .cse11 .cse7)) .cse2) (and (= v_~b~0_146 v_~b$w_buff0~0_83) .cse0 .cse1 (= |v_P0_#t~ite5_37| |v_P0Thread1of1ForFork1_#t~ite5_1|))) (or (and (or (and .cse11 .cse7) (and .cse3 .cse1)) (= v_~b$w_buff1_used~0_359 0)) (and (= v_~b$w_buff1_used~0_359 v_~b$w_buff1_used~0_360) .cse10 .cse4))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_456, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_71, P0Thread1of1ForFork1_#t~ite5=|v_P0Thread1of1ForFork1_#t~ite5_1|, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_58, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_360, ~b~0=v_~b~0_147, ~b$w_buff1~0=v_~b$w_buff1~0_102, ~b$w_buff0~0=v_~b$w_buff0~0_83} OutVars{P0Thread1of1ForFork1_#t~ite10=|v_P0Thread1of1ForFork1_#t~ite10_1|, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_70, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_57, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_455, P0Thread1of1ForFork1_#t~ite5=|v_P0Thread1of1ForFork1_#t~ite5_2|, P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_1|, P0Thread1of1ForFork1_#t~ite9=|v_P0Thread1of1ForFork1_#t~ite9_1|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_359, ~b~0=v_~b~0_146, P0Thread1of1ForFork1_#t~ite6=|v_P0Thread1of1ForFork1_#t~ite6_1|, P0Thread1of1ForFork1_#t~ite7=|v_P0Thread1of1ForFork1_#t~ite7_1|, ~b$w_buff1~0=v_~b$w_buff1~0_102, ~b$w_buff0~0=v_~b$w_buff0~0_83} AuxVars[|v_P0_#t~ite5_37|] AssignedVars[P0Thread1of1ForFork1_#t~ite10, ~b$w_buff0_used~0, ~b$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite5, ~b$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9, ~b$w_buff1_used~0, ~b~0, P0Thread1of1ForFork1_#t~ite6, P0Thread1of1ForFork1_#t~ite7][95], [Black: 249#(and (= ~b$r_buff0_thd2~0 0) (= ~b$w_buff0~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))) (= 0 ~b$r_buff1_thd2~0) (= ~b$r_buff0_thd1~0 1) (= ~b$w_buff0_used~0 1)), P1Thread1of1ForFork2InUse, Black: 251#(and (= ~b$r_buff0_thd2~0 0) (= ~b~0 1) (<= ~b$w_buff0_used~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))) (<= 0 ~b$w_buff0_used~0) (= 0 ~b$r_buff1_thd2~0)), P3Thread1of1ForFork0InUse, 260#(= ~__unbuffered_cnt~0 0), P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(<= ~__unbuffered_cnt~0 1), Black: 195#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 197#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), 139#true, 204#(= ~__unbuffered_cnt~0 0), 78#L854true, Black: 211#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 206#(<= ~__unbuffered_cnt~0 2), Black: 141#(= ~__unbuffered_p3_EAX~0 0), Black: 207#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 88#L878-1true, Black: 142#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 218#(= ~z~0 1), 28#L815true, 30#L795true, Black: 156#(= ~y~0 0), Black: 221#(and (= ~__unbuffered_p2_EAX~0 1) (= ~z~0 1)), 227#(= ~b$r_buff0_thd4~0 0), Black: 228#(and (= 0 ~b$r_buff1_thd4~0) (= ~b$r_buff0_thd4~0 0) (= ~b$w_buff0~0 1) (= ~b$r_buff0_thd1~0 1) (= ~b$w_buff0_used~0 1)), Black: 229#(and (= 0 ~b$r_buff1_thd4~0) (= ~b$r_buff0_thd4~0 0) (= ~b~0 1)), 241#(= ~b$r_buff0_thd2~0 0), 177#(and (= ~b$r_buff0_thd2~0 0) (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 114#L775true, Black: 179#(and (= ~b$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))) (= ~b$w_buff0_used~0 ~x~0) (= ~b$w_buff0_used~0 1)), Black: 172#(and (= ~b$r_buff0_thd2~0 0) (= ~x~0 1)), Black: 173#(and (= ~b$r_buff0_thd2~0 0) (= ~b$w_buff0_used~0 ~x~0) (= ~b$w_buff0_used~0 1)), Black: 174#(and (= ~b$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 188#(= ~y~0 1), Black: 242#(and (= ~b$r_buff0_thd2~0 0) (= ~b$w_buff0~0 1) (= 0 ~b$r_buff1_thd2~0) (= ~b$r_buff0_thd1~0 1) (= ~b$w_buff0_used~0 1)), Black: 243#(and (= ~b$r_buff0_thd2~0 0) (= ~b~0 1) (<= ~b$w_buff0_used~0 0) (<= 0 ~b$w_buff0_used~0) (= 0 ~b$r_buff1_thd2~0)), Black: 247#(and (= ~b$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))))]) [2021-03-25 14:31:44,958 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 14:31:44,958 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 14:31:44,958 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 14:31:44,958 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 14:31:46,717 INFO L129 PetriNetUnfolder]: 12329/23815 cut-off events. [2021-03-25 14:31:46,717 INFO L130 PetriNetUnfolder]: For 162297/206078 co-relation queries the response was YES. [2021-03-25 14:31:46,830 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102476 conditions, 23815 events. 12329/23815 cut-off events. For 162297/206078 co-relation queries the response was YES. Maximal size of possible extension queue 3488. Compared 259276 event pairs, 240 based on Foata normal form. 8708/29671 useless extension candidates. Maximal degree in co-relation 102435. Up to 6572 conditions per place. [2021-03-25 14:31:46,851 INFO L132 encePairwiseOnDemand]: 206/214 looper letters, 7 selfloop transitions, 28 changer transitions 71/204 dead transitions. [2021-03-25 14:31:46,851 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 204 transitions, 2466 flow [2021-03-25 14:31:46,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 14:31:46,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 14:31:46,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1822 transitions. [2021-03-25 14:31:46,855 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8514018691588785 [2021-03-25 14:31:46,855 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1822 transitions. [2021-03-25 14:31:46,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1822 transitions. [2021-03-25 14:31:46,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:31:46,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1822 transitions. [2021-03-25 14:31:46,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 182.2) internal successors, (1822), 10 states have internal predecessors, (1822), 0 states have call successors, (0), 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-25 14:31:46,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 214.0) internal successors, (2354), 11 states have internal predecessors, (2354), 0 states have call successors, (0), 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-25 14:31:46,862 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 214.0) internal successors, (2354), 11 states have internal predecessors, (2354), 0 states have call successors, (0), 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-25 14:31:46,862 INFO L185 Difference]: Start difference. First operand has 96 places, 198 transitions, 2408 flow. Second operand 10 states and 1822 transitions. [2021-03-25 14:31:46,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 204 transitions, 2466 flow [2021-03-25 14:31:49,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 204 transitions, 2387 flow, removed 34 selfloop flow, removed 2 redundant places. [2021-03-25 14:31:49,933 INFO L241 Difference]: Finished difference. Result has 106 places, 130 transitions, 1395 flow [2021-03-25 14:31:49,933 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=2245, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1395, PETRI_PLACES=106, PETRI_TRANSITIONS=130} [2021-03-25 14:31:49,933 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 45 predicate places. [2021-03-25 14:31:49,933 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:31:49,933 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 130 transitions, 1395 flow [2021-03-25 14:31:49,934 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 130 transitions, 1395 flow [2021-03-25 14:31:49,935 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 130 transitions, 1395 flow [2021-03-25 14:31:50,615 INFO L129 PetriNetUnfolder]: 3443/7889 cut-off events. [2021-03-25 14:31:50,615 INFO L130 PetriNetUnfolder]: For 31827/34058 co-relation queries the response was YES. [2021-03-25 14:31:50,649 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36401 conditions, 7889 events. 3443/7889 cut-off events. For 31827/34058 co-relation queries the response was YES. Maximal size of possible extension queue 1235. Compared 85530 event pairs, 170 based on Foata normal form. 204/7705 useless extension candidates. Maximal degree in co-relation 36359. Up to 1967 conditions per place. [2021-03-25 14:31:50,706 INFO L142 LiptonReduction]: Number of co-enabled transitions 2594 [2021-03-25 14:31:50,910 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-25 14:31:51,141 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:31:51,273 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:31:51,538 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:31:51,665 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:31:51,750 INFO L154 LiptonReduction]: Checked pairs total: 70 [2021-03-25 14:31:51,750 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:31:51,751 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1818 [2021-03-25 14:31:51,751 INFO L480 AbstractCegarLoop]: Abstraction has has 103 places, 129 transitions, 1405 flow [2021-03-25 14:31:51,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 178.85714285714286) internal successors, (1252), 7 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-25 14:31:51,752 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:31:51,752 INFO L263 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] [2021-03-25 14:31:51,752 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:31:51,752 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:31:51,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:31:51,752 INFO L82 PathProgramCache]: Analyzing trace with hash 2097097945, now seen corresponding path program 1 times [2021-03-25 14:31:51,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:31:51,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51705974] [2021-03-25 14:31:51,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:31:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:31:51,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:51,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:31:51,836 INFO L142 QuantifierPusher]: treesize reduction 4, result has 87.9 percent of original size [2021-03-25 14:31:51,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 14:31:51,856 INFO L142 QuantifierPusher]: treesize reduction 31, result has 72.8 percent of original size [2021-03-25 14:31:51,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 83 [2021-03-25 14:31:51,897 INFO L142 QuantifierPusher]: treesize reduction 26, result has 54.4 percent of original size [2021-03-25 14:31:51,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 14:31:51,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:51,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:31:51,923 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-25 14:31:51,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51705974] [2021-03-25 14:31:51,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:31:51,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:31:51,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451423508] [2021-03-25 14:31:51,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:31:51,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:31:51,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:31:51,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:31:51,926 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 217 [2021-03-25 14:31:51,926 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 129 transitions, 1405 flow. Second operand has 7 states, 7 states have (on average 162.28571428571428) internal successors, (1136), 7 states have internal predecessors, (1136), 0 states have call successors, (0), 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-25 14:31:51,927 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:31:51,927 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 217 [2021-03-25 14:31:51,927 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:31:52,878 INFO L129 PetriNetUnfolder]: 4169/9846 cut-off events. [2021-03-25 14:31:52,878 INFO L130 PetriNetUnfolder]: For 41151/44520 co-relation queries the response was YES. [2021-03-25 14:31:52,931 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46420 conditions, 9846 events. 4169/9846 cut-off events. For 41151/44520 co-relation queries the response was YES. Maximal size of possible extension queue 1517. Compared 111020 event pairs, 179 based on Foata normal form. 296/9614 useless extension candidates. Maximal degree in co-relation 46376. Up to 2512 conditions per place. [2021-03-25 14:31:52,943 INFO L132 encePairwiseOnDemand]: 209/217 looper letters, 48 selfloop transitions, 19 changer transitions 26/158 dead transitions. [2021-03-25 14:31:52,943 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 158 transitions, 1822 flow [2021-03-25 14:31:52,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:31:52,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:31:52,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 992 transitions. [2021-03-25 14:31:52,946 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7619047619047619 [2021-03-25 14:31:52,946 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 992 transitions. [2021-03-25 14:31:52,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 992 transitions. [2021-03-25 14:31:52,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:31:52,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 992 transitions. [2021-03-25 14:31:52,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 165.33333333333334) internal successors, (992), 6 states have internal predecessors, (992), 0 states have call successors, (0), 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-25 14:31:52,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 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-25 14:31:52,950 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 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-25 14:31:52,950 INFO L185 Difference]: Start difference. First operand has 103 places, 129 transitions, 1405 flow. Second operand 6 states and 992 transitions. [2021-03-25 14:31:52,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 158 transitions, 1822 flow [2021-03-25 14:31:54,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 158 transitions, 1697 flow, removed 33 selfloop flow, removed 10 redundant places. [2021-03-25 14:31:54,566 INFO L241 Difference]: Finished difference. Result has 101 places, 120 transitions, 1241 flow [2021-03-25 14:31:54,566 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1280, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1241, PETRI_PLACES=101, PETRI_TRANSITIONS=120} [2021-03-25 14:31:54,566 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 40 predicate places. [2021-03-25 14:31:54,566 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:31:54,566 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 120 transitions, 1241 flow [2021-03-25 14:31:54,567 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 120 transitions, 1241 flow [2021-03-25 14:31:54,567 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 100 places, 120 transitions, 1241 flow [2021-03-25 14:31:55,108 INFO L129 PetriNetUnfolder]: 3101/7016 cut-off events. [2021-03-25 14:31:55,108 INFO L130 PetriNetUnfolder]: For 19506/20748 co-relation queries the response was YES. [2021-03-25 14:31:55,134 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27125 conditions, 7016 events. 3101/7016 cut-off events. For 19506/20748 co-relation queries the response was YES. Maximal size of possible extension queue 1151. Compared 73625 event pairs, 109 based on Foata normal form. 114/6710 useless extension candidates. Maximal degree in co-relation 27084. Up to 1571 conditions per place. [2021-03-25 14:31:55,181 INFO L142 LiptonReduction]: Number of co-enabled transitions 2346 [2021-03-25 14:31:55,293 INFO L154 LiptonReduction]: Checked pairs total: 58 [2021-03-25 14:31:55,293 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:31:55,293 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 727 [2021-03-25 14:31:55,293 INFO L480 AbstractCegarLoop]: Abstraction has has 100 places, 120 transitions, 1243 flow [2021-03-25 14:31:55,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 162.28571428571428) internal successors, (1136), 7 states have internal predecessors, (1136), 0 states have call successors, (0), 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-25 14:31:55,294 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:31:55,294 INFO L263 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] [2021-03-25 14:31:55,294 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 14:31:55,295 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:31:55,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:31:55,295 INFO L82 PathProgramCache]: Analyzing trace with hash 959510961, now seen corresponding path program 1 times [2021-03-25 14:31:55,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:31:55,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315564911] [2021-03-25 14:31:55,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:31:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:31:55,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:55,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:31:55,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:55,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:31:55,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:31:55,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:31:55,344 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:31:55,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:31:55,355 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-25 14:31:55,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315564911] [2021-03-25 14:31:55,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:31:55,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:31:55,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498819542] [2021-03-25 14:31:55,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:31:55,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:31:55,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:31:55,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:31:55,357 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 218 [2021-03-25 14:31:55,358 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 120 transitions, 1243 flow. Second operand has 5 states, 5 states have (on average 166.8) internal successors, (834), 5 states have internal predecessors, (834), 0 states have call successors, (0), 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-25 14:31:55,358 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:31:55,358 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 218 [2021-03-25 14:31:55,358 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:31:56,075 INFO L129 PetriNetUnfolder]: 3704/8301 cut-off events. [2021-03-25 14:31:56,075 INFO L130 PetriNetUnfolder]: For 25982/28187 co-relation queries the response was YES. [2021-03-25 14:31:56,114 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32556 conditions, 8301 events. 3704/8301 cut-off events. For 25982/28187 co-relation queries the response was YES. Maximal size of possible extension queue 1293. Compared 89518 event pairs, 160 based on Foata normal form. 162/7988 useless extension candidates. Maximal degree in co-relation 32513. Up to 1857 conditions per place. [2021-03-25 14:31:56,121 INFO L132 encePairwiseOnDemand]: 209/218 looper letters, 9 selfloop transitions, 7 changer transitions 62/135 dead transitions. [2021-03-25 14:31:56,121 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 135 transitions, 1530 flow [2021-03-25 14:31:56,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:31:56,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:31:56,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1014 transitions. [2021-03-25 14:31:56,125 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7752293577981652 [2021-03-25 14:31:56,125 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1014 transitions. [2021-03-25 14:31:56,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1014 transitions. [2021-03-25 14:31:56,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:31:56,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1014 transitions. [2021-03-25 14:31:56,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 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-25 14:31:56,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 0 states have call successors, (0), 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-25 14:31:56,129 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 0 states have call successors, (0), 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-25 14:31:56,129 INFO L185 Difference]: Start difference. First operand has 100 places, 120 transitions, 1243 flow. Second operand 6 states and 1014 transitions. [2021-03-25 14:31:56,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 135 transitions, 1530 flow [2021-03-25 14:31:56,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 135 transitions, 1464 flow, removed 19 selfloop flow, removed 5 redundant places. [2021-03-25 14:31:56,878 INFO L241 Difference]: Finished difference. Result has 101 places, 73 transitions, 612 flow [2021-03-25 14:31:56,878 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=1149, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=612, PETRI_PLACES=101, PETRI_TRANSITIONS=73} [2021-03-25 14:31:56,878 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 40 predicate places. [2021-03-25 14:31:56,878 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:31:56,879 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 73 transitions, 612 flow [2021-03-25 14:31:56,879 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 73 transitions, 612 flow [2021-03-25 14:31:56,879 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 95 places, 73 transitions, 612 flow [2021-03-25 14:31:56,942 INFO L129 PetriNetUnfolder]: 513/1120 cut-off events. [2021-03-25 14:31:56,942 INFO L130 PetriNetUnfolder]: For 2679/2780 co-relation queries the response was YES. [2021-03-25 14:31:56,946 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4145 conditions, 1120 events. 513/1120 cut-off events. For 2679/2780 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 8228 event pairs, 32 based on Foata normal form. 5/1059 useless extension candidates. Maximal degree in co-relation 4106. Up to 270 conditions per place. [2021-03-25 14:31:56,951 INFO L142 LiptonReduction]: Number of co-enabled transitions 854 [2021-03-25 14:31:57,437 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 14:31:57,577 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 14:31:57,585 INFO L154 LiptonReduction]: Checked pairs total: 106 [2021-03-25 14:31:57,585 INFO L156 LiptonReduction]: Total number of compositions: 7 [2021-03-25 14:31:57,586 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 708 [2021-03-25 14:31:57,586 INFO L480 AbstractCegarLoop]: Abstraction has has 93 places, 68 transitions, 600 flow [2021-03-25 14:31:57,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 166.8) internal successors, (834), 5 states have internal predecessors, (834), 0 states have call successors, (0), 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-25 14:31:57,586 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:31:57,586 INFO L263 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] [2021-03-25 14:31:57,587 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 14:31:57,587 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:31:57,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:31:57,587 INFO L82 PathProgramCache]: Analyzing trace with hash 2084724904, now seen corresponding path program 1 times [2021-03-25 14:31:57,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:31:57,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468509268] [2021-03-25 14:31:57,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:31:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:31:57,629 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:31:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:31:57,673 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:31:57,702 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:31:57,702 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:31:57,703 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 14:31:57,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:31:57 BasicIcfg [2021-03-25 14:31:57,821 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:31:57,821 INFO L168 Benchmark]: Toolchain (without parser) took 61635.32 ms. Allocated memory was 255.9 MB in the beginning and 7.2 GB in the end (delta: 7.0 GB). Free memory was 234.7 MB in the beginning and 5.9 GB in the end (delta: -5.6 GB). Peak memory consumption was 1.3 GB. Max. memory is 16.0 GB. [2021-03-25 14:31:57,821 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:31:57,822 INFO L168 Benchmark]: CACSL2BoogieTranslator took 586.06 ms. Allocated memory was 255.9 MB in the beginning and 335.5 MB in the end (delta: 79.7 MB). Free memory was 234.3 MB in the beginning and 292.8 MB in the end (delta: -58.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. [2021-03-25 14:31:57,822 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.63 ms. Allocated memory is still 335.5 MB. Free memory was 292.8 MB in the beginning and 290.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:31:57,822 INFO L168 Benchmark]: Boogie Preprocessor took 57.50 ms. Allocated memory is still 335.5 MB. Free memory was 290.8 MB in the beginning and 288.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:31:57,822 INFO L168 Benchmark]: RCFGBuilder took 1939.60 ms. Allocated memory is still 335.5 MB. Free memory was 288.1 MB in the beginning and 259.4 MB in the end (delta: 28.8 MB). Peak memory consumption was 67.5 MB. Max. memory is 16.0 GB. [2021-03-25 14:31:57,823 INFO L168 Benchmark]: TraceAbstraction took 58971.87 ms. Allocated memory was 335.5 MB in the beginning and 7.2 GB in the end (delta: 6.9 GB). Free memory was 259.4 MB in the beginning and 5.9 GB in the end (delta: -5.6 GB). Peak memory consumption was 1.3 GB. Max. memory is 16.0 GB. [2021-03-25 14:31:57,824 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.13 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 586.06 ms. Allocated memory was 255.9 MB in the beginning and 335.5 MB in the end (delta: 79.7 MB). Free memory was 234.3 MB in the beginning and 292.8 MB in the end (delta: -58.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 73.63 ms. Allocated memory is still 335.5 MB. Free memory was 292.8 MB in the beginning and 290.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 57.50 ms. Allocated memory is still 335.5 MB. Free memory was 290.8 MB in the beginning and 288.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1939.60 ms. Allocated memory is still 335.5 MB. Free memory was 288.1 MB in the beginning and 259.4 MB in the end (delta: 28.8 MB). Peak memory consumption was 67.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 58971.87 ms. Allocated memory was 335.5 MB in the beginning and 7.2 GB in the end (delta: 6.9 GB). Free memory was 259.4 MB in the beginning and 5.9 GB in the end (delta: -5.6 GB). Peak memory consumption was 1.3 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3503.0ms, 127 PlacesBefore, 61 PlacesAfterwards, 116 TransitionsBefore, 49 TransitionsAfterwards, 2876 CoEnabledTransitionPairs, 5 FixpointIterations, 31 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 5194 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2677, positive: 2566, positive conditional: 0, positive unconditional: 2566, negative: 111, negative conditional: 0, negative unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1857, positive: 1804, positive conditional: 0, positive unconditional: 1804, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1857, positive: 1804, positive conditional: 0, positive unconditional: 1804, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1857, positive: 1787, positive conditional: 0, positive unconditional: 1787, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 70, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 712, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 661, negative conditional: 0, negative unconditional: 661, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2677, positive: 762, positive conditional: 0, positive unconditional: 762, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 1857, unknown conditional: 0, unknown unconditional: 1857] , Statistics on independence cache: Total cache size (in pairs): 261, Positive cache size: 233, Positive conditional cache size: 0, Positive unconditional cache size: 233, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1029.1ms, 57 PlacesBefore, 45 PlacesAfterwards, 46 TransitionsBefore, 34 TransitionsAfterwards, 652 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 2761 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 969, positive: 845, positive conditional: 0, positive unconditional: 845, negative: 124, negative conditional: 0, negative unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, positive: 153, positive conditional: 0, positive unconditional: 153, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 173, positive: 153, positive conditional: 0, positive unconditional: 153, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 173, positive: 146, positive conditional: 0, positive unconditional: 146, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 27, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 237, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 205, negative conditional: 0, negative unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 969, positive: 692, positive conditional: 0, positive unconditional: 692, negative: 104, negative conditional: 0, negative unconditional: 104, unknown: 173, unknown conditional: 0, unknown unconditional: 173] , Statistics on independence cache: Total cache size (in pairs): 307, Positive cache size: 273, Positive conditional cache size: 0, Positive unconditional cache size: 273, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 678.1ms, 54 PlacesBefore, 47 PlacesAfterwards, 38 TransitionsBefore, 35 TransitionsAfterwards, 514 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1125 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 409, positive: 358, positive conditional: 0, positive unconditional: 358, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 409, positive: 353, positive conditional: 0, positive unconditional: 353, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 312, Positive cache size: 278, Positive conditional cache size: 0, Positive unconditional cache size: 278, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1105.4ms, 47 PlacesBefore, 46 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 978 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 380, positive: 338, positive conditional: 0, positive unconditional: 338, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 380, positive: 335, positive conditional: 0, positive unconditional: 335, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 316, Positive cache size: 281, Positive conditional cache size: 0, Positive unconditional cache size: 281, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 470.1ms, 52 PlacesBefore, 52 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 844 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1146 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 220, positive: 182, positive conditional: 0, positive unconditional: 182, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 121, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 121, negative conditional: 0, negative unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 220, positive: 173, positive conditional: 0, positive unconditional: 173, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 309, Positive cache size: 271, Positive conditional cache size: 0, Positive unconditional cache size: 271, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4811.4ms, 60 PlacesBefore, 60 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1310 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 398 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 32, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 310, Positive cache size: 271, Positive conditional cache size: 0, Positive unconditional cache size: 271, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5144.8ms, 62 PlacesBefore, 62 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1310 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 347 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 31, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 31, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 310, Positive cache size: 271, Positive conditional cache size: 0, Positive unconditional cache size: 271, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1478.7ms, 69 PlacesBefore, 69 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 1812 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 454 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 26, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 310, Positive cache size: 271, Positive conditional cache size: 0, Positive unconditional cache size: 271, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1945.7ms, 77 PlacesBefore, 77 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 1986 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 467 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 46, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 302, Positive cache size: 270, Positive conditional cache size: 0, Positive unconditional cache size: 270, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4561.4ms, 78 PlacesBefore, 78 PlacesAfterwards, 100 TransitionsBefore, 100 TransitionsAfterwards, 2036 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 425 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 65, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 65, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 290, Positive cache size: 260, Positive conditional cache size: 0, Positive unconditional cache size: 260, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1779.2ms, 86 PlacesBefore, 86 PlacesAfterwards, 117 TransitionsBefore, 117 TransitionsAfterwards, 2668 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 290, Positive cache size: 260, Positive conditional cache size: 0, Positive unconditional cache size: 260, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3021.9ms, 96 PlacesBefore, 96 PlacesAfterwards, 198 TransitionsBefore, 198 TransitionsAfterwards, 4400 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 290, Positive cache size: 260, Positive conditional cache size: 0, Positive unconditional cache size: 260, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1816.7ms, 106 PlacesBefore, 103 PlacesAfterwards, 130 TransitionsBefore, 129 TransitionsAfterwards, 2594 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 70 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 70, positive: 70, positive conditional: 0, positive unconditional: 70, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 70, positive: 70, positive conditional: 0, positive unconditional: 70, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 271, Positive cache size: 245, Positive conditional cache size: 0, Positive unconditional cache size: 245, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 726.2ms, 101 PlacesBefore, 100 PlacesAfterwards, 120 TransitionsBefore, 120 TransitionsAfterwards, 2346 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 58 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 58, positive: 58, positive conditional: 0, positive unconditional: 58, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 58, positive: 58, positive conditional: 0, positive unconditional: 58, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 271, Positive cache size: 245, Positive conditional cache size: 0, Positive unconditional cache size: 245, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 706.6ms, 101 PlacesBefore, 93 PlacesAfterwards, 73 TransitionsBefore, 68 TransitionsAfterwards, 854 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 106 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 106, positive: 106, positive conditional: 0, positive unconditional: 106, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 106, positive: 92, positive conditional: 0, positive unconditional: 92, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 196, Positive conditional cache size: 0, Positive unconditional cache size: 196, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - 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_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1025; [L872] FCALL, FORK 0 pthread_create(&t1025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1026; [L874] FCALL, FORK 0 pthread_create(&t1026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1027; [L876] FCALL, FORK 0 pthread_create(&t1027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L877] 0 pthread_t t1028; [L878] FCALL, FORK 0 pthread_create(&t1028, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L824] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L810] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L810] EXPR 3 b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b [L810] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L838] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0) [L838] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L839] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1) [L839] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L840] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used) [L840] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L841] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L842] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4) [L842] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] EXPR 4 b$flush_delayed ? b$mem_tmp : b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, z=1] [L849] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L849] EXPR 4 b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b [L849] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L770] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L790] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L790] EXPR 2 b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b [L790] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L884] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L884] EXPR 0 b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b [L884] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __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_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 58699.2ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 24000.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3614.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 136 SDtfs, 152 SDslu, 146 SDs, 0 SdLazy, 635 SolverSat, 129 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 801.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 519.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2408occurred in iteration=11, InterpolantAutomatonStates: 84, 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: 56.8ms SsaConstructionTime, 423.7ms SatisfiabilityAnalysisTime, 1036.5ms InterpolantComputationTime, 325 NumberOfCodeBlocks, 325 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 284 ConstructedInterpolants, 0 QuantifiedInterpolants, 1919 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...