/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/rfi001_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:27:00,846 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:27:00,848 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:27:00,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:27:00,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:27:00,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:27:00,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:27:00,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:27:00,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:27:00,900 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:27:00,901 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:27:00,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:27:00,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:27:00,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:27:00,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:27:00,909 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:27:00,911 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:27:00,912 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:27:00,915 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:27:00,920 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:27:00,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:27:00,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:27:00,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:27:00,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:27:00,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:27:00,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:27:00,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:27:00,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:27:00,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:27:00,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:27:00,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:27:00,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:27:00,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:27:00,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:27:00,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:27:00,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:27:00,937 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:27:00,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:27:00,938 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:27:00,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:27:00,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:27:00,942 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:27:00,974 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:27:00,974 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:27:00,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:27:00,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:27:00,979 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:27:00,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:27:00,979 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:27:00,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:27:00,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:27:00,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:27:00,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:27:00,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:27:00,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:27:00,980 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:27:00,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:27:00,981 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:27:00,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:27:00,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:27:00,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:27:00,981 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:27:00,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:27:00,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:27:00,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:27:00,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:27:00,982 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:27:00,982 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:27:00,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:27:00,982 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:27:00,982 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:27:00,982 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:27:00,982 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:27:01,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:27:01,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:27:01,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:27:01,324 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:27:01,326 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:27:01,327 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_tso.opt.i [2021-03-26 00:27:01,384 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b6683732/e7c4d188c8fe4964a48e88655feddc9f/FLAGc2f9aeb6f [2021-03-26 00:27:01,907 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:27:01,907 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_tso.opt.i [2021-03-26 00:27:01,917 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b6683732/e7c4d188c8fe4964a48e88655feddc9f/FLAGc2f9aeb6f [2021-03-26 00:27:02,366 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b6683732/e7c4d188c8fe4964a48e88655feddc9f [2021-03-26 00:27:02,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:27:02,369 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:27:02,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:27:02,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:27:02,376 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:27:02,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:27:02" (1/1) ... [2021-03-26 00:27:02,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1680b338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:27:02, skipping insertion in model container [2021-03-26 00:27:02,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:27:02" (1/1) ... [2021-03-26 00:27:02,383 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:27:02,435 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:27:02,552 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/rfi001_tso.opt.i[948,961] [2021-03-26 00:27:02,762 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:27:02,770 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:27:02,782 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/rfi001_tso.opt.i[948,961] [2021-03-26 00:27:02,816 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:27:02,874 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:27:02,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:27:02 WrapperNode [2021-03-26 00:27:02,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:27:02,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:27:02,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:27:02,877 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:27:02,882 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:27:02" (1/1) ... [2021-03-26 00:27:02,911 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:27:02" (1/1) ... [2021-03-26 00:27:02,946 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:27:02,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:27:02,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:27:02,947 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:27:02,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:27:02" (1/1) ... [2021-03-26 00:27:02,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:27:02" (1/1) ... [2021-03-26 00:27:02,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:27:02" (1/1) ... [2021-03-26 00:27:02,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:27:02" (1/1) ... [2021-03-26 00:27:02,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:27:02" (1/1) ... [2021-03-26 00:27:02,972 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:27:02" (1/1) ... [2021-03-26 00:27:02,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:27:02" (1/1) ... [2021-03-26 00:27:02,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:27:02,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:27:02,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:27:02,994 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:27:02,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:27:02" (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:27:03,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:27:03,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:27:03,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:27:03,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:27:03,076 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:27:03,076 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:27:03,076 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:27:03,076 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:27:03,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:27:03,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:27:03,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:27:03,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:27:03,078 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:27:04,691 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:27:04,692 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:27:04,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:27:04 BoogieIcfgContainer [2021-03-26 00:27:04,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:27:04,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:27:04,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:27:04,698 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:27:04,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:27:02" (1/3) ... [2021-03-26 00:27:04,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ebd9e5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:27:04, skipping insertion in model container [2021-03-26 00:27:04,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:27:02" (2/3) ... [2021-03-26 00:27:04,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ebd9e5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:27:04, skipping insertion in model container [2021-03-26 00:27:04,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:27:04" (3/3) ... [2021-03-26 00:27:04,701 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi001_tso.opt.i [2021-03-26 00:27:04,706 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:27:04,710 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:27:04,711 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:27:04,740 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,740 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,740 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,740 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,740 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,741 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,741 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,744 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,744 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,745 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,745 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,745 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,746 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,746 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,746 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,751 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,751 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,751 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,757 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,757 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:27:04,758 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:27:04,773 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-26 00:27:04,794 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:27:04,794 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:27:04,794 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:27:04,794 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:27:04,794 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:27:04,795 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:27:04,795 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:27:04,795 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:27:04,803 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 84 transitions, 178 flow [2021-03-26 00:27:04,825 INFO L129 PetriNetUnfolder]: 2/82 cut-off events. [2021-03-26 00:27:04,825 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:27:04,828 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 54 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-03-26 00:27:04,829 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 84 transitions, 178 flow [2021-03-26 00:27:04,832 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 82 transitions, 170 flow [2021-03-26 00:27:04,833 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:27:04,842 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 82 transitions, 170 flow [2021-03-26 00:27:04,845 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 82 transitions, 170 flow [2021-03-26 00:27:04,846 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 82 transitions, 170 flow [2021-03-26 00:27:04,857 INFO L129 PetriNetUnfolder]: 2/82 cut-off events. [2021-03-26 00:27:04,857 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:27:04,857 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 52 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-03-26 00:27:04,859 INFO L142 LiptonReduction]: Number of co-enabled transitions 1046 [2021-03-26 00:27:05,847 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:27:06,228 WARN L205 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:27:06,344 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:27:07,675 WARN L205 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2021-03-26 00:27:08,299 WARN L205 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 183 [2021-03-26 00:27:09,749 WARN L205 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 310 DAG size of output: 265 [2021-03-26 00:27:10,318 WARN L205 SmtUtils]: Spent 567.00 ms on a formula simplification that was a NOOP. DAG size: 262 [2021-03-26 00:27:10,619 INFO L154 LiptonReduction]: Checked pairs total: 1715 [2021-03-26 00:27:10,619 INFO L156 LiptonReduction]: Total number of compositions: 56 [2021-03-26 00:27:10,621 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5789 [2021-03-26 00:27:10,631 INFO L129 PetriNetUnfolder]: 0/16 cut-off events. [2021-03-26 00:27:10,631 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:27:10,631 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:27:10,632 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:27:10,632 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:27:10,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:27:10,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1574192890, now seen corresponding path program 1 times [2021-03-26 00:27:10,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:27:10,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35393133] [2021-03-26 00:27:10,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:27:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:27:10,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:27:10,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:27:10,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:27:10,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:27:10,834 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:27:10,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35393133] [2021-03-26 00:27:10,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:27:10,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:27:10,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680212010] [2021-03-26 00:27:10,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:27:10,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:27:10,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:27:10,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:27:10,851 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 140 [2021-03-26 00:27:10,855 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 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:27:10,855 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:27:10,855 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 140 [2021-03-26 00:27:10,856 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:27:10,908 INFO L129 PetriNetUnfolder]: 16/87 cut-off events. [2021-03-26 00:27:10,908 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:27:10,909 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 87 events. 16/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 288 event pairs, 6 based on Foata normal form. 6/86 useless extension candidates. Maximal degree in co-relation 112. Up to 27 conditions per place. [2021-03-26 00:27:10,910 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 7 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2021-03-26 00:27:10,910 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 33 transitions, 90 flow [2021-03-26 00:27:10,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:27:10,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:27:10,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2021-03-26 00:27:10,923 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8785714285714286 [2021-03-26 00:27:10,923 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2021-03-26 00:27:10,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2021-03-26 00:27:10,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:27:10,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2021-03-26 00:27:10,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 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:27:10,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 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:27:10,943 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 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:27:10,944 INFO L185 Difference]: Start difference. First operand has 39 places, 33 transitions, 72 flow. Second operand 3 states and 369 transitions. [2021-03-26 00:27:10,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 33 transitions, 90 flow [2021-03-26 00:27:10,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:27:10,947 INFO L241 Difference]: Finished difference. Result has 37 places, 30 transitions, 68 flow [2021-03-26 00:27:10,948 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, 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:27:10,948 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2021-03-26 00:27:10,948 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:27:10,948 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 68 flow [2021-03-26 00:27:10,949 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 68 flow [2021-03-26 00:27:10,950 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 68 flow [2021-03-26 00:27:10,958 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2021-03-26 00:27:10,958 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:27:10,958 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 3. Compared 25 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:27:10,958 INFO L142 LiptonReduction]: Number of co-enabled transitions 218 [2021-03-26 00:27:11,424 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 00:27:11,668 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 00:27:12,165 WARN L205 SmtUtils]: Spent 495.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 00:27:12,706 WARN L205 SmtUtils]: Spent 539.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 00:27:13,596 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 194 [2021-03-26 00:27:13,858 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 194 [2021-03-26 00:27:14,470 WARN L205 SmtUtils]: Spent 610.00 ms on a formula simplification that was a NOOP. DAG size: 276 [2021-03-26 00:27:15,039 WARN L205 SmtUtils]: Spent 546.00 ms on a formula simplification that was a NOOP. DAG size: 276 [2021-03-26 00:27:15,563 INFO L154 LiptonReduction]: Checked pairs total: 651 [2021-03-26 00:27:15,563 INFO L156 LiptonReduction]: Total number of compositions: 13 [2021-03-26 00:27:15,563 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4615 [2021-03-26 00:27:15,564 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 44 flow [2021-03-26 00:27:15,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 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:27:15,565 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:27:15,565 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:27:15,565 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:27:15,565 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:27:15,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:27:15,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1071371314, now seen corresponding path program 1 times [2021-03-26 00:27:15,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:27:15,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775683038] [2021-03-26 00:27:15,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:27:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:27:15,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:27:15,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:27:15,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:27:15,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:27:15,709 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:27:15,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:27:15,712 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:27:15,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775683038] [2021-03-26 00:27:15,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:27:15,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:27:15,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665640819] [2021-03-26 00:27:15,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:27:15,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:27:15,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:27:15,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:27:15,718 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 153 [2021-03-26 00:27:15,719 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 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:27:15,719 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:27:15,719 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 153 [2021-03-26 00:27:15,719 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:27:15,746 INFO L129 PetriNetUnfolder]: 1/21 cut-off events. [2021-03-26 00:27:15,747 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:27:15,747 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 5. Compared 34 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 26. Up to 3 conditions per place. [2021-03-26 00:27:15,748 INFO L132 encePairwiseOnDemand]: 149/153 looper letters, 1 selfloop transitions, 2 changer transitions 4/20 dead transitions. [2021-03-26 00:27:15,748 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 20 transitions, 60 flow [2021-03-26 00:27:15,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:27:15,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:27:15,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 642 transitions. [2021-03-26 00:27:15,750 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8392156862745098 [2021-03-26 00:27:15,750 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 642 transitions. [2021-03-26 00:27:15,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 642 transitions. [2021-03-26 00:27:15,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:27:15,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 642 transitions. [2021-03-26 00:27:15,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:27:15,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 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:27:15,758 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 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:27:15,758 INFO L185 Difference]: Start difference. First operand has 25 places, 18 transitions, 44 flow. Second operand 5 states and 642 transitions. [2021-03-26 00:27:15,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 20 transitions, 60 flow [2021-03-26 00:27:15,759 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:27:15,759 INFO L241 Difference]: Finished difference. Result has 28 places, 16 transitions, 44 flow [2021-03-26 00:27:15,759 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, 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=44, PETRI_PLACES=28, PETRI_TRANSITIONS=16} [2021-03-26 00:27:15,760 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -11 predicate places. [2021-03-26 00:27:15,760 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:27:15,760 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 16 transitions, 44 flow [2021-03-26 00:27:15,760 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 16 transitions, 44 flow [2021-03-26 00:27:15,760 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 24 places, 16 transitions, 44 flow [2021-03-26 00:27:15,762 INFO L129 PetriNetUnfolder]: 0/16 cut-off events. [2021-03-26 00:27:15,763 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:27:15,763 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:27:15,763 INFO L142 LiptonReduction]: Number of co-enabled transitions 92 [2021-03-26 00:27:16,209 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-03-26 00:27:16,322 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-26 00:27:16,558 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-03-26 00:27:16,663 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-26 00:27:16,713 INFO L154 LiptonReduction]: Checked pairs total: 222 [2021-03-26 00:27:16,714 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:27:16,714 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 954 [2021-03-26 00:27:16,715 INFO L480 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 42 flow [2021-03-26 00:27:16,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 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:27:16,715 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:27:16,715 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:27:16,715 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:27:16,715 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:27:16,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:27:16,716 INFO L82 PathProgramCache]: Analyzing trace with hash -211704109, now seen corresponding path program 1 times [2021-03-26 00:27:16,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:27:16,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839868146] [2021-03-26 00:27:16,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:27:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:27:16,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:27:16,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:27:16,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:27:16,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:27:16,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:27:16,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:27:16,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:27:16,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:27:16,894 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:27:16,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839868146] [2021-03-26 00:27:16,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:27:16,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:27:16,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948255852] [2021-03-26 00:27:16,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:27:16,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:27:16,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:27:16,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:27:16,895 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 154 [2021-03-26 00:27:16,896 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 42 flow. Second operand has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 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:27:16,896 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:27:16,896 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 154 [2021-03-26 00:27:16,896 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:27:16,950 INFO L129 PetriNetUnfolder]: 21/62 cut-off events. [2021-03-26 00:27:16,950 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-26 00:27:16,951 INFO L84 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 62 events. 21/62 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 188 event pairs, 13 based on Foata normal form. 1/63 useless extension candidates. Maximal degree in co-relation 122. Up to 40 conditions per place. [2021-03-26 00:27:16,951 INFO L132 encePairwiseOnDemand]: 149/154 looper letters, 8 selfloop transitions, 5 changer transitions 0/21 dead transitions. [2021-03-26 00:27:16,951 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 21 transitions, 80 flow [2021-03-26 00:27:16,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:27:16,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:27:16,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions. [2021-03-26 00:27:16,953 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.775974025974026 [2021-03-26 00:27:16,953 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 478 transitions. [2021-03-26 00:27:16,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 478 transitions. [2021-03-26 00:27:16,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:27:16,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 478 transitions. [2021-03-26 00:27:16,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 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:27:16,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 154.0) internal successors, (770), 5 states have internal predecessors, (770), 0 states have call successors, (0), 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:27:16,956 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 154.0) internal successors, (770), 5 states have internal predecessors, (770), 0 states have call successors, (0), 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:27:16,956 INFO L185 Difference]: Start difference. First operand has 23 places, 15 transitions, 42 flow. Second operand 4 states and 478 transitions. [2021-03-26 00:27:16,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 21 transitions, 80 flow [2021-03-26 00:27:16,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:27:16,957 INFO L241 Difference]: Finished difference. Result has 26 places, 19 transitions, 70 flow [2021-03-26 00:27:16,957 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2021-03-26 00:27:16,957 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -13 predicate places. [2021-03-26 00:27:16,957 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:27:16,957 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 19 transitions, 70 flow [2021-03-26 00:27:16,971 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 19 transitions, 70 flow [2021-03-26 00:27:16,972 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 19 transitions, 70 flow [2021-03-26 00:27:16,975 INFO L129 PetriNetUnfolder]: 3/24 cut-off events. [2021-03-26 00:27:16,975 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-26 00:27:16,976 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 24 events. 3/24 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 1 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 44. Up to 8 conditions per place. [2021-03-26 00:27:16,976 INFO L142 LiptonReduction]: Number of co-enabled transitions 102 [2021-03-26 00:27:17,042 INFO L154 LiptonReduction]: Checked pairs total: 115 [2021-03-26 00:27:17,042 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:27:17,042 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 85 [2021-03-26 00:27:17,043 INFO L480 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 70 flow [2021-03-26 00:27:17,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 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:27:17,043 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:27:17,043 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:27:17,044 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:27:17,044 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:27:17,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:27:17,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1079174078, now seen corresponding path program 1 times [2021-03-26 00:27:17,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:27:17,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568782434] [2021-03-26 00:27:17,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:27:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:27:17,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:27:17,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:27:17,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:27:17,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:27:17,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:27:17,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:27:17,122 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:27:17,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568782434] [2021-03-26 00:27:17,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:27:17,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:27:17,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756918640] [2021-03-26 00:27:17,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:27:17,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:27:17,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:27:17,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:27:17,124 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 154 [2021-03-26 00:27:17,124 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 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:27:17,124 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:27:17,124 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 154 [2021-03-26 00:27:17,125 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:27:17,150 INFO L129 PetriNetUnfolder]: 10/45 cut-off events. [2021-03-26 00:27:17,150 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-26 00:27:17,150 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 45 events. 10/45 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 4 based on Foata normal form. 5/48 useless extension candidates. Maximal degree in co-relation 93. Up to 19 conditions per place. [2021-03-26 00:27:17,150 INFO L132 encePairwiseOnDemand]: 149/154 looper letters, 4 selfloop transitions, 5 changer transitions 3/26 dead transitions. [2021-03-26 00:27:17,150 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 26 transitions, 108 flow [2021-03-26 00:27:17,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:27:17,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:27:17,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2021-03-26 00:27:17,153 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8493506493506493 [2021-03-26 00:27:17,153 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2021-03-26 00:27:17,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2021-03-26 00:27:17,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:27:17,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2021-03-26 00:27:17,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 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:27:17,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 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:27:17,156 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 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:27:17,156 INFO L185 Difference]: Start difference. First operand has 26 places, 19 transitions, 70 flow. Second operand 5 states and 654 transitions. [2021-03-26 00:27:17,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 26 transitions, 108 flow [2021-03-26 00:27:17,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 108 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 00:27:17,200 INFO L241 Difference]: Finished difference. Result has 33 places, 23 transitions, 107 flow [2021-03-26 00:27:17,201 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2021-03-26 00:27:17,201 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -6 predicate places. [2021-03-26 00:27:17,201 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:27:17,201 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 23 transitions, 107 flow [2021-03-26 00:27:17,201 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 23 transitions, 107 flow [2021-03-26 00:27:17,201 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 107 flow [2021-03-26 00:27:17,206 INFO L129 PetriNetUnfolder]: 6/40 cut-off events. [2021-03-26 00:27:17,206 INFO L130 PetriNetUnfolder]: For 17/18 co-relation queries the response was YES. [2021-03-26 00:27:17,206 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 40 events. 6/40 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 102 event pairs, 2 based on Foata normal form. 1/40 useless extension candidates. Maximal degree in co-relation 97. Up to 12 conditions per place. [2021-03-26 00:27:17,206 INFO L142 LiptonReduction]: Number of co-enabled transitions 106 [2021-03-26 00:27:17,207 INFO L154 LiptonReduction]: Checked pairs total: 102 [2021-03-26 00:27:17,207 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:27:17,208 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-03-26 00:27:17,208 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 107 flow [2021-03-26 00:27:17,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 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:27:17,209 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:27:17,209 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:27:17,209 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:27:17,209 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:27:17,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:27:17,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1386146829, now seen corresponding path program 1 times [2021-03-26 00:27:17,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:27:17,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880783601] [2021-03-26 00:27:17,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:27:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:27:17,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:27:17,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:27:17,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:27:17,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:27:17,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:27:17,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:27:17,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:27:17,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:27:17,267 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:27:17,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880783601] [2021-03-26 00:27:17,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:27:17,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:27:17,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40295941] [2021-03-26 00:27:17,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:27:17,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:27:17,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:27:17,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:27:17,268 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 154 [2021-03-26 00:27:17,269 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 107 flow. Second operand has 5 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:27:17,269 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:27:17,269 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 154 [2021-03-26 00:27:17,269 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:27:17,302 INFO L129 PetriNetUnfolder]: 4/32 cut-off events. [2021-03-26 00:27:17,302 INFO L130 PetriNetUnfolder]: For 32/45 co-relation queries the response was YES. [2021-03-26 00:27:17,302 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 32 events. 4/32 cut-off events. For 32/45 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 64 event pairs, 0 based on Foata normal form. 17/49 useless extension candidates. Maximal degree in co-relation 89. Up to 12 conditions per place. [2021-03-26 00:27:17,302 INFO L132 encePairwiseOnDemand]: 149/154 looper letters, 2 selfloop transitions, 8 changer transitions 2/26 dead transitions. [2021-03-26 00:27:17,303 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 26 transitions, 145 flow [2021-03-26 00:27:17,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:27:17,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:27:17,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 910 transitions. [2021-03-26 00:27:17,305 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8441558441558441 [2021-03-26 00:27:17,305 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 910 transitions. [2021-03-26 00:27:17,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 910 transitions. [2021-03-26 00:27:17,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:27:17,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 910 transitions. [2021-03-26 00:27:17,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 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:27:17,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 154.0) internal successors, (1232), 8 states have internal predecessors, (1232), 0 states have call successors, (0), 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:27:17,309 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 154.0) internal successors, (1232), 8 states have internal predecessors, (1232), 0 states have call successors, (0), 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:27:17,309 INFO L185 Difference]: Start difference. First operand has 33 places, 23 transitions, 107 flow. Second operand 7 states and 910 transitions. [2021-03-26 00:27:17,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 26 transitions, 145 flow [2021-03-26 00:27:17,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 26 transitions, 139 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 00:27:17,310 INFO L241 Difference]: Finished difference. Result has 41 places, 24 transitions, 134 flow [2021-03-26 00:27:17,310 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=134, PETRI_PLACES=41, PETRI_TRANSITIONS=24} [2021-03-26 00:27:17,311 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2021-03-26 00:27:17,311 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:27:17,311 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 24 transitions, 134 flow [2021-03-26 00:27:17,311 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 24 transitions, 134 flow [2021-03-26 00:27:17,311 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 24 transitions, 134 flow [2021-03-26 00:27:17,314 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-26 00:27:17,315 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-03-26 00:27:17,315 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 31 events. 3/31 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 89. Up to 12 conditions per place. [2021-03-26 00:27:17,315 INFO L142 LiptonReduction]: Number of co-enabled transitions 80 [2021-03-26 00:27:17,547 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:27:17,653 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:27:18,190 WARN L205 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 191 [2021-03-26 00:27:18,394 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-03-26 00:27:19,594 WARN L205 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 345 DAG size of output: 267 [2021-03-26 00:27:20,039 WARN L205 SmtUtils]: Spent 435.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2021-03-26 00:27:20,059 INFO L154 LiptonReduction]: Checked pairs total: 173 [2021-03-26 00:27:20,059 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 00:27:20,059 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2748 [2021-03-26 00:27:20,061 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 20 transitions, 114 flow [2021-03-26 00:27:20,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 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:27:20,063 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:27:20,063 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:27:20,063 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:27:20,064 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:27:20,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:27:20,064 INFO L82 PathProgramCache]: Analyzing trace with hash -412169668, now seen corresponding path program 1 times [2021-03-26 00:27:20,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:27:20,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750859532] [2021-03-26 00:27:20,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:27:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:27:20,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:27:20,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:27:20,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:27:20,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:27:20,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:27:20,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:27:20,204 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:27:20,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750859532] [2021-03-26 00:27:20,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:27:20,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:27:20,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072866435] [2021-03-26 00:27:20,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:27:20,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:27:20,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:27:20,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:27:20,205 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 156 [2021-03-26 00:27:20,206 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 20 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 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:27:20,206 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:27:20,206 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 156 [2021-03-26 00:27:20,206 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:27:20,235 INFO L129 PetriNetUnfolder]: 5/33 cut-off events. [2021-03-26 00:27:20,235 INFO L130 PetriNetUnfolder]: For 71/72 co-relation queries the response was YES. [2021-03-26 00:27:20,235 INFO L84 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 33 events. 5/33 cut-off events. For 71/72 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 2/35 useless extension candidates. Maximal degree in co-relation 94. Up to 10 conditions per place. [2021-03-26 00:27:20,235 INFO L132 encePairwiseOnDemand]: 153/156 looper letters, 3 selfloop transitions, 1 changer transitions 3/20 dead transitions. [2021-03-26 00:27:20,235 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 20 transitions, 117 flow [2021-03-26 00:27:20,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:27:20,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:27:20,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2021-03-26 00:27:20,237 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8237179487179487 [2021-03-26 00:27:20,237 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2021-03-26 00:27:20,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2021-03-26 00:27:20,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:27:20,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2021-03-26 00:27:20,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 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:27:20,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 156.0) internal successors, (780), 5 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:27:20,239 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 156.0) internal successors, (780), 5 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:27:20,239 INFO L185 Difference]: Start difference. First operand has 38 places, 20 transitions, 114 flow. Second operand 4 states and 514 transitions. [2021-03-26 00:27:20,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 20 transitions, 117 flow [2021-03-26 00:27:20,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 20 transitions, 94 flow, removed 7 selfloop flow, removed 7 redundant places. [2021-03-26 00:27:20,240 INFO L241 Difference]: Finished difference. Result has 32 places, 17 transitions, 80 flow [2021-03-26 00:27:20,240 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=32, PETRI_TRANSITIONS=17} [2021-03-26 00:27:20,240 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -7 predicate places. [2021-03-26 00:27:20,240 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:27:20,241 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 17 transitions, 80 flow [2021-03-26 00:27:20,241 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 17 transitions, 80 flow [2021-03-26 00:27:20,241 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 17 transitions, 80 flow [2021-03-26 00:27:20,243 INFO L129 PetriNetUnfolder]: 2/22 cut-off events. [2021-03-26 00:27:20,243 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-03-26 00:27:20,243 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 22 events. 2/22 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 50. Up to 6 conditions per place. [2021-03-26 00:27:20,243 INFO L142 LiptonReduction]: Number of co-enabled transitions 18 [2021-03-26 00:27:20,430 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2021-03-26 00:27:20,792 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2021-03-26 00:27:20,949 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-03-26 00:27:21,229 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 87 [2021-03-26 00:27:21,406 INFO L154 LiptonReduction]: Checked pairs total: 21 [2021-03-26 00:27:21,407 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 00:27:21,407 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1167 [2021-03-26 00:27:21,407 INFO L480 AbstractCegarLoop]: Abstraction has has 29 places, 15 transitions, 83 flow [2021-03-26 00:27:21,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 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:27:21,408 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:27:21,408 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:27:21,408 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:27:21,408 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:27:21,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:27:21,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1823325194, now seen corresponding path program 1 times [2021-03-26 00:27:21,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:27:21,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952987950] [2021-03-26 00:27:21,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:27:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:27:21,427 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:27:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:27:21,447 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:27:21,484 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:27:21,484 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:27:21,484 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:27:21,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:27:21 BasicIcfg [2021-03-26 00:27:21,538 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:27:21,539 INFO L168 Benchmark]: Toolchain (without parser) took 19169.17 ms. Allocated memory was 325.1 MB in the beginning and 683.7 MB in the end (delta: 358.6 MB). Free memory was 287.9 MB in the beginning and 481.0 MB in the end (delta: -193.1 MB). Peak memory consumption was 165.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:27:21,539 INFO L168 Benchmark]: CDTParser took 0.59 ms. Allocated memory is still 325.1 MB. Free memory is still 306.2 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:27:21,539 INFO L168 Benchmark]: CACSL2BoogieTranslator took 503.29 ms. Allocated memory is still 325.1 MB. Free memory was 287.7 MB in the beginning and 284.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. [2021-03-26 00:27:21,539 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.65 ms. Allocated memory is still 325.1 MB. Free memory was 284.8 MB in the beginning and 281.7 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:27:21,540 INFO L168 Benchmark]: Boogie Preprocessor took 46.25 ms. Allocated memory is still 325.1 MB. Free memory was 281.7 MB in the beginning and 279.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:27:21,540 INFO L168 Benchmark]: RCFGBuilder took 1701.06 ms. Allocated memory is still 325.1 MB. Free memory was 279.6 MB in the beginning and 262.7 MB in the end (delta: 16.9 MB). Peak memory consumption was 163.4 MB. Max. memory is 16.0 GB. [2021-03-26 00:27:21,540 INFO L168 Benchmark]: TraceAbstraction took 16841.94 ms. Allocated memory was 325.1 MB in the beginning and 683.7 MB in the end (delta: 358.6 MB). Free memory was 262.7 MB in the beginning and 481.0 MB in the end (delta: -218.3 MB). Peak memory consumption was 139.7 MB. Max. memory is 16.0 GB. [2021-03-26 00:27:21,547 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.59 ms. Allocated memory is still 325.1 MB. Free memory is still 306.2 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 503.29 ms. Allocated memory is still 325.1 MB. Free memory was 287.7 MB in the beginning and 284.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 69.65 ms. Allocated memory is still 325.1 MB. Free memory was 284.8 MB in the beginning and 281.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 46.25 ms. Allocated memory is still 325.1 MB. Free memory was 281.7 MB in the beginning and 279.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1701.06 ms. Allocated memory is still 325.1 MB. Free memory was 279.6 MB in the beginning and 262.7 MB in the end (delta: 16.9 MB). Peak memory consumption was 163.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 16841.94 ms. Allocated memory was 325.1 MB in the beginning and 683.7 MB in the end (delta: 358.6 MB). Free memory was 262.7 MB in the beginning and 481.0 MB in the end (delta: -218.3 MB). Peak memory consumption was 139.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5774.5ms, 87 PlacesBefore, 39 PlacesAfterwards, 82 TransitionsBefore, 33 TransitionsAfterwards, 1046 CoEnabledTransitionPairs, 4 FixpointIterations, 26 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 56 TotalNumberOfCompositions, 1715 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 857, positive: 803, positive conditional: 803, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 697, positive: 663, positive conditional: 0, positive unconditional: 663, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 697, positive: 663, positive conditional: 0, positive unconditional: 663, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 697, positive: 661, positive conditional: 0, positive unconditional: 661, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 36, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 558, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 552, negative conditional: 0, negative unconditional: 552, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 857, positive: 140, positive conditional: 140, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 697, unknown conditional: 697, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 52, Positive conditional cache size: 52, Positive unconditional cache size: 0, Negative cache size: 19, Negative conditional cache size: 19, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4613.8ms, 37 PlacesBefore, 25 PlacesAfterwards, 30 TransitionsBefore, 18 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 651 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 283, positive: 228, positive conditional: 228, positive unconditional: 0, negative: 55, negative conditional: 55, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 97, positive: 83, positive conditional: 11, positive unconditional: 72, negative: 14, negative conditional: 4, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 97, positive: 83, positive conditional: 11, positive unconditional: 72, negative: 14, negative conditional: 4, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 97, positive: 82, positive conditional: 0, positive unconditional: 82, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 14, negative conditional: 4, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 239, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 212, negative conditional: 62, negative unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 283, positive: 145, positive conditional: 145, positive unconditional: 0, negative: 41, negative conditional: 41, negative unconditional: 0, unknown: 97, unknown conditional: 97, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 51, Positive conditional cache size: 51, Positive unconditional cache size: 0, Negative cache size: 15, Negative conditional cache size: 15, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 953.4ms, 28 PlacesBefore, 23 PlacesAfterwards, 16 TransitionsBefore, 15 TransitionsAfterwards, 92 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 222 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 96, positive: 68, positive conditional: 68, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 8, negative conditional: 1, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 8, negative conditional: 1, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 1, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 239, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 239, negative conditional: 3, negative unconditional: 236, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 96, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 58, Positive conditional cache size: 58, Positive unconditional cache size: 0, Negative cache size: 23, Negative conditional cache size: 23, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 70.6ms, 26 PlacesBefore, 26 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 115 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 42, positive: 29, positive conditional: 29, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 4, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 4, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 66, Positive conditional cache size: 66, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.4ms, 33 PlacesBefore, 33 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 102 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 24, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 66, Positive conditional cache size: 66, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2748.0ms, 41 PlacesBefore, 38 PlacesAfterwards, 24 TransitionsBefore, 20 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 173 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 73, positive: 49, positive conditional: 49, 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: 17, positive: 17, positive conditional: 17, 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: 17, positive: 17, positive conditional: 17, 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: 17, positive: 17, positive conditional: 0, positive unconditional: 17, 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: 73, positive: 32, positive conditional: 32, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 44, Positive conditional cache size: 44, Positive unconditional cache size: 0, Negative cache size: 15, Negative conditional cache size: 15, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1166.0ms, 32 PlacesBefore, 29 PlacesAfterwards, 17 TransitionsBefore, 15 TransitionsAfterwards, 18 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 21 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 7, positive conditional: 5, positive unconditional: 2, 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: 8, positive: 7, positive conditional: 5, positive unconditional: 2, 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: 8, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 32, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 10, Positive conditional cache size: 10, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1615; [L803] FCALL, FORK 0 pthread_create(&t1615, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L804] 0 pthread_t t1616; [L805] FCALL, FORK 0 pthread_create(&t1616, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L760] 2 y$w_buff1 = y$w_buff0 [L761] 2 y$w_buff0 = 2 [L762] 2 y$w_buff1_used = y$w_buff0_used [L763] 2 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=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=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L771] 2 z = 1 [L774] 2 __unbuffered_p1_EAX = z [L777] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 x = 1 VAL [__unbuffered_cnt=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=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 y = 1 VAL [__unbuffered_cnt=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=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L746] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L746] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L747] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L748] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L749] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L750] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L780] 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) [L780] 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) [L781] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L782] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L782] 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 [L783] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L783] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L784] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L784] 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 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L811] 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) [L811] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L811] 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) [L811] 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) [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 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 [L814] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L815] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L815] 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 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L823] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L823] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L824] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L824] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L825] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L825] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L826] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L826] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L827] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L827] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L827] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L828] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L828] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, 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: 4.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 16693.3ms, OverallIterations: 7, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 364.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5831.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 19 SDtfs, 9 SDslu, 8 SDs, 0 SdLazy, 65 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 86.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 70.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=5, InterpolantAutomatonStates: 28, 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.8ms SsaConstructionTime, 331.4ms SatisfiabilityAnalysisTime, 360.5ms InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 262 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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...