/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/rfi004_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:29:27,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:29:27,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:29:27,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:29:27,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:29:27,884 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:29:27,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:29:27,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:29:27,895 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:29:27,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:29:27,900 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:29:27,901 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:29:27,901 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:29:27,903 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:29:27,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:29:27,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:29:27,908 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:29:27,909 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:29:27,911 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:29:27,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:29:27,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:29:27,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:29:27,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:29:27,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:29:27,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:29:27,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:29:27,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:29:27,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:29:27,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:29:27,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:29:27,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:29:27,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:29:27,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:29:27,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:29:27,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:29:27,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:29:27,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:29:27,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:29:27,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:29:27,939 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:29:27,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:29:27,941 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:29:27,976 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:29:27,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:29:27,980 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:29:27,980 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:29:27,980 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:29:27,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:29:27,980 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:29:27,981 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:29:27,981 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:29:27,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:29:27,982 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:29:27,982 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:29:27,982 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:29:27,982 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:29:27,982 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:29:27,982 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:29:27,982 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:29:27,983 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:29:27,983 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:29:27,983 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:29:27,983 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:29:27,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:29:27,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:29:27,983 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:29:27,984 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:29:27,984 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:29:27,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:29:27,984 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:29:27,984 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:29:27,984 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:29:27,984 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:29:28,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:29:28,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:29:28,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:29:28,321 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:29:28,322 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:29:28,323 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004_tso.opt.i [2021-03-26 00:29:28,387 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e89bf8d0a/a09051f247fe4349b76125beb1e433f6/FLAG322931842 [2021-03-26 00:29:28,895 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:29:28,895 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004_tso.opt.i [2021-03-26 00:29:28,912 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e89bf8d0a/a09051f247fe4349b76125beb1e433f6/FLAG322931842 [2021-03-26 00:29:29,373 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e89bf8d0a/a09051f247fe4349b76125beb1e433f6 [2021-03-26 00:29:29,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:29:29,377 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:29:29,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:29:29,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:29:29,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:29:29,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:29:29" (1/1) ... [2021-03-26 00:29:29,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc802d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:29:29, skipping insertion in model container [2021-03-26 00:29:29,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:29:29" (1/1) ... [2021-03-26 00:29:29,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:29:29,460 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:29:29,577 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/rfi004_tso.opt.i[991,1004] [2021-03-26 00:29:29,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:29:29,806 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:29:29,818 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/rfi004_tso.opt.i[991,1004] [2021-03-26 00:29:29,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:29:29,921 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:29:29,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:29:29 WrapperNode [2021-03-26 00:29:29,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:29:29,922 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:29:29,923 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:29:29,923 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:29:29,927 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:29:29" (1/1) ... [2021-03-26 00:29:29,940 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:29:29" (1/1) ... [2021-03-26 00:29:29,963 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:29:29,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:29:29,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:29:29,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:29:29,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:29:29" (1/1) ... [2021-03-26 00:29:29,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:29:29" (1/1) ... [2021-03-26 00:29:29,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:29:29" (1/1) ... [2021-03-26 00:29:29,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:29:29" (1/1) ... [2021-03-26 00:29:29,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:29:29" (1/1) ... [2021-03-26 00:29:29,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:29:29" (1/1) ... [2021-03-26 00:29:29,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:29:29" (1/1) ... [2021-03-26 00:29:29,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:29:29,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:29:29,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:29:29,997 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:29:29,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:29:29" (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:29:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:29:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:29:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:29:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:29:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:29:30,063 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:29:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:29:30,064 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:29:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:29:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:29:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:29:30,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:29:30,066 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:29:31,537 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:29:31,537 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:29:31,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:29:31 BoogieIcfgContainer [2021-03-26 00:29:31,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:29:31,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:29:31,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:29:31,544 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:29:31,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:29:29" (1/3) ... [2021-03-26 00:29:31,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a43e003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:29:31, skipping insertion in model container [2021-03-26 00:29:31,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:29:29" (2/3) ... [2021-03-26 00:29:31,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a43e003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:29:31, skipping insertion in model container [2021-03-26 00:29:31,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:29:31" (3/3) ... [2021-03-26 00:29:31,547 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi004_tso.opt.i [2021-03-26 00:29:31,555 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:29:31,559 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:29:31,560 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:29:31,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,590 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,590 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,590 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,590 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,605 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,605 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,606 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,606 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,606 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,607 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,607 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,608 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,608 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,611 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,620 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,621 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,621 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,623 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,624 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:29:31,627 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:29:31,642 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-26 00:29:31,670 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:29:31,670 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:29:31,670 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:29:31,670 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:29:31,670 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:29:31,670 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:29:31,670 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:29:31,670 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:29:31,683 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 84 transitions, 178 flow [2021-03-26 00:29:31,719 INFO L129 PetriNetUnfolder]: 2/82 cut-off events. [2021-03-26 00:29:31,719 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:29:31,731 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 82 events. 2/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2021-03-26 00:29:31,731 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 84 transitions, 178 flow [2021-03-26 00:29:31,735 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 82 transitions, 170 flow [2021-03-26 00:29:31,736 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:29:31,748 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 82 transitions, 170 flow [2021-03-26 00:29:31,751 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 82 transitions, 170 flow [2021-03-26 00:29:31,755 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 82 transitions, 170 flow [2021-03-26 00:29:31,778 INFO L129 PetriNetUnfolder]: 2/82 cut-off events. [2021-03-26 00:29:31,778 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:29:31,779 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 82 events. 2/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2021-03-26 00:29:31,782 INFO L142 LiptonReduction]: Number of co-enabled transitions 968 [2021-03-26 00:29:32,318 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:29:32,750 WARN L205 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:29:32,863 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:29:34,328 INFO L154 LiptonReduction]: Checked pairs total: 1372 [2021-03-26 00:29:34,328 INFO L156 LiptonReduction]: Total number of compositions: 58 [2021-03-26 00:29:34,333 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2598 [2021-03-26 00:29:34,346 INFO L129 PetriNetUnfolder]: 0/16 cut-off events. [2021-03-26 00:29:34,346 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:29:34,346 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:29:34,347 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:29:34,347 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:29:34,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:29:34,353 INFO L82 PathProgramCache]: Analyzing trace with hash -5866582, now seen corresponding path program 1 times [2021-03-26 00:29:34,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:29:34,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841316805] [2021-03-26 00:29:34,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:29:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:29:34,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:34,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:29:34,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:34,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:29:34,609 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:29:34,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841316805] [2021-03-26 00:29:34,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:29:34,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:29:34,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239508467] [2021-03-26 00:29:34,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:29:34,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:29:34,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:29:34,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:29:34,631 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 142 [2021-03-26 00:29:34,634 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 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:29:34,634 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:29:34,634 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 142 [2021-03-26 00:29:34,635 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:29:34,689 INFO L129 PetriNetUnfolder]: 9/74 cut-off events. [2021-03-26 00:29:34,689 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:29:34,691 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 74 events. 9/74 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 213 event pairs, 3 based on Foata normal form. 5/72 useless extension candidates. Maximal degree in co-relation 86. Up to 17 conditions per place. [2021-03-26 00:29:34,692 INFO L132 encePairwiseOnDemand]: 138/142 looper letters, 5 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2021-03-26 00:29:34,692 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 84 flow [2021-03-26 00:29:34,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:29:34,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:29:34,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2021-03-26 00:29:34,713 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8826291079812206 [2021-03-26 00:29:34,713 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2021-03-26 00:29:34,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2021-03-26 00:29:34,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:29:34,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2021-03-26 00:29:34,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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:29:34,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 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:29:34,737 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 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:29:34,739 INFO L185 Difference]: Start difference. First operand has 38 places, 32 transitions, 70 flow. Second operand 3 states and 376 transitions. [2021-03-26 00:29:34,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 84 flow [2021-03-26 00:29:34,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:29:34,742 INFO L241 Difference]: Finished difference. Result has 37 places, 30 transitions, 68 flow [2021-03-26 00:29:34,749 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2021-03-26 00:29:34,750 INFO L343 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2021-03-26 00:29:34,750 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:29:34,750 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 68 flow [2021-03-26 00:29:34,751 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 68 flow [2021-03-26 00:29:34,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 68 flow [2021-03-26 00:29:34,761 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2021-03-26 00:29:34,762 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:29:34,762 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:29:34,763 INFO L142 LiptonReduction]: Number of co-enabled transitions 202 [2021-03-26 00:29:36,077 INFO L154 LiptonReduction]: Checked pairs total: 625 [2021-03-26 00:29:36,077 INFO L156 LiptonReduction]: Total number of compositions: 13 [2021-03-26 00:29:36,078 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1328 [2021-03-26 00:29:36,080 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 44 flow [2021-03-26 00:29:36,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 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:29:36,081 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:29:36,081 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:29:36,081 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:29:36,081 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:29:36,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:29:36,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1946974624, now seen corresponding path program 1 times [2021-03-26 00:29:36,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:29:36,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270847810] [2021-03-26 00:29:36,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:29:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:29:36,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:36,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:29:36,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:36,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:29:36,171 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:29:36,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:29:36,175 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:29:36,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270847810] [2021-03-26 00:29:36,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:29:36,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:29:36,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780786892] [2021-03-26 00:29:36,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:29:36,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:29:36,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:29:36,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:29:36,179 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 155 [2021-03-26 00:29:36,179 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 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:29:36,180 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:29:36,180 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 155 [2021-03-26 00:29:36,180 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:29:36,201 INFO L129 PetriNetUnfolder]: 1/21 cut-off events. [2021-03-26 00:29:36,201 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:29:36,201 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 21 events. 1/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 26. Up to 3 conditions per place. [2021-03-26 00:29:36,202 INFO L132 encePairwiseOnDemand]: 151/155 looper letters, 1 selfloop transitions, 2 changer transitions 5/20 dead transitions. [2021-03-26 00:29:36,202 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 20 transitions, 60 flow [2021-03-26 00:29:36,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:29:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:29:36,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2021-03-26 00:29:36,204 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8541935483870968 [2021-03-26 00:29:36,204 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2021-03-26 00:29:36,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2021-03-26 00:29:36,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:29:36,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2021-03-26 00:29:36,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 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:29:36,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 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:29:36,209 INFO L81 ComplementDD]: Finished complementDD. Result has 6 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:29:36,210 INFO L185 Difference]: Start difference. First operand has 25 places, 18 transitions, 44 flow. Second operand 5 states and 662 transitions. [2021-03-26 00:29:36,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 20 transitions, 60 flow [2021-03-26 00:29:36,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 20 transitions, 56 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:29:36,210 INFO L241 Difference]: Finished difference. Result has 28 places, 15 transitions, 42 flow [2021-03-26 00:29:36,211 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=42, PETRI_PLACES=28, PETRI_TRANSITIONS=15} [2021-03-26 00:29:36,211 INFO L343 CegarLoopForPetriNet]: 38 programPoint places, -10 predicate places. [2021-03-26 00:29:36,211 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:29:36,211 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 15 transitions, 42 flow [2021-03-26 00:29:36,212 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 15 transitions, 42 flow [2021-03-26 00:29:36,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 23 places, 15 transitions, 42 flow [2021-03-26 00:29:36,214 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-03-26 00:29:36,214 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:29:36,214 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 15 events. 0/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:29:36,215 INFO L142 LiptonReduction]: Number of co-enabled transitions 74 [2021-03-26 00:29:36,534 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 00:29:36,702 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 00:29:37,003 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 00:29:37,127 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 00:29:37,132 INFO L154 LiptonReduction]: Checked pairs total: 170 [2021-03-26 00:29:37,132 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:29:37,133 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 921 [2021-03-26 00:29:37,133 INFO L480 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 40 flow [2021-03-26 00:29:37,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 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:29:37,134 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:29:37,134 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:29:37,134 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:29:37,134 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:29:37,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:29:37,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1766388060, now seen corresponding path program 1 times [2021-03-26 00:29:37,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:29:37,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139062274] [2021-03-26 00:29:37,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:29:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:29:37,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:37,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:29:37,201 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:29:37,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:29:37,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:37,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:29:37,208 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:29:37,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139062274] [2021-03-26 00:29:37,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:29:37,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:29:37,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457600367] [2021-03-26 00:29:37,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:29:37,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:29:37,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:29:37,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:29:37,211 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 156 [2021-03-26 00:29:37,212 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 14 transitions, 40 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 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:29:37,212 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:29:37,212 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 156 [2021-03-26 00:29:37,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:29:37,253 INFO L129 PetriNetUnfolder]: 6/31 cut-off events. [2021-03-26 00:29:37,254 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:29:37,254 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 31 events. 6/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 70 event pairs, 2 based on Foata normal form. 4/35 useless extension candidates. Maximal degree in co-relation 55. Up to 15 conditions per place. [2021-03-26 00:29:37,254 INFO L132 encePairwiseOnDemand]: 151/156 looper letters, 4 selfloop transitions, 3 changer transitions 5/21 dead transitions. [2021-03-26 00:29:37,254 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 21 transitions, 78 flow [2021-03-26 00:29:37,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:29:37,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:29:37,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 644 transitions. [2021-03-26 00:29:37,259 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8256410256410256 [2021-03-26 00:29:37,259 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 644 transitions. [2021-03-26 00:29:37,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 644 transitions. [2021-03-26 00:29:37,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:29:37,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 644 transitions. [2021-03-26 00:29:37,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 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:29:37,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 156.0) internal successors, (936), 6 states have internal predecessors, (936), 0 states have call successors, (0), 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:29:37,263 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 156.0) internal successors, (936), 6 states have internal predecessors, (936), 0 states have call successors, (0), 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:29:37,263 INFO L185 Difference]: Start difference. First operand has 22 places, 14 transitions, 40 flow. Second operand 5 states and 644 transitions. [2021-03-26 00:29:37,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 21 transitions, 78 flow [2021-03-26 00:29:37,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 74 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:29:37,264 INFO L241 Difference]: Finished difference. Result has 27 places, 16 transitions, 63 flow [2021-03-26 00:29:37,264 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=63, PETRI_PLACES=27, PETRI_TRANSITIONS=16} [2021-03-26 00:29:37,264 INFO L343 CegarLoopForPetriNet]: 38 programPoint places, -11 predicate places. [2021-03-26 00:29:37,264 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:29:37,265 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 16 transitions, 63 flow [2021-03-26 00:29:37,265 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 16 transitions, 63 flow [2021-03-26 00:29:37,265 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 25 places, 16 transitions, 63 flow [2021-03-26 00:29:37,269 INFO L129 PetriNetUnfolder]: 5/26 cut-off events. [2021-03-26 00:29:37,269 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-03-26 00:29:37,269 INFO L84 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 26 events. 5/26 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 2 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 55. Up to 12 conditions per place. [2021-03-26 00:29:37,269 INFO L142 LiptonReduction]: Number of co-enabled transitions 64 [2021-03-26 00:29:37,323 INFO L154 LiptonReduction]: Checked pairs total: 55 [2021-03-26 00:29:37,323 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:29:37,323 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 59 [2021-03-26 00:29:37,324 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 63 flow [2021-03-26 00:29:37,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 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:29:37,325 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:29:37,325 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:29:37,325 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:29:37,325 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:29:37,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:29:37,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1872510131, now seen corresponding path program 1 times [2021-03-26 00:29:37,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:29:37,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693674690] [2021-03-26 00:29:37,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:29:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:29:37,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:37,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:29:37,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:37,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:29:37,416 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:29:37,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:29:37,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:37,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:29:37,423 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:29:37,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693674690] [2021-03-26 00:29:37,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:29:37,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:29:37,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793954963] [2021-03-26 00:29:37,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:29:37,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:29:37,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:29:37,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:29:37,425 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 156 [2021-03-26 00:29:37,426 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 63 flow. Second operand has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 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:29:37,426 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:29:37,426 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 156 [2021-03-26 00:29:37,426 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:29:37,481 INFO L129 PetriNetUnfolder]: 2/20 cut-off events. [2021-03-26 00:29:37,481 INFO L130 PetriNetUnfolder]: For 13/15 co-relation queries the response was YES. [2021-03-26 00:29:37,482 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 20 events. 2/20 cut-off events. For 13/15 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 5/25 useless extension candidates. Maximal degree in co-relation 49. Up to 10 conditions per place. [2021-03-26 00:29:37,482 INFO L132 encePairwiseOnDemand]: 151/156 looper letters, 2 selfloop transitions, 5 changer transitions 3/19 dead transitions. [2021-03-26 00:29:37,482 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 19 transitions, 99 flow [2021-03-26 00:29:37,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:29:37,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:29:37,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 768 transitions. [2021-03-26 00:29:37,486 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8205128205128205 [2021-03-26 00:29:37,486 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 768 transitions. [2021-03-26 00:29:37,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 768 transitions. [2021-03-26 00:29:37,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:29:37,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 768 transitions. [2021-03-26 00:29:37,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 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:29:37,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 156.0) internal successors, (1092), 7 states have internal predecessors, (1092), 0 states have call successors, (0), 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:29:37,491 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 156.0) internal successors, (1092), 7 states have internal predecessors, (1092), 0 states have call successors, (0), 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:29:37,492 INFO L185 Difference]: Start difference. First operand has 25 places, 16 transitions, 63 flow. Second operand 6 states and 768 transitions. [2021-03-26 00:29:37,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 19 transitions, 99 flow [2021-03-26 00:29:37,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 19 transitions, 82 flow, removed 6 selfloop flow, removed 3 redundant places. [2021-03-26 00:29:37,493 INFO L241 Difference]: Finished difference. Result has 30 places, 16 transitions, 70 flow [2021-03-26 00:29:37,494 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=70, PETRI_PLACES=30, PETRI_TRANSITIONS=16} [2021-03-26 00:29:37,494 INFO L343 CegarLoopForPetriNet]: 38 programPoint places, -8 predicate places. [2021-03-26 00:29:37,494 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:29:37,494 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 16 transitions, 70 flow [2021-03-26 00:29:37,494 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 16 transitions, 70 flow [2021-03-26 00:29:37,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 28 places, 16 transitions, 70 flow [2021-03-26 00:29:37,499 INFO L129 PetriNetUnfolder]: 1/16 cut-off events. [2021-03-26 00:29:37,499 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-03-26 00:29:37,500 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 16 events. 1/16 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 8 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 32. Up to 6 conditions per place. [2021-03-26 00:29:37,500 INFO L142 LiptonReduction]: Number of co-enabled transitions 34 [2021-03-26 00:29:37,784 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2021-03-26 00:29:37,932 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2021-03-26 00:29:38,063 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-03-26 00:29:38,280 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2021-03-26 00:29:38,416 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2021-03-26 00:29:38,418 INFO L154 LiptonReduction]: Checked pairs total: 108 [2021-03-26 00:29:38,418 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:29:38,418 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 924 [2021-03-26 00:29:38,419 INFO L480 AbstractCegarLoop]: Abstraction has has 26 places, 14 transitions, 66 flow [2021-03-26 00:29:38,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 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:29:38,420 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:29:38,420 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:29:38,420 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:29:38,420 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:29:38,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:29:38,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1171122748, now seen corresponding path program 1 times [2021-03-26 00:29:38,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:29:38,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220863703] [2021-03-26 00:29:38,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:29:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:29:38,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:38,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:29:38,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:38,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:29:38,515 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-03-26 00:29:38,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:29:38,526 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:29:38,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220863703] [2021-03-26 00:29:38,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:29:38,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:29:38,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698449415] [2021-03-26 00:29:38,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:29:38,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:29:38,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:29:38,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:29:38,528 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 158 [2021-03-26 00:29:38,529 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 14 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 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:29:38,529 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:29:38,529 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 158 [2021-03-26 00:29:38,529 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:29:38,557 INFO L129 PetriNetUnfolder]: 3/26 cut-off events. [2021-03-26 00:29:38,557 INFO L130 PetriNetUnfolder]: For 45/46 co-relation queries the response was YES. [2021-03-26 00:29:38,557 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 26 events. 3/26 cut-off events. For 45/46 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 49 event pairs, 0 based on Foata normal form. 2/28 useless extension candidates. Maximal degree in co-relation 62. Up to 11 conditions per place. [2021-03-26 00:29:38,558 INFO L132 encePairwiseOnDemand]: 153/158 looper letters, 3 selfloop transitions, 5 changer transitions 1/18 dead transitions. [2021-03-26 00:29:38,558 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 18 transitions, 92 flow [2021-03-26 00:29:38,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:29:38,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:29:38,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 620 transitions. [2021-03-26 00:29:38,560 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7848101265822784 [2021-03-26 00:29:38,560 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 620 transitions. [2021-03-26 00:29:38,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 620 transitions. [2021-03-26 00:29:38,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:29:38,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 620 transitions. [2021-03-26 00:29:38,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.0) internal successors, (620), 5 states have internal predecessors, (620), 0 states have call successors, (0), 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:29:38,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 158.0) internal successors, (948), 6 states have internal predecessors, (948), 0 states have call successors, (0), 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:29:38,563 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 158.0) internal successors, (948), 6 states have internal predecessors, (948), 0 states have call successors, (0), 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:29:38,564 INFO L185 Difference]: Start difference. First operand has 26 places, 14 transitions, 66 flow. Second operand 5 states and 620 transitions. [2021-03-26 00:29:38,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 18 transitions, 92 flow [2021-03-26 00:29:38,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 18 transitions, 76 flow, removed 5 selfloop flow, removed 5 redundant places. [2021-03-26 00:29:38,565 INFO L241 Difference]: Finished difference. Result has 28 places, 17 transitions, 81 flow [2021-03-26 00:29:38,566 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=81, PETRI_PLACES=28, PETRI_TRANSITIONS=17} [2021-03-26 00:29:38,566 INFO L343 CegarLoopForPetriNet]: 38 programPoint places, -10 predicate places. [2021-03-26 00:29:38,566 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:29:38,566 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 17 transitions, 81 flow [2021-03-26 00:29:38,566 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 17 transitions, 81 flow [2021-03-26 00:29:38,567 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 28 places, 17 transitions, 81 flow [2021-03-26 00:29:38,572 INFO L129 PetriNetUnfolder]: 2/21 cut-off events. [2021-03-26 00:29:38,572 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2021-03-26 00:29:38,572 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 21 events. 2/21 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 46. Up to 6 conditions per place. [2021-03-26 00:29:38,572 INFO L142 LiptonReduction]: Number of co-enabled transitions 32 [2021-03-26 00:29:38,709 INFO L154 LiptonReduction]: Checked pairs total: 22 [2021-03-26 00:29:38,710 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:29:38,710 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 144 [2021-03-26 00:29:38,712 INFO L480 AbstractCegarLoop]: Abstraction has has 28 places, 17 transitions, 81 flow [2021-03-26 00:29:38,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 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:29:38,712 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:29:38,713 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:29:38,713 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:29:38,713 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:29:38,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:29:38,713 INFO L82 PathProgramCache]: Analyzing trace with hash 583803499, now seen corresponding path program 1 times [2021-03-26 00:29:38,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:29:38,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849526620] [2021-03-26 00:29:38,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:29:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:29:38,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:38,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:29:38,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:38,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:29:38,820 INFO L142 QuantifierPusher]: treesize reduction 12, result has 55.6 percent of original size [2021-03-26 00:29:38,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 00:29:38,831 INFO L142 QuantifierPusher]: treesize reduction 12, result has 55.6 percent of original size [2021-03-26 00:29:38,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 00:29:38,848 INFO L142 QuantifierPusher]: treesize reduction 17, result has 57.5 percent of original size [2021-03-26 00:29:38,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 00:29:38,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:38,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:29:38,873 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:29:38,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849526620] [2021-03-26 00:29:38,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:29:38,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:29:38,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58867305] [2021-03-26 00:29:38,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:29:38,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:29:38,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:29:38,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:29:38,876 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 158 [2021-03-26 00:29:38,877 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 17 transitions, 81 flow. Second operand has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 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:29:38,877 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:29:38,877 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 158 [2021-03-26 00:29:38,877 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:29:38,996 INFO L129 PetriNetUnfolder]: 8/41 cut-off events. [2021-03-26 00:29:38,996 INFO L130 PetriNetUnfolder]: For 44/47 co-relation queries the response was YES. [2021-03-26 00:29:38,996 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 41 events. 8/41 cut-off events. For 44/47 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 106 event pairs, 1 based on Foata normal form. 4/45 useless extension candidates. Maximal degree in co-relation 115. Up to 10 conditions per place. [2021-03-26 00:29:38,997 INFO L132 encePairwiseOnDemand]: 151/158 looper letters, 5 selfloop transitions, 3 changer transitions 11/26 dead transitions. [2021-03-26 00:29:38,997 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 26 transitions, 153 flow [2021-03-26 00:29:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 00:29:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 00:29:38,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 974 transitions. [2021-03-26 00:29:39,000 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6849507735583685 [2021-03-26 00:29:39,000 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 974 transitions. [2021-03-26 00:29:39,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 974 transitions. [2021-03-26 00:29:39,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:29:39,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 974 transitions. [2021-03-26 00:29:39,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 108.22222222222223) internal successors, (974), 9 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:39,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 158.0) internal successors, (1580), 10 states have internal predecessors, (1580), 0 states have call successors, (0), 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:29:39,005 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 158.0) internal successors, (1580), 10 states have internal predecessors, (1580), 0 states have call successors, (0), 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:29:39,005 INFO L185 Difference]: Start difference. First operand has 28 places, 17 transitions, 81 flow. Second operand 9 states and 974 transitions. [2021-03-26 00:29:39,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 26 transitions, 153 flow [2021-03-26 00:29:39,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 26 transitions, 153 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 00:29:39,008 INFO L241 Difference]: Finished difference. Result has 40 places, 14 transitions, 78 flow [2021-03-26 00:29:39,008 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=78, PETRI_PLACES=40, PETRI_TRANSITIONS=14} [2021-03-26 00:29:39,008 INFO L343 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2021-03-26 00:29:39,009 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:29:39,009 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 14 transitions, 78 flow [2021-03-26 00:29:39,009 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 14 transitions, 78 flow [2021-03-26 00:29:39,009 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 14 transitions, 78 flow [2021-03-26 00:29:39,013 INFO L129 PetriNetUnfolder]: 1/14 cut-off events. [2021-03-26 00:29:39,014 INFO L130 PetriNetUnfolder]: For 13/14 co-relation queries the response was YES. [2021-03-26 00:29:39,014 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 14 events. 1/14 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 5 event pairs, 0 based on Foata normal form. 1/15 useless extension candidates. Maximal degree in co-relation 35. Up to 4 conditions per place. [2021-03-26 00:29:39,014 INFO L142 LiptonReduction]: Number of co-enabled transitions 10 [2021-03-26 00:29:39,804 WARN L205 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 177 [2021-03-26 00:29:40,068 WARN L205 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-03-26 00:29:41,351 WARN L205 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 00:29:41,909 WARN L205 SmtUtils]: Spent 554.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 00:29:42,025 INFO L154 LiptonReduction]: Checked pairs total: 16 [2021-03-26 00:29:42,025 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:29:42,026 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3017 [2021-03-26 00:29:42,026 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 12 transitions, 74 flow [2021-03-26 00:29:42,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 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:29:42,027 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:29:42,027 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:29:42,027 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:29:42,027 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:29:42,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:29:42,028 INFO L82 PathProgramCache]: Analyzing trace with hash 2066473393, now seen corresponding path program 2 times [2021-03-26 00:29:42,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:29:42,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712393106] [2021-03-26 00:29:42,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:29:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:29:42,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:42,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:29:42,092 INFO L142 QuantifierPusher]: treesize reduction 10, result has 60.0 percent of original size [2021-03-26 00:29:42,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 00:29:42,102 INFO L142 QuantifierPusher]: treesize reduction 26, result has 54.4 percent of original size [2021-03-26 00:29:42,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 00:29:42,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:42,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:29:42,125 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:29:42,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712393106] [2021-03-26 00:29:42,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:29:42,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:29:42,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090843654] [2021-03-26 00:29:42,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:29:42,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:29:42,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:29:42,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:29:42,128 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 160 [2021-03-26 00:29:42,128 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 12 transitions, 74 flow. Second operand has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 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:29:42,129 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:29:42,129 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 160 [2021-03-26 00:29:42,129 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:29:42,176 INFO L129 PetriNetUnfolder]: 2/18 cut-off events. [2021-03-26 00:29:42,176 INFO L130 PetriNetUnfolder]: For 55/57 co-relation queries the response was YES. [2021-03-26 00:29:42,176 INFO L84 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 18 events. 2/18 cut-off events. For 55/57 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 22 event pairs, 0 based on Foata normal form. 3/21 useless extension candidates. Maximal degree in co-relation 55. Up to 6 conditions per place. [2021-03-26 00:29:42,176 INFO L132 encePairwiseOnDemand]: 156/160 looper letters, 3 selfloop transitions, 2 changer transitions 2/14 dead transitions. [2021-03-26 00:29:42,176 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 14 transitions, 102 flow [2021-03-26 00:29:42,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:29:42,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:29:42,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2021-03-26 00:29:42,178 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.72875 [2021-03-26 00:29:42,178 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 583 transitions. [2021-03-26 00:29:42,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 583 transitions. [2021-03-26 00:29:42,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:29:42,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 583 transitions. [2021-03-26 00:29:42,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 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:29:42,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 160.0) internal successors, (960), 6 states have internal predecessors, (960), 0 states have call successors, (0), 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:29:42,182 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 160.0) internal successors, (960), 6 states have internal predecessors, (960), 0 states have call successors, (0), 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:29:42,182 INFO L185 Difference]: Start difference. First operand has 32 places, 12 transitions, 74 flow. Second operand 5 states and 583 transitions. [2021-03-26 00:29:42,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 14 transitions, 102 flow [2021-03-26 00:29:42,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 14 transitions, 74 flow, removed 7 selfloop flow, removed 9 redundant places. [2021-03-26 00:29:42,183 INFO L241 Difference]: Finished difference. Result has 29 places, 12 transitions, 63 flow [2021-03-26 00:29:42,184 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=63, PETRI_PLACES=29, PETRI_TRANSITIONS=12} [2021-03-26 00:29:42,184 INFO L343 CegarLoopForPetriNet]: 38 programPoint places, -9 predicate places. [2021-03-26 00:29:42,184 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:29:42,184 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 12 transitions, 63 flow [2021-03-26 00:29:42,184 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 12 transitions, 63 flow [2021-03-26 00:29:42,184 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 27 places, 12 transitions, 63 flow [2021-03-26 00:29:42,187 INFO L129 PetriNetUnfolder]: 1/12 cut-off events. [2021-03-26 00:29:42,187 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-03-26 00:29:42,187 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 12 events. 1/12 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 3 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 29. Up to 4 conditions per place. [2021-03-26 00:29:42,187 INFO L142 LiptonReduction]: Number of co-enabled transitions 2 [2021-03-26 00:29:42,488 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-03-26 00:29:42,776 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-03-26 00:29:43,380 WARN L205 SmtUtils]: Spent 600.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 00:29:43,950 WARN L205 SmtUtils]: Spent 568.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 00:29:44,117 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-03-26 00:29:44,514 WARN L205 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 90 [2021-03-26 00:29:44,662 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-26 00:29:44,834 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-03-26 00:29:45,227 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 87 [2021-03-26 00:29:45,347 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 00:29:45,349 INFO L154 LiptonReduction]: Checked pairs total: 3 [2021-03-26 00:29:45,349 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:29:45,349 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3165 [2021-03-26 00:29:45,350 INFO L480 AbstractCegarLoop]: Abstraction has has 26 places, 11 transitions, 69 flow [2021-03-26 00:29:45,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 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:29:45,350 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:29:45,350 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:29:45,350 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:29:45,351 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:29:45,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:29:45,351 INFO L82 PathProgramCache]: Analyzing trace with hash -234236969, now seen corresponding path program 1 times [2021-03-26 00:29:45,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:29:45,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715204306] [2021-03-26 00:29:45,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:29:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:29:45,378 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:29:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:29:45,424 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:29:45,449 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:29:45,449 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:29:45,449 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:29:45,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:29:45 BasicIcfg [2021-03-26 00:29:45,523 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:29:45,524 INFO L168 Benchmark]: Toolchain (without parser) took 16146.75 ms. Allocated memory was 352.3 MB in the beginning and 541.1 MB in the end (delta: 188.7 MB). Free memory was 315.2 MB in the beginning and 370.9 MB in the end (delta: -55.6 MB). Peak memory consumption was 134.4 MB. Max. memory is 16.0 GB. [2021-03-26 00:29:45,524 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 352.3 MB. Free memory is still 333.5 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:29:45,524 INFO L168 Benchmark]: CACSL2BoogieTranslator took 541.38 ms. Allocated memory is still 352.3 MB. Free memory was 314.9 MB in the beginning and 312.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:29:45,524 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.00 ms. Allocated memory is still 352.3 MB. Free memory was 312.1 MB in the beginning and 309.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:29:45,525 INFO L168 Benchmark]: Boogie Preprocessor took 29.75 ms. Allocated memory is still 352.3 MB. Free memory was 309.0 MB in the beginning and 307.9 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:29:45,525 INFO L168 Benchmark]: RCFGBuilder took 1543.54 ms. Allocated memory is still 352.3 MB. Free memory was 306.9 MB in the beginning and 296.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 150.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:29:45,525 INFO L168 Benchmark]: TraceAbstraction took 13981.90 ms. Allocated memory was 352.3 MB in the beginning and 541.1 MB in the end (delta: 188.7 MB). Free memory was 296.1 MB in the beginning and 370.9 MB in the end (delta: -74.7 MB). Peak memory consumption was 115.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:29:45,526 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.46 ms. Allocated memory is still 352.3 MB. Free memory is still 333.5 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 541.38 ms. Allocated memory is still 352.3 MB. Free memory was 314.9 MB in the beginning and 312.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 43.00 ms. Allocated memory is still 352.3 MB. Free memory was 312.1 MB in the beginning and 309.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 29.75 ms. Allocated memory is still 352.3 MB. Free memory was 309.0 MB in the beginning and 307.9 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 1543.54 ms. Allocated memory is still 352.3 MB. Free memory was 306.9 MB in the beginning and 296.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 150.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 13981.90 ms. Allocated memory was 352.3 MB in the beginning and 541.1 MB in the end (delta: 188.7 MB). Free memory was 296.1 MB in the beginning and 370.9 MB in the end (delta: -74.7 MB). Peak memory consumption was 115.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2576.8ms, 87 PlacesBefore, 38 PlacesAfterwards, 82 TransitionsBefore, 32 TransitionsAfterwards, 968 CoEnabledTransitionPairs, 5 FixpointIterations, 27 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 58 TotalNumberOfCompositions, 1372 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 815, positive: 770, positive conditional: 770, positive unconditional: 0, negative: 45, negative conditional: 45, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 600, positive: 578, positive conditional: 0, positive unconditional: 578, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 600, positive: 578, positive conditional: 0, positive unconditional: 578, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 600, positive: 571, positive conditional: 0, positive unconditional: 571, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 29, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 333, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 317, negative conditional: 0, negative unconditional: 317, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 815, positive: 192, positive conditional: 192, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 600, unknown conditional: 600, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 55, Positive conditional cache size: 55, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1326.7ms, 37 PlacesBefore, 25 PlacesAfterwards, 30 TransitionsBefore, 18 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 625 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 268, positive: 212, positive conditional: 212, positive unconditional: 0, negative: 56, negative conditional: 56, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 106, positive: 93, positive conditional: 14, positive unconditional: 79, negative: 13, negative conditional: 1, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 106, positive: 93, positive conditional: 14, positive unconditional: 79, negative: 13, negative conditional: 1, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 106, positive: 91, positive conditional: 0, positive unconditional: 91, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 13, negative conditional: 1, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 240, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 231, negative conditional: 41, negative unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 268, positive: 119, positive conditional: 119, positive unconditional: 0, negative: 43, negative conditional: 43, negative unconditional: 0, unknown: 106, unknown conditional: 106, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 46, Positive conditional cache size: 46, Positive unconditional cache size: 0, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 920.8ms, 28 PlacesBefore, 22 PlacesAfterwards, 15 TransitionsBefore, 14 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 170 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 76, positive: 52, positive conditional: 52, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 12, positive conditional: 7, positive unconditional: 5, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 12, positive conditional: 7, positive unconditional: 5, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 4, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 76, positive: 40, positive conditional: 40, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 58, Positive conditional cache size: 58, Positive unconditional cache size: 0, Negative cache size: 14, Negative conditional cache size: 14, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 58.5ms, 27 PlacesBefore, 25 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 64 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 55 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 31, positive: 23, positive conditional: 23, 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: 17, positive: 15, positive conditional: 6, positive unconditional: 9, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 15, positive conditional: 6, positive unconditional: 9, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 52, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 31, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 73, Positive conditional cache size: 73, Positive unconditional cache size: 0, Negative cache size: 16, Negative conditional cache size: 16, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 923.6ms, 30 PlacesBefore, 26 PlacesAfterwards, 16 TransitionsBefore, 14 TransitionsAfterwards, 34 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 108 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 72, positive: 45, positive conditional: 45, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 72, positive: 40, positive conditional: 40, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 56, Positive conditional cache size: 56, Positive unconditional cache size: 0, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 143.2ms, 28 PlacesBefore, 28 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 32 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 22 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 136, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 136, negative conditional: 136, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 57, Positive conditional cache size: 57, Positive unconditional cache size: 0, Negative cache size: 14, Negative conditional cache size: 14, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3016.5ms, 40 PlacesBefore, 32 PlacesAfterwards, 14 TransitionsBefore, 12 TransitionsAfterwards, 10 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 16 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 4, positive conditional: 2, positive unconditional: 2, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 4, positive conditional: 2, positive unconditional: 2, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 112, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 112, negative conditional: 0, negative unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 20, Positive conditional cache size: 20, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3165.0ms, 29 PlacesBefore, 26 PlacesAfterwards, 12 TransitionsBefore, 11 TransitionsAfterwards, 2 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 3 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, 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: 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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 3, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - CounterExampleResult [Line: 19]: 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_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L815] 0 pthread_t t1663; [L816] FCALL, FORK 0 pthread_create(&t1663, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1664; [L818] FCALL, FORK 0 pthread_create(&t1664, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L773] 2 y$w_buff1 = y$w_buff0 [L774] 2 y$w_buff0 = 1 [L775] 2 y$w_buff1_used = y$w_buff0_used [L776] 2 y$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L778] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L779] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L780] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L781] 2 y$r_buff0_thd2 = (_Bool)1 [L784] 2 z = 1 [L787] 2 __unbuffered_p1_EAX = z [L790] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 x = 1 [L748] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L749] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L750] 1 y$flush_delayed = weak$$choice2 [L751] 1 y$mem_tmp = y [L752] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L752] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L753] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L753] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0) [L753] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L753] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L754] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L754] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L754] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L754] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L755] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L755] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used) [L755] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L755] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L756] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L756] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L757] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L757] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L757] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L758] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L758] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 __unbuffered_p0_EAX = y [L760] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L760] 1 y = y$flush_delayed ? y$mem_tmp : y [L761] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L793] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L794] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L795] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L797] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 1 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L4] COND FALSE 0 !(!cond) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 83 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 6.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 13785.1ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 511.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2669.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 30 SDtfs, 20 SDslu, 23 SDs, 0 SdLazy, 111 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 152.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 188.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=5, InterpolantAutomatonStates: 38, 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: 26.4ms SsaConstructionTime, 275.5ms SatisfiabilityAnalysisTime, 489.9ms InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 374 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...