/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:03:45,873 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:03:45,875 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:03:45,915 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:03:45,915 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:03:45,918 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:03:45,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:03:45,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:03:45,928 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:03:45,934 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:03:45,934 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:03:45,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:03:45,936 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:03:45,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:03:45,940 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:03:45,941 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:03:45,945 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:03:45,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:03:45,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:03:45,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:03:45,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:03:45,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:03:45,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:03:45,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:03:45,956 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:03:45,956 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:03:45,956 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:03:45,957 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:03:45,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:03:45,958 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:03:45,958 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:03:45,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:03:45,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:03:45,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:03:45,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:03:45,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:03:45,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:03:45,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:03:45,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:03:45,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:03:45,967 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:03:45,969 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-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:03:46,002 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:03:46,002 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:03:46,005 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:03:46,006 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:03:46,006 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:03:46,006 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:03:46,006 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:03:46,006 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:03:46,006 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:03:46,007 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:03:46,007 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:03:46,007 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:03:46,008 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:03:46,008 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:03:46,008 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:03:46,008 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:03:46,008 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:03:46,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:03:46,008 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:03:46,009 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:03:46,009 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:03:46,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:03:46,009 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:03:46,009 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:03:46,009 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:03:46,010 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:03:46,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:03:46,010 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:03:46,010 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:03:46,010 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:03:46,010 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-26 00:03:46,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:03:46,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:03:46,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:03:46,305 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:03:46,305 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:03:46,306 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_pso.opt.i [2021-03-26 00:03:46,370 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4697f444/c662b6d76c484d61895bfea2144e951d/FLAG3e973c7a4 [2021-03-26 00:03:46,902 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:03:46,903 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_pso.opt.i [2021-03-26 00:03:46,924 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4697f444/c662b6d76c484d61895bfea2144e951d/FLAG3e973c7a4 [2021-03-26 00:03:47,196 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4697f444/c662b6d76c484d61895bfea2144e951d [2021-03-26 00:03:47,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:03:47,199 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:03:47,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:03:47,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:03:47,203 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:03:47,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:03:47" (1/1) ... [2021-03-26 00:03:47,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ead4bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:03:47, skipping insertion in model container [2021-03-26 00:03:47,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:03:47" (1/1) ... [2021-03-26 00:03:47,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:03:47,241 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:03:47,383 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/mix011_pso.opt.i[948,961] [2021-03-26 00:03:47,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:03:47,605 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:03:47,618 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/mix011_pso.opt.i[948,961] [2021-03-26 00:03:47,687 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:03:47,762 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:03:47,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:03:47 WrapperNode [2021-03-26 00:03:47,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:03:47,765 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:03:47,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:03:47,766 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:03:47,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:03:47" (1/1) ... [2021-03-26 00:03:47,807 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:03:47" (1/1) ... [2021-03-26 00:03:47,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:03:47,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:03:47,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:03:47,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:03:47,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:03:47" (1/1) ... [2021-03-26 00:03:47,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:03:47" (1/1) ... [2021-03-26 00:03:47,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:03:47" (1/1) ... [2021-03-26 00:03:47,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:03:47" (1/1) ... [2021-03-26 00:03:47,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:03:47" (1/1) ... [2021-03-26 00:03:47,900 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:03:47" (1/1) ... [2021-03-26 00:03:47,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:03:47" (1/1) ... [2021-03-26 00:03:47,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:03:47,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:03:47,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:03:47,906 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:03:47,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:03:47" (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-26 00:03:47,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:03:47,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:03:47,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:03:47,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:03:47,994 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:03:47,994 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:03:47,994 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:03:47,994 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:03:47,995 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:03:47,995 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:03:47,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:03:47,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:03:47,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:03:47,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:03:47,997 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:03:49,874 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:03:49,874 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:03:49,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:03:49 BoogieIcfgContainer [2021-03-26 00:03:49,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:03:49,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:03:49,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:03:49,880 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:03:49,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:03:47" (1/3) ... [2021-03-26 00:03:49,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e214d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:03:49, skipping insertion in model container [2021-03-26 00:03:49,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:03:47" (2/3) ... [2021-03-26 00:03:49,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e214d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:03:49, skipping insertion in model container [2021-03-26 00:03:49,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:03:49" (3/3) ... [2021-03-26 00:03:49,883 INFO L111 eAbstractionObserver]: Analyzing ICFG mix011_pso.opt.i [2021-03-26 00:03:49,889 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:03:49,892 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:03:49,893 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:03:49,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,935 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,935 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,935 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,935 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,936 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,936 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,937 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,937 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,942 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,942 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,942 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,942 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,942 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,942 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,942 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,942 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,942 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,942 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,946 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,946 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,946 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,948 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,948 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,948 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,948 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,948 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,948 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,948 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,948 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,948 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,949 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,949 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,950 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,954 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,955 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,960 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,960 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,960 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,960 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,961 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,961 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,961 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,974 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,974 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,980 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,988 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,988 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,988 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,988 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,990 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,990 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,991 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:03:49,994 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:03:50,010 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 00:03:50,037 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:03:50,037 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:03:50,037 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:03:50,037 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:03:50,037 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:03:50,038 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:03:50,038 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:03:50,038 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:03:50,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 110 places, 102 transitions, 219 flow [2021-03-26 00:03:50,091 INFO L129 PetriNetUnfolder]: 2/99 cut-off events. [2021-03-26 00:03:50,091 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:03:50,103 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 99 events. 2/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-26 00:03:50,104 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 102 transitions, 219 flow [2021-03-26 00:03:50,107 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 99 transitions, 207 flow [2021-03-26 00:03:50,108 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:03:50,118 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 99 transitions, 207 flow [2021-03-26 00:03:50,120 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 99 transitions, 207 flow [2021-03-26 00:03:50,121 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 207 flow [2021-03-26 00:03:50,139 INFO L129 PetriNetUnfolder]: 2/99 cut-off events. [2021-03-26 00:03:50,139 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:03:50,139 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 99 events. 2/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-26 00:03:50,142 INFO L142 LiptonReduction]: Number of co-enabled transitions 1750 [2021-03-26 00:03:51,404 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:03:51,855 WARN L205 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-26 00:03:52,009 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 00:03:53,227 INFO L154 LiptonReduction]: Checked pairs total: 2346 [2021-03-26 00:03:53,227 INFO L156 LiptonReduction]: Total number of compositions: 67 [2021-03-26 00:03:53,232 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3125 [2021-03-26 00:03:53,246 INFO L129 PetriNetUnfolder]: 0/25 cut-off events. [2021-03-26 00:03:53,246 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:03:53,246 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:03:53,247 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-26 00:03:53,248 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:03:53,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:03:53,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1531033386, now seen corresponding path program 1 times [2021-03-26 00:03:53,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:03:53,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572039055] [2021-03-26 00:03:53,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:03:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:03:53,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:53,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:03:53,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:53,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:03:53,523 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-26 00:03:53,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572039055] [2021-03-26 00:03:53,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:03:53,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:03:53,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721106465] [2021-03-26 00:03:53,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:03:53,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:03:53,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:03:53,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:03:53,544 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 169 [2021-03-26 00:03:53,550 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 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-26 00:03:53,550 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:03:53,550 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 169 [2021-03-26 00:03:53,553 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:03:53,621 INFO L129 PetriNetUnfolder]: 13/100 cut-off events. [2021-03-26 00:03:53,621 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:03:53,623 INFO L84 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 100 events. 13/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 368 event pairs, 5 based on Foata normal form. 8/100 useless extension candidates. Maximal degree in co-relation 119. Up to 25 conditions per place. [2021-03-26 00:03:53,624 INFO L132 encePairwiseOnDemand]: 165/169 looper letters, 6 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2021-03-26 00:03:53,625 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 40 transitions, 105 flow [2021-03-26 00:03:53,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:03:53,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:03:53,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2021-03-26 00:03:53,641 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.903353057199211 [2021-03-26 00:03:53,641 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2021-03-26 00:03:53,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2021-03-26 00:03:53,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:03:53,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2021-03-26 00:03:53,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 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-26 00:03:53,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 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-26 00:03:53,666 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 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-26 00:03:53,667 INFO L185 Difference]: Start difference. First operand has 50 places, 41 transitions, 91 flow. Second operand 3 states and 458 transitions. [2021-03-26 00:03:53,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 40 transitions, 105 flow [2021-03-26 00:03:53,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 40 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 00:03:53,671 INFO L241 Difference]: Finished difference. Result has 47 places, 38 transitions, 86 flow [2021-03-26 00:03:53,675 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2021-03-26 00:03:53,675 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2021-03-26 00:03:53,676 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:03:53,676 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 86 flow [2021-03-26 00:03:53,677 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 86 flow [2021-03-26 00:03:53,677 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 86 flow [2021-03-26 00:03:53,683 INFO L129 PetriNetUnfolder]: 0/38 cut-off events. [2021-03-26 00:03:53,683 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:03:53,683 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:03:53,684 INFO L142 LiptonReduction]: Number of co-enabled transitions 350 [2021-03-26 00:03:55,137 INFO L154 LiptonReduction]: Checked pairs total: 1470 [2021-03-26 00:03:55,137 INFO L156 LiptonReduction]: Total number of compositions: 13 [2021-03-26 00:03:55,138 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1462 [2021-03-26 00:03:55,140 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 60 flow [2021-03-26 00:03:55,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 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-26 00:03:55,141 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:03:55,141 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-26 00:03:55,141 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:03:55,141 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:03:55,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:03:55,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1534991081, now seen corresponding path program 1 times [2021-03-26 00:03:55,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:03:55,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142205163] [2021-03-26 00:03:55,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:03:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:03:55,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:55,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:03:55,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:55,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:03:55,256 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 00:03:55,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:03:55,269 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:03:55,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:03:55,274 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-26 00:03:55,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142205163] [2021-03-26 00:03:55,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:03:55,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:03:55,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879940192] [2021-03-26 00:03:55,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:03:55,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:03:55,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:03:55,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:03:55,279 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 182 [2021-03-26 00:03:55,280 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 60 flow. Second operand has 5 states, 5 states have (on average 141.2) internal successors, (706), 5 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:03:55,280 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:03:55,280 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 182 [2021-03-26 00:03:55,280 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:03:55,428 INFO L129 PetriNetUnfolder]: 105/255 cut-off events. [2021-03-26 00:03:55,428 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:03:55,431 INFO L84 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 255 events. 105/255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1261 event pairs, 27 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 444. Up to 61 conditions per place. [2021-03-26 00:03:55,432 INFO L132 encePairwiseOnDemand]: 174/182 looper letters, 9 selfloop transitions, 6 changer transitions 16/46 dead transitions. [2021-03-26 00:03:55,432 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 164 flow [2021-03-26 00:03:55,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:03:55,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:03:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1013 transitions. [2021-03-26 00:03:55,436 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7951334379905809 [2021-03-26 00:03:55,436 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1013 transitions. [2021-03-26 00:03:55,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1013 transitions. [2021-03-26 00:03:55,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:03:55,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1013 transitions. [2021-03-26 00:03:55,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 144.71428571428572) internal successors, (1013), 7 states have internal predecessors, (1013), 0 states have call successors, (0), 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-26 00:03:55,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 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-26 00:03:55,444 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 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-26 00:03:55,444 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 60 flow. Second operand 7 states and 1013 transitions. [2021-03-26 00:03:55,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 164 flow [2021-03-26 00:03:55,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 46 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:03:55,445 INFO L241 Difference]: Finished difference. Result has 43 places, 28 transitions, 106 flow [2021-03-26 00:03:55,445 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=106, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2021-03-26 00:03:55,446 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -7 predicate places. [2021-03-26 00:03:55,446 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:03:55,446 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 28 transitions, 106 flow [2021-03-26 00:03:55,447 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 28 transitions, 106 flow [2021-03-26 00:03:55,447 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 28 transitions, 106 flow [2021-03-26 00:03:55,466 INFO L129 PetriNetUnfolder]: 35/121 cut-off events. [2021-03-26 00:03:55,467 INFO L130 PetriNetUnfolder]: For 42/45 co-relation queries the response was YES. [2021-03-26 00:03:55,468 INFO L84 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 121 events. 35/121 cut-off events. For 42/45 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 545 event pairs, 18 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 265. Up to 58 conditions per place. [2021-03-26 00:03:55,470 INFO L142 LiptonReduction]: Number of co-enabled transitions 264 [2021-03-26 00:03:56,268 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-26 00:03:56,410 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 00:03:56,778 WARN L205 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-26 00:03:56,923 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 00:03:56,931 INFO L154 LiptonReduction]: Checked pairs total: 522 [2021-03-26 00:03:56,931 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:03:56,931 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1485 [2021-03-26 00:03:56,932 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 102 flow [2021-03-26 00:03:56,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 141.2) internal successors, (706), 5 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:03:56,933 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:03:56,933 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:03:56,933 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:03:56,933 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:03:56,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:03:56,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1863936857, now seen corresponding path program 1 times [2021-03-26 00:03:56,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:03:56,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123342778] [2021-03-26 00:03:56,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:03:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:03:56,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:56,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:03:56,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:56,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:03:56,977 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-26 00:03:56,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123342778] [2021-03-26 00:03:56,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:03:56,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:03:56,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756775033] [2021-03-26 00:03:56,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:03:56,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:03:56,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:03:56,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:03:56,980 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 184 [2021-03-26 00:03:56,980 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 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-26 00:03:56,981 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:03:56,981 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 184 [2021-03-26 00:03:56,981 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:03:57,005 INFO L129 PetriNetUnfolder]: 26/92 cut-off events. [2021-03-26 00:03:57,005 INFO L130 PetriNetUnfolder]: For 71/77 co-relation queries the response was YES. [2021-03-26 00:03:57,005 INFO L84 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 92 events. 26/92 cut-off events. For 71/77 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 12 based on Foata normal form. 2/88 useless extension candidates. Maximal degree in co-relation 223. Up to 45 conditions per place. [2021-03-26 00:03:57,006 INFO L132 encePairwiseOnDemand]: 181/184 looper letters, 1 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2021-03-26 00:03:57,006 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 26 transitions, 110 flow [2021-03-26 00:03:57,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:03:57,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:03:57,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2021-03-26 00:03:57,008 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8822463768115942 [2021-03-26 00:03:57,008 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 487 transitions. [2021-03-26 00:03:57,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 487 transitions. [2021-03-26 00:03:57,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:03:57,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 487 transitions. [2021-03-26 00:03:57,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 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-26 00:03:57,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 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-26 00:03:57,011 INFO L81 ComplementDD]: Finished complementDD. Result has 4 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-26 00:03:57,011 INFO L185 Difference]: Start difference. First operand has 37 places, 26 transitions, 102 flow. Second operand 3 states and 487 transitions. [2021-03-26 00:03:57,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 26 transitions, 110 flow [2021-03-26 00:03:57,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 26 transitions, 100 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-03-26 00:03:57,013 INFO L241 Difference]: Finished difference. Result has 37 places, 26 transitions, 103 flow [2021-03-26 00:03:57,013 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2021-03-26 00:03:57,013 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -13 predicate places. [2021-03-26 00:03:57,013 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:03:57,014 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 26 transitions, 103 flow [2021-03-26 00:03:57,014 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 26 transitions, 103 flow [2021-03-26 00:03:57,014 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 26 transitions, 103 flow [2021-03-26 00:03:57,027 INFO L129 PetriNetUnfolder]: 26/100 cut-off events. [2021-03-26 00:03:57,027 INFO L130 PetriNetUnfolder]: For 42/44 co-relation queries the response was YES. [2021-03-26 00:03:57,027 INFO L84 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 100 events. 26/100 cut-off events. For 42/44 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 412 event pairs, 12 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 212. Up to 45 conditions per place. [2021-03-26 00:03:57,028 INFO L142 LiptonReduction]: Number of co-enabled transitions 262 [2021-03-26 00:03:57,202 INFO L154 LiptonReduction]: Checked pairs total: 186 [2021-03-26 00:03:57,202 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:03:57,202 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 189 [2021-03-26 00:03:57,205 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 103 flow [2021-03-26 00:03:57,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 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-26 00:03:57,206 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:03:57,206 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:03:57,206 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:03:57,206 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:03:57,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:03:57,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1355254237, now seen corresponding path program 1 times [2021-03-26 00:03:57,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:03:57,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905698913] [2021-03-26 00:03:57,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:03:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:03:57,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:57,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:03:57,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:57,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:03:57,323 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-26 00:03:57,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905698913] [2021-03-26 00:03:57,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:03:57,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:03:57,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485544158] [2021-03-26 00:03:57,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:03:57,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:03:57,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:03:57,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:03:57,329 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 184 [2021-03-26 00:03:57,329 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 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-26 00:03:57,329 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:03:57,330 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 184 [2021-03-26 00:03:57,330 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:03:57,360 INFO L129 PetriNetUnfolder]: 25/109 cut-off events. [2021-03-26 00:03:57,361 INFO L130 PetriNetUnfolder]: For 130/195 co-relation queries the response was YES. [2021-03-26 00:03:57,361 INFO L84 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 109 events. 25/109 cut-off events. For 130/195 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 474 event pairs, 15 based on Foata normal form. 8/110 useless extension candidates. Maximal degree in co-relation 249. Up to 50 conditions per place. [2021-03-26 00:03:57,362 INFO L132 encePairwiseOnDemand]: 181/184 looper letters, 3 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2021-03-26 00:03:57,362 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 27 transitions, 117 flow [2021-03-26 00:03:57,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:03:57,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:03:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2021-03-26 00:03:57,363 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.875 [2021-03-26 00:03:57,363 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 483 transitions. [2021-03-26 00:03:57,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 483 transitions. [2021-03-26 00:03:57,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:03:57,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 483 transitions. [2021-03-26 00:03:57,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 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-26 00:03:57,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 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-26 00:03:57,366 INFO L81 ComplementDD]: Finished complementDD. Result has 4 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-26 00:03:57,367 INFO L185 Difference]: Start difference. First operand has 37 places, 26 transitions, 103 flow. Second operand 3 states and 483 transitions. [2021-03-26 00:03:57,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 27 transitions, 117 flow [2021-03-26 00:03:57,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 27 transitions, 111 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:03:57,370 INFO L241 Difference]: Finished difference. Result has 38 places, 26 transitions, 105 flow [2021-03-26 00:03:57,370 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2021-03-26 00:03:57,370 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -12 predicate places. [2021-03-26 00:03:57,370 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:03:57,370 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 26 transitions, 105 flow [2021-03-26 00:03:57,370 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 26 transitions, 105 flow [2021-03-26 00:03:57,371 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 26 transitions, 105 flow [2021-03-26 00:03:57,389 INFO L129 PetriNetUnfolder]: 22/113 cut-off events. [2021-03-26 00:03:57,389 INFO L130 PetriNetUnfolder]: For 113/131 co-relation queries the response was YES. [2021-03-26 00:03:57,390 INFO L84 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 113 events. 22/113 cut-off events. For 113/131 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 547 event pairs, 15 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 240. Up to 46 conditions per place. [2021-03-26 00:03:57,391 INFO L142 LiptonReduction]: Number of co-enabled transitions 270 [2021-03-26 00:03:57,461 INFO L154 LiptonReduction]: Checked pairs total: 306 [2021-03-26 00:03:57,461 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:03:57,461 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 91 [2021-03-26 00:03:57,462 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 108 flow [2021-03-26 00:03:57,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 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-26 00:03:57,463 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:03:57,463 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:03:57,463 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:03:57,463 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:03:57,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:03:57,463 INFO L82 PathProgramCache]: Analyzing trace with hash 2146323432, now seen corresponding path program 1 times [2021-03-26 00:03:57,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:03:57,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302337818] [2021-03-26 00:03:57,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:03:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:03:57,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:57,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:03:57,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:57,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:03:57,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:57,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:03:57,520 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-26 00:03:57,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302337818] [2021-03-26 00:03:57,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:03:57,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:03:57,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381088857] [2021-03-26 00:03:57,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:03:57,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:03:57,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:03:57,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:03:57,522 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 185 [2021-03-26 00:03:57,523 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 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-26 00:03:57,523 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:03:57,523 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 185 [2021-03-26 00:03:57,523 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:03:57,614 INFO L129 PetriNetUnfolder]: 215/475 cut-off events. [2021-03-26 00:03:57,614 INFO L130 PetriNetUnfolder]: For 187/206 co-relation queries the response was YES. [2021-03-26 00:03:57,616 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1044 conditions, 475 events. 215/475 cut-off events. For 187/206 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 3062 event pairs, 93 based on Foata normal form. 38/405 useless extension candidates. Maximal degree in co-relation 1030. Up to 328 conditions per place. [2021-03-26 00:03:57,618 INFO L132 encePairwiseOnDemand]: 179/185 looper letters, 10 selfloop transitions, 8 changer transitions 0/37 dead transitions. [2021-03-26 00:03:57,618 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 166 flow [2021-03-26 00:03:57,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:03:57,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:03:57,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 775 transitions. [2021-03-26 00:03:57,620 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8378378378378378 [2021-03-26 00:03:57,620 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 775 transitions. [2021-03-26 00:03:57,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 775 transitions. [2021-03-26 00:03:57,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:03:57,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 775 transitions. [2021-03-26 00:03:57,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 155.0) internal successors, (775), 5 states have internal predecessors, (775), 0 states have call successors, (0), 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-26 00:03:57,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 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-26 00:03:57,625 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 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-26 00:03:57,625 INFO L185 Difference]: Start difference. First operand has 38 places, 26 transitions, 108 flow. Second operand 5 states and 775 transitions. [2021-03-26 00:03:57,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 166 flow [2021-03-26 00:03:57,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 163 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:03:57,629 INFO L241 Difference]: Finished difference. Result has 44 places, 33 transitions, 165 flow [2021-03-26 00:03:57,629 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=165, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2021-03-26 00:03:57,629 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -6 predicate places. [2021-03-26 00:03:57,629 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:03:57,630 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 33 transitions, 165 flow [2021-03-26 00:03:57,630 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 165 flow [2021-03-26 00:03:57,630 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 165 flow [2021-03-26 00:03:57,665 INFO L129 PetriNetUnfolder]: 156/378 cut-off events. [2021-03-26 00:03:57,665 INFO L130 PetriNetUnfolder]: For 353/501 co-relation queries the response was YES. [2021-03-26 00:03:57,666 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1096 conditions, 378 events. 156/378 cut-off events. For 353/501 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 2359 event pairs, 72 based on Foata normal form. 3/330 useless extension candidates. Maximal degree in co-relation 1080. Up to 239 conditions per place. [2021-03-26 00:03:57,669 INFO L142 LiptonReduction]: Number of co-enabled transitions 384 [2021-03-26 00:03:57,685 INFO L154 LiptonReduction]: Checked pairs total: 173 [2021-03-26 00:03:57,685 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:03:57,685 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 56 [2021-03-26 00:03:57,687 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 159 flow [2021-03-26 00:03:57,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 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-26 00:03:57,688 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:03:57,688 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:03:57,688 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:03:57,688 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:03:57,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:03:57,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1341264810, now seen corresponding path program 1 times [2021-03-26 00:03:57,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:03:57,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681680794] [2021-03-26 00:03:57,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:03:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:03:57,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:57,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:03:57,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:57,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:03:57,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:57,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:03:57,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:57,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:03:57,794 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-26 00:03:57,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681680794] [2021-03-26 00:03:57,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:03:57,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:03:57,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570678699] [2021-03-26 00:03:57,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:03:57,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:03:57,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:03:57,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:03:57,797 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 185 [2021-03-26 00:03:57,797 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 159 flow. Second operand has 5 states, 5 states have (on average 151.8) internal successors, (759), 5 states have internal predecessors, (759), 0 states have call successors, (0), 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-26 00:03:57,798 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:03:57,798 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 185 [2021-03-26 00:03:57,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:03:57,909 INFO L129 PetriNetUnfolder]: 135/332 cut-off events. [2021-03-26 00:03:57,909 INFO L130 PetriNetUnfolder]: For 388/762 co-relation queries the response was YES. [2021-03-26 00:03:57,910 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1153 conditions, 332 events. 135/332 cut-off events. For 388/762 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 1880 event pairs, 15 based on Foata normal form. 73/362 useless extension candidates. Maximal degree in co-relation 1135. Up to 217 conditions per place. [2021-03-26 00:03:57,911 INFO L132 encePairwiseOnDemand]: 179/185 looper letters, 8 selfloop transitions, 11 changer transitions 4/41 dead transitions. [2021-03-26 00:03:57,911 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 247 flow [2021-03-26 00:03:57,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:03:57,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:03:57,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 930 transitions. [2021-03-26 00:03:57,914 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8378378378378378 [2021-03-26 00:03:57,914 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 930 transitions. [2021-03-26 00:03:57,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 930 transitions. [2021-03-26 00:03:57,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:03:57,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 930 transitions. [2021-03-26 00:03:57,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 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-26 00:03:57,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 185.0) internal successors, (1295), 7 states have internal predecessors, (1295), 0 states have call successors, (0), 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-26 00:03:57,918 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 185.0) internal successors, (1295), 7 states have internal predecessors, (1295), 0 states have call successors, (0), 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-26 00:03:57,918 INFO L185 Difference]: Start difference. First operand has 44 places, 32 transitions, 159 flow. Second operand 6 states and 930 transitions. [2021-03-26 00:03:57,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 247 flow [2021-03-26 00:03:57,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 241 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:03:57,922 INFO L241 Difference]: Finished difference. Result has 48 places, 35 transitions, 217 flow [2021-03-26 00:03:57,923 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=217, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2021-03-26 00:03:57,923 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2021-03-26 00:03:57,923 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:03:57,923 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 35 transitions, 217 flow [2021-03-26 00:03:57,923 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 35 transitions, 217 flow [2021-03-26 00:03:57,923 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 35 transitions, 217 flow [2021-03-26 00:03:57,947 INFO L129 PetriNetUnfolder]: 66/215 cut-off events. [2021-03-26 00:03:57,947 INFO L130 PetriNetUnfolder]: For 455/561 co-relation queries the response was YES. [2021-03-26 00:03:57,948 INFO L84 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 215 events. 66/215 cut-off events. For 455/561 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1241 event pairs, 14 based on Foata normal form. 1/201 useless extension candidates. Maximal degree in co-relation 809. Up to 142 conditions per place. [2021-03-26 00:03:57,950 INFO L142 LiptonReduction]: Number of co-enabled transitions 358 [2021-03-26 00:03:57,962 INFO L154 LiptonReduction]: Checked pairs total: 246 [2021-03-26 00:03:57,962 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:03:57,962 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 39 [2021-03-26 00:03:57,966 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 209 flow [2021-03-26 00:03:57,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 151.8) internal successors, (759), 5 states have internal predecessors, (759), 0 states have call successors, (0), 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-26 00:03:57,967 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:03:57,967 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:03:57,967 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:03:57,967 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:03:57,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:03:57,967 INFO L82 PathProgramCache]: Analyzing trace with hash -854556242, now seen corresponding path program 1 times [2021-03-26 00:03:57,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:03:57,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034334484] [2021-03-26 00:03:57,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:03:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:03:58,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:58,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:03:58,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:58,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:03:58,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:58,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:03:58,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:58,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:03:58,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:58,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:03:58,090 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-26 00:03:58,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034334484] [2021-03-26 00:03:58,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:03:58,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:03:58,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116437435] [2021-03-26 00:03:58,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:03:58,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:03:58,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:03:58,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:03:58,092 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 185 [2021-03-26 00:03:58,093 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 209 flow. Second operand has 6 states, 6 states have (on average 151.83333333333334) internal successors, (911), 6 states have internal predecessors, (911), 0 states have call successors, (0), 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-26 00:03:58,093 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:03:58,093 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 185 [2021-03-26 00:03:58,093 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:03:58,162 INFO L129 PetriNetUnfolder]: 92/223 cut-off events. [2021-03-26 00:03:58,162 INFO L130 PetriNetUnfolder]: For 519/780 co-relation queries the response was YES. [2021-03-26 00:03:58,163 INFO L84 FinitePrefix]: Finished finitePrefix Result has 919 conditions, 223 events. 92/223 cut-off events. For 519/780 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1082 event pairs, 6 based on Foata normal form. 52/240 useless extension candidates. Maximal degree in co-relation 898. Up to 140 conditions per place. [2021-03-26 00:03:58,164 INFO L132 encePairwiseOnDemand]: 179/185 looper letters, 5 selfloop transitions, 11 changer transitions 4/38 dead transitions. [2021-03-26 00:03:58,164 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 38 transitions, 255 flow [2021-03-26 00:03:58,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:03:58,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:03:58,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1079 transitions. [2021-03-26 00:03:58,167 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8332046332046332 [2021-03-26 00:03:58,167 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1079 transitions. [2021-03-26 00:03:58,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1079 transitions. [2021-03-26 00:03:58,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:03:58,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1079 transitions. [2021-03-26 00:03:58,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 154.14285714285714) internal successors, (1079), 7 states have internal predecessors, (1079), 0 states have call successors, (0), 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-26 00:03:58,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 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-26 00:03:58,172 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 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-26 00:03:58,172 INFO L185 Difference]: Start difference. First operand has 48 places, 34 transitions, 209 flow. Second operand 7 states and 1079 transitions. [2021-03-26 00:03:58,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 38 transitions, 255 flow [2021-03-26 00:03:58,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 226 flow, removed 10 selfloop flow, removed 5 redundant places. [2021-03-26 00:03:58,177 INFO L241 Difference]: Finished difference. Result has 50 places, 32 transitions, 192 flow [2021-03-26 00:03:58,177 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=192, PETRI_PLACES=50, PETRI_TRANSITIONS=32} [2021-03-26 00:03:58,177 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 0 predicate places. [2021-03-26 00:03:58,177 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:03:58,177 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 32 transitions, 192 flow [2021-03-26 00:03:58,177 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 32 transitions, 192 flow [2021-03-26 00:03:58,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 32 transitions, 192 flow [2021-03-26 00:03:58,191 INFO L129 PetriNetUnfolder]: 30/123 cut-off events. [2021-03-26 00:03:58,191 INFO L130 PetriNetUnfolder]: For 226/252 co-relation queries the response was YES. [2021-03-26 00:03:58,191 INFO L84 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 123 events. 30/123 cut-off events. For 226/252 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 544 event pairs, 6 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 441. Up to 49 conditions per place. [2021-03-26 00:03:58,192 INFO L142 LiptonReduction]: Number of co-enabled transitions 264 [2021-03-26 00:03:58,530 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 00:03:58,697 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 00:03:58,810 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 00:03:58,916 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 00:03:59,103 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-26 00:03:59,255 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-26 00:03:59,260 INFO L154 LiptonReduction]: Checked pairs total: 148 [2021-03-26 00:03:59,260 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:03:59,260 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1083 [2021-03-26 00:03:59,261 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 178 flow [2021-03-26 00:03:59,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 151.83333333333334) internal successors, (911), 6 states have internal predecessors, (911), 0 states have call successors, (0), 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-26 00:03:59,261 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:03:59,262 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-26 00:03:59,262 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:03:59,262 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:03:59,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:03:59,262 INFO L82 PathProgramCache]: Analyzing trace with hash 442773976, now seen corresponding path program 1 times [2021-03-26 00:03:59,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:03:59,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953570011] [2021-03-26 00:03:59,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:03:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:03:59,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:59,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:03:59,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:59,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:03:59,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:03:59,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:03:59,308 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-26 00:03:59,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953570011] [2021-03-26 00:03:59,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:03:59,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:03:59,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811142214] [2021-03-26 00:03:59,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:03:59,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:03:59,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:03:59,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:03:59,310 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 187 [2021-03-26 00:03:59,311 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 29 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 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-26 00:03:59,311 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:03:59,311 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 187 [2021-03-26 00:03:59,311 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:03:59,342 INFO L129 PetriNetUnfolder]: 48/155 cut-off events. [2021-03-26 00:03:59,342 INFO L130 PetriNetUnfolder]: For 617/659 co-relation queries the response was YES. [2021-03-26 00:03:59,343 INFO L84 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 155 events. 48/155 cut-off events. For 617/659 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 782 event pairs, 7 based on Foata normal form. 15/159 useless extension candidates. Maximal degree in co-relation 560. Up to 69 conditions per place. [2021-03-26 00:03:59,343 INFO L132 encePairwiseOnDemand]: 184/187 looper letters, 3 selfloop transitions, 1 changer transitions 5/30 dead transitions. [2021-03-26 00:03:59,343 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 30 transitions, 192 flow [2021-03-26 00:03:59,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:03:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:03:59,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 642 transitions. [2021-03-26 00:03:59,345 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8582887700534759 [2021-03-26 00:03:59,345 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 642 transitions. [2021-03-26 00:03:59,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 642 transitions. [2021-03-26 00:03:59,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:03:59,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 642 transitions. [2021-03-26 00:03:59,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.5) internal successors, (642), 4 states have internal predecessors, (642), 0 states have call successors, (0), 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-26 00:03:59,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 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-26 00:03:59,348 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 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-26 00:03:59,348 INFO L185 Difference]: Start difference. First operand has 46 places, 29 transitions, 178 flow. Second operand 4 states and 642 transitions. [2021-03-26 00:03:59,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 30 transitions, 192 flow [2021-03-26 00:03:59,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 30 transitions, 150 flow, removed 12 selfloop flow, removed 7 redundant places. [2021-03-26 00:03:59,351 INFO L241 Difference]: Finished difference. Result has 44 places, 25 transitions, 121 flow [2021-03-26 00:03:59,351 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=44, PETRI_TRANSITIONS=25} [2021-03-26 00:03:59,352 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -6 predicate places. [2021-03-26 00:03:59,352 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:03:59,352 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 25 transitions, 121 flow [2021-03-26 00:03:59,352 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 25 transitions, 121 flow [2021-03-26 00:03:59,352 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 25 transitions, 121 flow [2021-03-26 00:03:59,359 INFO L129 PetriNetUnfolder]: 8/41 cut-off events. [2021-03-26 00:03:59,359 INFO L130 PetriNetUnfolder]: For 96/105 co-relation queries the response was YES. [2021-03-26 00:03:59,360 INFO L84 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 41 events. 8/41 cut-off events. For 96/105 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 75 event pairs, 1 based on Foata normal form. 7/47 useless extension candidates. Maximal degree in co-relation 101. Up to 12 conditions per place. [2021-03-26 00:03:59,360 INFO L142 LiptonReduction]: Number of co-enabled transitions 144 [2021-03-26 00:04:00,028 WARN L205 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 171 [2021-03-26 00:04:00,273 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2021-03-26 00:04:01,535 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 296 DAG size of output: 252 [2021-03-26 00:04:02,103 WARN L205 SmtUtils]: Spent 563.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2021-03-26 00:04:02,112 INFO L154 LiptonReduction]: Checked pairs total: 93 [2021-03-26 00:04:02,112 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:04:02,112 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2760 [2021-03-26 00:04:02,113 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 23 transitions, 115 flow [2021-03-26 00:04:02,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 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-26 00:04:02,113 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:04:02,114 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-26 00:04:02,114 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:04:02,114 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:04:02,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:04:02,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1632327982, now seen corresponding path program 1 times [2021-03-26 00:04:02,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:04:02,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544788146] [2021-03-26 00:04:02,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:04:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:04:02,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:02,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:04:02,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:02,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 00:04:02,276 INFO L142 QuantifierPusher]: treesize reduction 25, result has 74.7 percent of original size [2021-03-26 00:04:02,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2021-03-26 00:04:02,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:02,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 00:04:02,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:04:02,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 00:04:02,345 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-26 00:04:02,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544788146] [2021-03-26 00:04:02,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:04:02,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:04:02,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549864248] [2021-03-26 00:04:02,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:04:02,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:04:02,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:04:02,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:04:02,347 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 189 [2021-03-26 00:04:02,351 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 23 transitions, 115 flow. Second operand has 7 states, 7 states have (on average 131.85714285714286) internal successors, (923), 7 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:04:02,351 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:04:02,351 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 189 [2021-03-26 00:04:02,351 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:04:02,495 INFO L129 PetriNetUnfolder]: 12/51 cut-off events. [2021-03-26 00:04:02,495 INFO L130 PetriNetUnfolder]: For 212/229 co-relation queries the response was YES. [2021-03-26 00:04:02,495 INFO L84 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 51 events. 12/51 cut-off events. For 212/229 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 11/60 useless extension candidates. Maximal degree in co-relation 139. Up to 18 conditions per place. [2021-03-26 00:04:02,496 INFO L132 encePairwiseOnDemand]: 183/189 looper letters, 2 selfloop transitions, 4 changer transitions 4/27 dead transitions. [2021-03-26 00:04:02,496 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 27 transitions, 149 flow [2021-03-26 00:04:02,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:04:02,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:04:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 928 transitions. [2021-03-26 00:04:02,499 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7014361300075586 [2021-03-26 00:04:02,499 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 928 transitions. [2021-03-26 00:04:02,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 928 transitions. [2021-03-26 00:04:02,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:04:02,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 928 transitions. [2021-03-26 00:04:02,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.57142857142858) internal successors, (928), 7 states have internal predecessors, (928), 0 states have call successors, (0), 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-26 00:04:02,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 189.0) internal successors, (1512), 8 states have internal predecessors, (1512), 0 states have call successors, (0), 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-26 00:04:02,503 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 189.0) internal successors, (1512), 8 states have internal predecessors, (1512), 0 states have call successors, (0), 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-26 00:04:02,503 INFO L185 Difference]: Start difference. First operand has 39 places, 23 transitions, 115 flow. Second operand 7 states and 928 transitions. [2021-03-26 00:04:02,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 27 transitions, 149 flow [2021-03-26 00:04:02,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 27 transitions, 130 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-03-26 00:04:02,506 INFO L241 Difference]: Finished difference. Result has 43 places, 23 transitions, 116 flow [2021-03-26 00:04:02,506 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=116, PETRI_PLACES=43, PETRI_TRANSITIONS=23} [2021-03-26 00:04:02,507 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -7 predicate places. [2021-03-26 00:04:02,507 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:04:02,507 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 23 transitions, 116 flow [2021-03-26 00:04:02,507 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 23 transitions, 116 flow [2021-03-26 00:04:02,507 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 23 transitions, 116 flow [2021-03-26 00:04:02,511 INFO L129 PetriNetUnfolder]: 5/29 cut-off events. [2021-03-26 00:04:02,511 INFO L130 PetriNetUnfolder]: For 59/62 co-relation queries the response was YES. [2021-03-26 00:04:02,511 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 29 events. 5/29 cut-off events. For 59/62 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 3/32 useless extension candidates. Maximal degree in co-relation 72. Up to 8 conditions per place. [2021-03-26 00:04:02,511 INFO L142 LiptonReduction]: Number of co-enabled transitions 68 [2021-03-26 00:04:03,026 WARN L205 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 162 [2021-03-26 00:04:03,166 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2021-03-26 00:04:04,330 WARN L205 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 286 DAG size of output: 229 [2021-03-26 00:04:04,642 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-03-26 00:04:04,844 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-03-26 00:04:05,213 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 87 [2021-03-26 00:04:05,321 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 00:04:05,481 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-03-26 00:04:05,874 WARN L205 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 94 [2021-03-26 00:04:06,012 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-03-26 00:04:06,176 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-03-26 00:04:06,570 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 90 [2021-03-26 00:04:06,692 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-26 00:04:07,554 WARN L205 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 183 [2021-03-26 00:04:07,833 WARN L205 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2021-03-26 00:04:09,193 WARN L205 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 307 DAG size of output: 263 [2021-03-26 00:04:09,758 WARN L205 SmtUtils]: Spent 564.00 ms on a formula simplification that was a NOOP. DAG size: 260 [2021-03-26 00:04:09,763 INFO L154 LiptonReduction]: Checked pairs total: 33 [2021-03-26 00:04:09,763 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-26 00:04:09,763 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7256 [2021-03-26 00:04:09,764 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 20 transitions, 116 flow [2021-03-26 00:04:09,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 131.85714285714286) internal successors, (923), 7 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:04:09,764 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:04:09,764 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:04:09,764 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:04:09,764 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:04:09,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:04:09,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1322644907, now seen corresponding path program 1 times [2021-03-26 00:04:09,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:04:09,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055830294] [2021-03-26 00:04:09,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:04:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:04:09,799 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:04:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:04:09,840 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:04:09,866 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:04:09,866 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:04:09,866 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:04:09,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:04:09 BasicIcfg [2021-03-26 00:04:09,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:04:09,934 INFO L168 Benchmark]: Toolchain (without parser) took 22734.70 ms. Allocated memory was 255.9 MB in the beginning and 652.2 MB in the end (delta: 396.4 MB). Free memory was 234.5 MB in the beginning and 459.6 MB in the end (delta: -225.1 MB). Peak memory consumption was 169.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:04:09,934 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:04:09,934 INFO L168 Benchmark]: CACSL2BoogieTranslator took 564.39 ms. Allocated memory was 255.9 MB in the beginning and 362.8 MB in the end (delta: 107.0 MB). Free memory was 233.9 MB in the beginning and 320.9 MB in the end (delta: -87.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:04:09,935 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.97 ms. Allocated memory is still 362.8 MB. Free memory was 320.9 MB in the beginning and 318.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:04:09,935 INFO L168 Benchmark]: Boogie Preprocessor took 56.37 ms. Allocated memory is still 362.8 MB. Free memory was 318.1 MB in the beginning and 316.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:04:09,935 INFO L168 Benchmark]: RCFGBuilder took 1971.23 ms. Allocated memory is still 362.8 MB. Free memory was 315.4 MB in the beginning and 321.5 MB in the end (delta: -6.2 MB). Peak memory consumption was 136.7 MB. Max. memory is 16.0 GB. [2021-03-26 00:04:09,935 INFO L168 Benchmark]: TraceAbstraction took 20055.25 ms. Allocated memory was 362.8 MB in the beginning and 652.2 MB in the end (delta: 289.4 MB). Free memory was 321.5 MB in the beginning and 459.6 MB in the end (delta: -138.1 MB). Peak memory consumption was 150.3 MB. Max. memory is 16.0 GB. [2021-03-26 00:04:09,936 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.48 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 564.39 ms. Allocated memory was 255.9 MB in the beginning and 362.8 MB in the end (delta: 107.0 MB). Free memory was 233.9 MB in the beginning and 320.9 MB in the end (delta: -87.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 82.97 ms. Allocated memory is still 362.8 MB. Free memory was 320.9 MB in the beginning and 318.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 56.37 ms. Allocated memory is still 362.8 MB. Free memory was 318.1 MB in the beginning and 316.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1971.23 ms. Allocated memory is still 362.8 MB. Free memory was 315.4 MB in the beginning and 321.5 MB in the end (delta: -6.2 MB). Peak memory consumption was 136.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 20055.25 ms. Allocated memory was 362.8 MB in the beginning and 652.2 MB in the end (delta: 289.4 MB). Free memory was 321.5 MB in the beginning and 459.6 MB in the end (delta: -138.1 MB). Peak memory consumption was 150.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3107.4ms, 107 PlacesBefore, 50 PlacesAfterwards, 99 TransitionsBefore, 41 TransitionsAfterwards, 1750 CoEnabledTransitionPairs, 4 FixpointIterations, 28 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 67 TotalNumberOfCompositions, 2346 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1461, positive: 1406, positive conditional: 1406, positive unconditional: 0, negative: 55, negative conditional: 55, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1175, positive: 1140, positive conditional: 0, positive unconditional: 1140, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1175, positive: 1140, positive conditional: 0, positive unconditional: 1140, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1175, positive: 1131, positive conditional: 0, positive unconditional: 1131, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 44, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 532, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 503, negative conditional: 0, negative unconditional: 503, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1461, positive: 266, positive conditional: 266, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 1175, unknown conditional: 1175, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 68, Positive conditional cache size: 68, Positive unconditional cache size: 0, Negative cache size: 21, Negative conditional cache size: 21, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1460.7ms, 47 PlacesBefore, 34 PlacesAfterwards, 38 TransitionsBefore, 25 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 1470 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 514, positive: 417, positive conditional: 417, positive unconditional: 0, negative: 97, negative conditional: 97, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 155, positive: 130, positive conditional: 12, positive unconditional: 118, negative: 25, negative conditional: 1, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 155, positive: 130, positive conditional: 12, positive unconditional: 118, negative: 25, negative conditional: 1, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 155, positive: 127, positive conditional: 0, positive unconditional: 127, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 25, negative conditional: 1, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 405, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 394, negative conditional: 65, negative unconditional: 329, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 514, positive: 287, positive conditional: 287, positive unconditional: 0, negative: 72, negative conditional: 72, negative unconditional: 0, unknown: 155, unknown conditional: 155, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 114, Positive conditional cache size: 114, Positive unconditional cache size: 0, Negative cache size: 26, Negative conditional cache size: 26, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1484.6ms, 43 PlacesBefore, 37 PlacesAfterwards, 28 TransitionsBefore, 26 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 522 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 173, positive: 140, positive conditional: 140, positive unconditional: 0, negative: 33, negative conditional: 33, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 140, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 140, negative conditional: 0, negative unconditional: 140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 173, positive: 129, positive conditional: 129, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 125, Positive conditional cache size: 125, Positive unconditional cache size: 0, Negative cache size: 32, Negative conditional cache size: 32, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 188.3ms, 37 PlacesBefore, 37 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 186 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 45, positive: 33, positive conditional: 33, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 14, positive conditional: 3, positive unconditional: 11, negative: 6, negative conditional: 2, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 14, positive conditional: 3, positive unconditional: 11, negative: 6, negative conditional: 2, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 2, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 168, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 168, negative conditional: 79, negative unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 45, positive: 19, positive conditional: 19, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 139, Positive conditional cache size: 139, Positive unconditional cache size: 0, Negative cache size: 38, Negative conditional cache size: 38, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 90.6ms, 38 PlacesBefore, 38 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 306 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 66, positive: 48, positive conditional: 48, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, positive: 24, positive conditional: 8, positive unconditional: 16, 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: 25, positive: 24, positive conditional: 8, positive unconditional: 16, 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: 25, positive: 24, positive conditional: 0, positive unconditional: 24, 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: 30, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 25, unknown conditional: 25, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 141, Positive conditional cache size: 141, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 55.2ms, 44 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 384 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 173 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 41, positive: 33, positive conditional: 33, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, positive: 18, positive conditional: 16, positive unconditional: 2, 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: 18, positive: 18, positive conditional: 16, positive unconditional: 2, 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: 18, positive: 18, positive conditional: 0, positive unconditional: 18, 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: 41, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 138, Positive conditional cache size: 138, Positive unconditional cache size: 0, Negative cache size: 33, Negative conditional cache size: 33, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 39.1ms, 48 PlacesBefore, 48 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 358 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 246 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 13, 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: 13, positive: 13, positive conditional: 13, 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: 13, positive: 13, positive conditional: 0, positive unconditional: 13, 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: 40, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 139, Positive conditional cache size: 139, Positive unconditional cache size: 0, Negative cache size: 33, Negative conditional cache size: 33, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1082.8ms, 50 PlacesBefore, 46 PlacesAfterwards, 32 TransitionsBefore, 29 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 148 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 31, positive: 22, positive conditional: 22, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 11, positive unconditional: 1, 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: 12, positive: 12, positive conditional: 11, positive unconditional: 1, 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: 12, positive: 12, positive conditional: 0, positive unconditional: 12, 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: 10, positive conditional: 10, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 128, Positive conditional cache size: 128, Positive unconditional cache size: 0, Negative cache size: 26, Negative conditional cache size: 26, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2760.3ms, 44 PlacesBefore, 39 PlacesAfterwards, 25 TransitionsBefore, 23 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 93 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 70, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, positive: 32, positive conditional: 13, positive unconditional: 19, 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: 33, positive: 32, positive conditional: 13, positive unconditional: 19, 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: 33, positive: 32, positive conditional: 0, positive unconditional: 32, 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: 60, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 70, positive: 29, positive conditional: 29, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 33, unknown conditional: 33, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 64, Positive conditional cache size: 64, Positive unconditional cache size: 0, Negative cache size: 19, Negative conditional cache size: 19, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7255.9ms, 43 PlacesBefore, 37 PlacesAfterwards, 23 TransitionsBefore, 20 TransitionsAfterwards, 68 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 33 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 33, positive: 33, positive conditional: 33, 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: 20, positive: 20, positive conditional: 19, positive unconditional: 1, 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: 20, positive: 20, positive conditional: 19, positive unconditional: 1, 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: 20, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, positive: 19, positive conditional: 19, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, positive: 13, positive conditional: 13, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 13, Positive conditional cache size: 13, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L727] 0 int z = 0; [L728] 0 _Bool z$flush_delayed; [L729] 0 int z$mem_tmp; [L730] 0 _Bool z$r_buff0_thd0; [L731] 0 _Bool z$r_buff0_thd1; [L732] 0 _Bool z$r_buff0_thd2; [L733] 0 _Bool z$r_buff0_thd3; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$read_delayed; [L739] 0 int *z$read_delayed_var; [L740] 0 int z$w_buff0; [L741] 0 _Bool z$w_buff0_used; [L742] 0 int z$w_buff1; [L743] 0 _Bool z$w_buff1_used; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L851] 0 pthread_t t290; [L852] FCALL, FORK 0 pthread_create(&t290, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] 0 pthread_t t291; [L854] FCALL, FORK 0 pthread_create(&t291, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 pthread_t t292; [L856] FCALL, FORK 0 pthread_create(&t292, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 z$w_buff1 = z$w_buff0 [L799] 3 z$w_buff0 = 1 [L800] 3 z$w_buff1_used = z$w_buff0_used [L801] 3 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L803] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 z$flush_delayed = weak$$choice2 [L813] 3 z$mem_tmp = z [L814] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 [L814] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L814] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L815] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L815] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L816] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L816] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L817] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L817] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L818] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L819] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L820] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EAX = z [L822] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L822] 3 z = z$flush_delayed ? z$mem_tmp : z [L823] 3 z$flush_delayed = (_Bool)0 [L826] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 a = 1 [L752] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 x = 2 [L767] 2 y = 1 [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 2 z$flush_delayed = weak$$choice2 [L776] 2 z$mem_tmp = z [L777] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L777] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L778] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L778] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L779] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L779] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L780] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L780] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L782] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L783] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 __unbuffered_p1_EBX = z [L785] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L785] 2 z = z$flush_delayed ? z$mem_tmp : z [L786] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L829] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L830] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L830] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L831] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L831] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L832] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L832] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L833] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L836] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 3 return 0; [L858] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L862] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L862] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L863] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L864] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L864] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L865] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L865] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L866] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L866] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 101 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 6.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 19834.1ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 909.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3201.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 46 SDtfs, 36 SDslu, 32 SDs, 0 SdLazy, 167 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 191.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 242.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=6, InterpolantAutomatonStates: 45, 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: 37.1ms SsaConstructionTime, 369.0ms SatisfiabilityAnalysisTime, 616.3ms InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 141 ConstructedInterpolants, 0 QuantifiedInterpolants, 791 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...