/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:41:15,815 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:41:15,817 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:41:15,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:41:15,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:41:15,842 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:41:15,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:41:15,845 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:41:15,847 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:41:15,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:41:15,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:41:15,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:41:15,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:41:15,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:41:15,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:41:15,853 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:41:15,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:41:15,856 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:41:15,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:41:15,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:41:15,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:41:15,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:41:15,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:41:15,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:41:15,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:41:15,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:41:15,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:41:15,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:41:15,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:41:15,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:41:15,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:41:15,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:41:15,877 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:41:15,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:41:15,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:41:15,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:41:15,879 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:41:15,879 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:41:15,880 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:41:15,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:41:15,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:41:15,885 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:41:15,924 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:41:15,924 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:41:15,927 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:41:15,928 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:41:15,928 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:41:15,928 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:41:15,928 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:41:15,928 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:41:15,928 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:41:15,928 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:41:15,929 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:41:15,929 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:41:15,929 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:41:15,930 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:41:15,930 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:41:15,930 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:41:15,930 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:41:15,930 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:41:15,930 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:41:15,930 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:41:15,931 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:41:15,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:41:15,931 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:41:15,931 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:41:15,931 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:41:15,932 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:41:15,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:41:15,932 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:41:15,932 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:41:15,932 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:41:15,932 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 10:41:16,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:41:16,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:41:16,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:41:16,260 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:41:16,261 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:41:16,262 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.oepc.i [2021-03-26 10:41:16,335 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f19fe8178/c2d35c91f3864902af397ee52a04eef0/FLAG9e27751dd [2021-03-26 10:41:16,867 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:41:16,868 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_pso.oepc.i [2021-03-26 10:41:16,881 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f19fe8178/c2d35c91f3864902af397ee52a04eef0/FLAG9e27751dd [2021-03-26 10:41:17,298 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f19fe8178/c2d35c91f3864902af397ee52a04eef0 [2021-03-26 10:41:17,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:41:17,301 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:41:17,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:41:17,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:41:17,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:41:17,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:41:17" (1/1) ... [2021-03-26 10:41:17,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d9c1660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:41:17, skipping insertion in model container [2021-03-26 10:41:17,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:41:17" (1/1) ... [2021-03-26 10:41:17,316 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:41:17,360 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:41:17,469 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/safe030_pso.oepc.i[950,963] [2021-03-26 10:41:17,751 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:41:17,762 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:41:17,775 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/safe030_pso.oepc.i[950,963] [2021-03-26 10:41:17,818 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:41:17,880 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:41:17,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:41:17 WrapperNode [2021-03-26 10:41:17,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:41:17,883 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:41:17,884 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:41:17,884 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:41:17,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:41:17" (1/1) ... [2021-03-26 10:41:17,923 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:41:17" (1/1) ... [2021-03-26 10:41:17,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:41:17,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:41:17,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:41:17,962 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:41:17,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:41:17" (1/1) ... [2021-03-26 10:41:17,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:41:17" (1/1) ... [2021-03-26 10:41:17,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:41:17" (1/1) ... [2021-03-26 10:41:17,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:41:17" (1/1) ... [2021-03-26 10:41:17,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:41:17" (1/1) ... [2021-03-26 10:41:18,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:41:17" (1/1) ... [2021-03-26 10:41:18,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:41:17" (1/1) ... [2021-03-26 10:41:18,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:41:18,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:41:18,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:41:18,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:41:18,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:41:17" (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 10:41:18,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:41:18,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:41:18,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:41:18,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:41:18,082 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:41:18,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:41:18,083 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:41:18,083 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:41:18,083 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:41:18,083 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:41:18,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:41:18,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:41:18,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:41:18,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:41:18,085 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 10:41:19,870 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:41:19,870 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:41:19,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:41:19 BoogieIcfgContainer [2021-03-26 10:41:19,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:41:19,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:41:19,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:41:19,877 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:41:19,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:41:17" (1/3) ... [2021-03-26 10:41:19,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8b9e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:41:19, skipping insertion in model container [2021-03-26 10:41:19,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:41:17" (2/3) ... [2021-03-26 10:41:19,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8b9e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:41:19, skipping insertion in model container [2021-03-26 10:41:19,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:41:19" (3/3) ... [2021-03-26 10:41:19,879 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_pso.oepc.i [2021-03-26 10:41:19,885 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:41:19,889 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:41:19,890 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:41:19,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,922 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,922 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,922 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,922 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,922 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,922 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,922 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,922 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,922 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,923 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,923 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,923 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,927 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,928 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,928 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,928 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,928 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,931 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,931 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,932 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,932 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,933 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,933 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,933 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,934 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,934 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,934 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,934 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,934 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,934 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,934 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,938 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,938 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,942 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,946 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,951 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,951 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,952 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,954 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,954 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,954 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:19,955 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:41:19,971 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 10:41:19,997 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:41:19,997 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:41:19,997 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:41:19,997 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:41:19,997 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:41:19,997 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:41:19,997 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:41:19,997 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:41:20,013 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 207 flow [2021-03-26 10:41:20,053 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2021-03-26 10:41:20,054 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:41:20,064 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 10:41:20,065 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 96 transitions, 207 flow [2021-03-26 10:41:20,073 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 93 transitions, 195 flow [2021-03-26 10:41:20,075 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:20,085 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 93 transitions, 195 flow [2021-03-26 10:41:20,087 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 93 transitions, 195 flow [2021-03-26 10:41:20,088 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 195 flow [2021-03-26 10:41:20,105 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2021-03-26 10:41:20,105 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:41:20,105 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 10:41:20,108 INFO L142 LiptonReduction]: Number of co-enabled transitions 1694 [2021-03-26 10:41:21,918 WARN L205 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2021-03-26 10:41:22,231 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-03-26 10:41:23,626 WARN L205 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-03-26 10:41:24,214 WARN L205 SmtUtils]: Spent 585.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 10:41:24,548 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:41:24,936 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2021-03-26 10:41:25,054 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 10:41:26,154 WARN L205 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 10:41:26,462 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 10:41:27,098 WARN L205 SmtUtils]: Spent 633.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 10:41:27,734 WARN L205 SmtUtils]: Spent 634.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 10:41:28,256 INFO L154 LiptonReduction]: Checked pairs total: 3269 [2021-03-26 10:41:28,256 INFO L156 LiptonReduction]: Total number of compositions: 66 [2021-03-26 10:41:28,258 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8184 [2021-03-26 10:41:28,267 INFO L129 PetriNetUnfolder]: 0/13 cut-off events. [2021-03-26 10:41:28,267 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:41:28,267 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:28,268 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:28,268 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:28,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:28,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1228534299, now seen corresponding path program 1 times [2021-03-26 10:41:28,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:28,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625329535] [2021-03-26 10:41:28,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:28,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:28,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:41:28,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:28,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:41:28,501 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 10:41:28,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625329535] [2021-03-26 10:41:28,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:28,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:41:28,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558392781] [2021-03-26 10:41:28,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:41:28,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:28,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:41:28,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:41:28,521 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 162 [2021-03-26 10:41:28,524 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states 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 10:41:28,524 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:28,524 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 162 [2021-03-26 10:41:28,525 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:28,621 INFO L129 PetriNetUnfolder]: 69/177 cut-off events. [2021-03-26 10:41:28,622 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:41:28,624 INFO L84 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 177 events. 69/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 787 event pairs, 54 based on Foata normal form. 11/169 useless extension candidates. Maximal degree in co-relation 285. Up to 89 conditions per place. [2021-03-26 10:41:28,626 INFO L132 encePairwiseOnDemand]: 158/162 looper letters, 9 selfloop transitions, 2 changer transitions 3/40 dead transitions. [2021-03-26 10:41:28,626 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 115 flow [2021-03-26 10:41:28,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:41:28,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:41:28,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2021-03-26 10:41:28,645 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8786008230452675 [2021-03-26 10:41:28,645 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 427 transitions. [2021-03-26 10:41:28,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions. [2021-03-26 10:41:28,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:28,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions. [2021-03-26 10:41:28,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states 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 10:41:28,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states 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 10:41:28,664 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states 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 10:41:28,666 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 427 transitions. [2021-03-26 10:41:28,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 115 flow [2021-03-26 10:41:28,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 112 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 10:41:28,670 INFO L241 Difference]: Finished difference. Result has 44 places, 33 transitions, 76 flow [2021-03-26 10:41:28,671 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2021-03-26 10:41:28,672 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2021-03-26 10:41:28,672 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:28,672 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 33 transitions, 76 flow [2021-03-26 10:41:28,673 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 76 flow [2021-03-26 10:41:28,674 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 76 flow [2021-03-26 10:41:28,683 INFO L129 PetriNetUnfolder]: 0/33 cut-off events. [2021-03-26 10:41:28,684 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:41:28,684 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 33 events. 0/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 39 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:41:28,685 INFO L142 LiptonReduction]: Number of co-enabled transitions 264 [2021-03-26 10:41:29,322 WARN L205 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 10:41:29,611 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 10:41:30,274 WARN L205 SmtUtils]: Spent 660.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-26 10:41:30,885 WARN L205 SmtUtils]: Spent 609.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-26 10:41:31,318 INFO L154 LiptonReduction]: Checked pairs total: 1218 [2021-03-26 10:41:31,318 INFO L156 LiptonReduction]: Total number of compositions: 9 [2021-03-26 10:41:31,319 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2647 [2021-03-26 10:41:31,320 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-26 10:41:31,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states 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 10:41:31,320 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:31,320 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:31,321 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:41:31,321 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:31,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:31,321 INFO L82 PathProgramCache]: Analyzing trace with hash 666798904, now seen corresponding path program 1 times [2021-03-26 10:41:31,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:31,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133173188] [2021-03-26 10:41:31,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:31,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:31,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:41:31,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:31,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:41:31,451 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:41:31,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:41:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:41:31,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133173188] [2021-03-26 10:41:31,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:31,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:41:31,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022906445] [2021-03-26 10:41:31,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:41:31,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:31,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:41:31,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:41:31,458 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 171 [2021-03-26 10:41:31,459 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states 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 10:41:31,459 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:31,459 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 171 [2021-03-26 10:41:31,459 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:31,475 INFO L129 PetriNetUnfolder]: 3/36 cut-off events. [2021-03-26 10:41:31,475 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:41:31,476 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 36 events. 3/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 1 based on Foata normal form. 1/35 useless extension candidates. Maximal degree in co-relation 46. Up to 10 conditions per place. [2021-03-26 10:41:31,476 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 3 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2021-03-26 10:41:31,476 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 26 transitions, 74 flow [2021-03-26 10:41:31,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:41:31,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:41:31,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2021-03-26 10:41:31,478 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8732943469785575 [2021-03-26 10:41:31,478 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 448 transitions. [2021-03-26 10:41:31,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions. [2021-03-26 10:41:31,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:31,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions. [2021-03-26 10:41:31,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states 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 10:41:31,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states 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 10:41:31,481 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states 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 10:41:31,481 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 3 states and 448 transitions. [2021-03-26 10:41:31,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 26 transitions, 74 flow [2021-03-26 10:41:31,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 26 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:41:31,483 INFO L241 Difference]: Finished difference. Result has 34 places, 26 transitions, 73 flow [2021-03-26 10:41:31,483 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2021-03-26 10:41:31,483 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -13 predicate places. [2021-03-26 10:41:31,483 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:31,484 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 26 transitions, 73 flow [2021-03-26 10:41:31,484 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 26 transitions, 73 flow [2021-03-26 10:41:31,484 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 26 transitions, 73 flow [2021-03-26 10:41:31,489 INFO L129 PetriNetUnfolder]: 3/36 cut-off events. [2021-03-26 10:41:31,489 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:41:31,489 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 36 events. 3/36 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 70 event pairs, 1 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 47. Up to 10 conditions per place. [2021-03-26 10:41:31,490 INFO L142 LiptonReduction]: Number of co-enabled transitions 262 [2021-03-26 10:41:31,993 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-03-26 10:41:32,115 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-26 10:41:32,409 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-03-26 10:41:32,535 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-26 10:41:32,538 INFO L154 LiptonReduction]: Checked pairs total: 804 [2021-03-26 10:41:32,539 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:41:32,539 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1056 [2021-03-26 10:41:32,540 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 69 flow [2021-03-26 10:41:32,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states 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 10:41:32,540 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:32,541 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:32,541 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:41:32,541 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:32,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:32,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1655839146, now seen corresponding path program 1 times [2021-03-26 10:41:32,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:32,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702277295] [2021-03-26 10:41:32,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:32,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:32,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:41:32,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:41:32,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702277295] [2021-03-26 10:41:32,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:32,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:41:32,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586120430] [2021-03-26 10:41:32,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:41:32,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:32,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:41:32,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:41:32,628 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 173 [2021-03-26 10:41:32,628 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states 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 10:41:32,628 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:32,629 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 173 [2021-03-26 10:41:32,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:32,650 INFO L129 PetriNetUnfolder]: 10/56 cut-off events. [2021-03-26 10:41:32,650 INFO L130 PetriNetUnfolder]: For 8/14 co-relation queries the response was YES. [2021-03-26 10:41:32,652 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 56 events. 10/56 cut-off events. For 8/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 176 event pairs, 3 based on Foata normal form. 1/51 useless extension candidates. Maximal degree in co-relation 93. Up to 19 conditions per place. [2021-03-26 10:41:32,652 INFO L132 encePairwiseOnDemand]: 169/173 looper letters, 3 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2021-03-26 10:41:32,652 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 26 transitions, 85 flow [2021-03-26 10:41:32,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:41:32,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:41:32,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2021-03-26 10:41:32,654 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8863198458574181 [2021-03-26 10:41:32,654 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2021-03-26 10:41:32,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2021-03-26 10:41:32,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:32,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2021-03-26 10:41:32,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states 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 10:41:32,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states 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 10:41:32,657 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states 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 10:41:32,657 INFO L185 Difference]: Start difference. First operand has 32 places, 24 transitions, 69 flow. Second operand 3 states and 460 transitions. [2021-03-26 10:41:32,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 26 transitions, 85 flow [2021-03-26 10:41:32,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 26 transitions, 82 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:41:32,659 INFO L241 Difference]: Finished difference. Result has 34 places, 26 transitions, 85 flow [2021-03-26 10:41:32,659 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2021-03-26 10:41:32,659 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -13 predicate places. [2021-03-26 10:41:32,660 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:32,660 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 26 transitions, 85 flow [2021-03-26 10:41:32,660 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 26 transitions, 85 flow [2021-03-26 10:41:32,661 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 26 transitions, 85 flow [2021-03-26 10:41:32,668 INFO L129 PetriNetUnfolder]: 7/47 cut-off events. [2021-03-26 10:41:32,668 INFO L130 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2021-03-26 10:41:32,669 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 47 events. 7/47 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 157 event pairs, 3 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 78. Up to 15 conditions per place. [2021-03-26 10:41:32,671 INFO L142 LiptonReduction]: Number of co-enabled transitions 292 [2021-03-26 10:41:32,673 INFO L154 LiptonReduction]: Checked pairs total: 198 [2021-03-26 10:41:32,673 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:41:32,673 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13 [2021-03-26 10:41:32,676 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 85 flow [2021-03-26 10:41:32,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states 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 10:41:32,679 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:32,680 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:32,680 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:41:32,680 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:32,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:32,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1447535624, now seen corresponding path program 1 times [2021-03-26 10:41:32,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:32,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960170808] [2021-03-26 10:41:32,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:32,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:32,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:41:32,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:32,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:41:32,785 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 10:41:32,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960170808] [2021-03-26 10:41:32,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:32,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:41:32,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495610486] [2021-03-26 10:41:32,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:41:32,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:32,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:41:32,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:41:32,788 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 173 [2021-03-26 10:41:32,788 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states 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 10:41:32,788 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:32,788 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 173 [2021-03-26 10:41:32,788 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:32,807 INFO L129 PetriNetUnfolder]: 4/54 cut-off events. [2021-03-26 10:41:32,807 INFO L130 PetriNetUnfolder]: For 26/49 co-relation queries the response was YES. [2021-03-26 10:41:32,807 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 54 events. 4/54 cut-off events. For 26/49 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 1 based on Foata normal form. 3/53 useless extension candidates. Maximal degree in co-relation 98. Up to 15 conditions per place. [2021-03-26 10:41:32,808 INFO L132 encePairwiseOnDemand]: 170/173 looper letters, 3 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2021-03-26 10:41:32,808 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 26 transitions, 97 flow [2021-03-26 10:41:32,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:41:32,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:41:32,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2021-03-26 10:41:32,810 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.884393063583815 [2021-03-26 10:41:32,810 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2021-03-26 10:41:32,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2021-03-26 10:41:32,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:32,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2021-03-26 10:41:32,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states 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 10:41:32,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states 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 10:41:32,813 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states 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 10:41:32,813 INFO L185 Difference]: Start difference. First operand has 34 places, 26 transitions, 85 flow. Second operand 3 states and 459 transitions. [2021-03-26 10:41:32,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 26 transitions, 97 flow [2021-03-26 10:41:32,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 26 transitions, 94 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:41:32,815 INFO L241 Difference]: Finished difference. Result has 36 places, 26 transitions, 93 flow [2021-03-26 10:41:32,815 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2021-03-26 10:41:32,815 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -11 predicate places. [2021-03-26 10:41:32,815 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:32,815 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 26 transitions, 93 flow [2021-03-26 10:41:32,816 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 26 transitions, 93 flow [2021-03-26 10:41:32,818 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 26 transitions, 93 flow [2021-03-26 10:41:32,827 INFO L129 PetriNetUnfolder]: 4/47 cut-off events. [2021-03-26 10:41:32,827 INFO L130 PetriNetUnfolder]: For 19/22 co-relation queries the response was YES. [2021-03-26 10:41:32,827 INFO L84 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 47 events. 4/47 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 154 event pairs, 2 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 81. Up to 13 conditions per place. [2021-03-26 10:41:32,828 INFO L142 LiptonReduction]: Number of co-enabled transitions 292 [2021-03-26 10:41:32,951 INFO L154 LiptonReduction]: Checked pairs total: 242 [2021-03-26 10:41:32,952 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:41:32,952 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 137 [2021-03-26 10:41:32,957 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 93 flow [2021-03-26 10:41:32,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states 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 10:41:32,957 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:32,957 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:32,958 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:41:32,958 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:32,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:32,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1206949951, now seen corresponding path program 1 times [2021-03-26 10:41:32,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:32,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868762811] [2021-03-26 10:41:32,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:33,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:33,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:41:33,097 INFO L142 QuantifierPusher]: treesize reduction 22, result has 55.1 percent of original size [2021-03-26 10:41:33,099 INFO L147 QuantifierPusher]: treesize reduction 6, result has 77.8 percent of original size 21 [2021-03-26 10:41:33,115 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 10:41:33,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868762811] [2021-03-26 10:41:33,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:33,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:41:33,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86333564] [2021-03-26 10:41:33,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:41:33,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:33,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:41:33,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:41:33,120 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 173 [2021-03-26 10:41:33,121 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:41:33,121 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:33,121 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 173 [2021-03-26 10:41:33,121 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:33,218 INFO L129 PetriNetUnfolder]: 154/347 cut-off events. [2021-03-26 10:41:33,219 INFO L130 PetriNetUnfolder]: For 226/257 co-relation queries the response was YES. [2021-03-26 10:41:33,220 INFO L84 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 347 events. 154/347 cut-off events. For 226/257 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1843 event pairs, 51 based on Foata normal form. 14/337 useless extension candidates. Maximal degree in co-relation 741. Up to 238 conditions per place. [2021-03-26 10:41:33,221 INFO L132 encePairwiseOnDemand]: 166/173 looper letters, 11 selfloop transitions, 7 changer transitions 0/36 dead transitions. [2021-03-26 10:41:33,222 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 36 transitions, 149 flow [2021-03-26 10:41:33,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:41:33,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:41:33,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 544 transitions. [2021-03-26 10:41:33,224 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7861271676300579 [2021-03-26 10:41:33,224 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 544 transitions. [2021-03-26 10:41:33,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 544 transitions. [2021-03-26 10:41:33,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:33,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 544 transitions. [2021-03-26 10:41:33,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states 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 10:41:33,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states 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 10:41:33,228 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states 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 10:41:33,228 INFO L185 Difference]: Start difference. First operand has 36 places, 26 transitions, 93 flow. Second operand 4 states and 544 transitions. [2021-03-26 10:41:33,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 36 transitions, 149 flow [2021-03-26 10:41:33,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 144 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 10:41:33,231 INFO L241 Difference]: Finished difference. Result has 40 places, 32 transitions, 137 flow [2021-03-26 10:41:33,231 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2021-03-26 10:41:33,231 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -7 predicate places. [2021-03-26 10:41:33,231 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:33,232 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 32 transitions, 137 flow [2021-03-26 10:41:33,232 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 32 transitions, 137 flow [2021-03-26 10:41:33,232 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 32 transitions, 137 flow [2021-03-26 10:41:33,253 INFO L129 PetriNetUnfolder]: 45/160 cut-off events. [2021-03-26 10:41:33,253 INFO L130 PetriNetUnfolder]: For 280/313 co-relation queries the response was YES. [2021-03-26 10:41:33,254 INFO L84 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 160 events. 45/160 cut-off events. For 280/313 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 880 event pairs, 15 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 408. Up to 63 conditions per place. [2021-03-26 10:41:33,255 INFO L142 LiptonReduction]: Number of co-enabled transitions 368 [2021-03-26 10:41:33,273 INFO L154 LiptonReduction]: Checked pairs total: 104 [2021-03-26 10:41:33,273 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:41:33,273 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 42 [2021-03-26 10:41:33,276 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 137 flow [2021-03-26 10:41:33,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:41:33,277 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:33,277 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:33,277 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:41:33,277 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:33,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:33,277 INFO L82 PathProgramCache]: Analyzing trace with hash -947123769, now seen corresponding path program 1 times [2021-03-26 10:41:33,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:33,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367199757] [2021-03-26 10:41:33,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:33,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:33,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:41:33,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:33,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:41:33,352 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 10:41:33,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367199757] [2021-03-26 10:41:33,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:33,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:41:33,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595936754] [2021-03-26 10:41:33,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:41:33,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:33,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:41:33,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:41:33,356 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 173 [2021-03-26 10:41:33,357 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states 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 10:41:33,357 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:33,357 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 173 [2021-03-26 10:41:33,357 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:33,404 INFO L129 PetriNetUnfolder]: 45/196 cut-off events. [2021-03-26 10:41:33,404 INFO L130 PetriNetUnfolder]: For 660/767 co-relation queries the response was YES. [2021-03-26 10:41:33,405 INFO L84 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 196 events. 45/196 cut-off events. For 660/767 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1183 event pairs, 13 based on Foata normal form. 15/195 useless extension candidates. Maximal degree in co-relation 492. Up to 81 conditions per place. [2021-03-26 10:41:33,406 INFO L132 encePairwiseOnDemand]: 170/173 looper letters, 3 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2021-03-26 10:41:33,406 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 32 transitions, 149 flow [2021-03-26 10:41:33,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:41:33,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:41:33,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2021-03-26 10:41:33,408 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.884393063583815 [2021-03-26 10:41:33,408 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2021-03-26 10:41:33,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2021-03-26 10:41:33,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:33,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2021-03-26 10:41:33,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states 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 10:41:33,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states 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 10:41:33,412 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states 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 10:41:33,412 INFO L185 Difference]: Start difference. First operand has 40 places, 32 transitions, 137 flow. Second operand 3 states and 459 transitions. [2021-03-26 10:41:33,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 32 transitions, 149 flow [2021-03-26 10:41:33,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 149 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 10:41:33,416 INFO L241 Difference]: Finished difference. Result has 43 places, 32 transitions, 148 flow [2021-03-26 10:41:33,417 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2021-03-26 10:41:33,417 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2021-03-26 10:41:33,417 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:33,417 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 32 transitions, 148 flow [2021-03-26 10:41:33,417 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 32 transitions, 148 flow [2021-03-26 10:41:33,418 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 32 transitions, 148 flow [2021-03-26 10:41:33,445 INFO L129 PetriNetUnfolder]: 40/200 cut-off events. [2021-03-26 10:41:33,445 INFO L130 PetriNetUnfolder]: For 361/390 co-relation queries the response was YES. [2021-03-26 10:41:33,446 INFO L84 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 200 events. 40/200 cut-off events. For 361/390 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1261 event pairs, 13 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 497. Up to 76 conditions per place. [2021-03-26 10:41:33,448 INFO L142 LiptonReduction]: Number of co-enabled transitions 368 [2021-03-26 10:41:33,456 INFO L154 LiptonReduction]: Checked pairs total: 90 [2021-03-26 10:41:33,457 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:41:33,457 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 40 [2021-03-26 10:41:33,460 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 148 flow [2021-03-26 10:41:33,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states 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 10:41:33,461 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:33,461 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:33,461 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:41:33,461 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:33,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:33,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1693835702, now seen corresponding path program 1 times [2021-03-26 10:41:33,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:33,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089286968] [2021-03-26 10:41:33,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:33,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:33,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:41:33,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:33,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:41:33,586 INFO L142 QuantifierPusher]: treesize reduction 16, result has 46.7 percent of original size [2021-03-26 10:41:33,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:41:33,600 INFO L142 QuantifierPusher]: treesize reduction 16, result has 40.7 percent of original size [2021-03-26 10:41:33,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 10:41:33,610 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 10:41:33,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089286968] [2021-03-26 10:41:33,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:33,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:41:33,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124631641] [2021-03-26 10:41:33,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:41:33,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:33,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:41:33,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:41:33,613 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 173 [2021-03-26 10:41:33,613 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 148 flow. Second operand has 6 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 0 states have call successors, (0), 0 states 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 10:41:33,614 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:33,614 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 173 [2021-03-26 10:41:33,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:33,792 INFO L129 PetriNetUnfolder]: 220/510 cut-off events. [2021-03-26 10:41:33,793 INFO L130 PetriNetUnfolder]: For 694/831 co-relation queries the response was YES. [2021-03-26 10:41:33,794 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1488 conditions, 510 events. 220/510 cut-off events. For 694/831 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3147 event pairs, 97 based on Foata normal form. 13/491 useless extension candidates. Maximal degree in co-relation 1470. Up to 303 conditions per place. [2021-03-26 10:41:33,796 INFO L132 encePairwiseOnDemand]: 165/173 looper letters, 17 selfloop transitions, 16 changer transitions 0/51 dead transitions. [2021-03-26 10:41:33,796 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 51 transitions, 311 flow [2021-03-26 10:41:33,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:41:33,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:41:33,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 663 transitions. [2021-03-26 10:41:33,799 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7664739884393064 [2021-03-26 10:41:33,799 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 663 transitions. [2021-03-26 10:41:33,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 663 transitions. [2021-03-26 10:41:33,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:33,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 663 transitions. [2021-03-26 10:41:33,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states 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 10:41:33,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states 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 10:41:33,803 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states 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 10:41:33,803 INFO L185 Difference]: Start difference. First operand has 43 places, 32 transitions, 148 flow. Second operand 5 states and 663 transitions. [2021-03-26 10:41:33,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 51 transitions, 311 flow [2021-03-26 10:41:33,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 306 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 10:41:33,807 INFO L241 Difference]: Finished difference. Result has 49 places, 44 transitions, 284 flow [2021-03-26 10:41:33,807 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=284, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2021-03-26 10:41:33,807 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2021-03-26 10:41:33,807 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:33,807 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 44 transitions, 284 flow [2021-03-26 10:41:33,808 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 44 transitions, 284 flow [2021-03-26 10:41:33,808 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 44 transitions, 284 flow [2021-03-26 10:41:33,860 INFO L129 PetriNetUnfolder]: 121/388 cut-off events. [2021-03-26 10:41:33,860 INFO L130 PetriNetUnfolder]: For 940/1098 co-relation queries the response was YES. [2021-03-26 10:41:33,862 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1310 conditions, 388 events. 121/388 cut-off events. For 940/1098 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2680 event pairs, 35 based on Foata normal form. 5/363 useless extension candidates. Maximal degree in co-relation 1290. Up to 166 conditions per place. [2021-03-26 10:41:33,866 INFO L142 LiptonReduction]: Number of co-enabled transitions 454 [2021-03-26 10:41:33,889 INFO L154 LiptonReduction]: Checked pairs total: 117 [2021-03-26 10:41:33,890 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:41:33,890 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 83 [2021-03-26 10:41:33,892 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 284 flow [2021-03-26 10:41:33,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 0 states have call successors, (0), 0 states 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 10:41:33,892 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:33,892 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:33,892 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:41:33,893 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:33,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:33,893 INFO L82 PathProgramCache]: Analyzing trace with hash -505625090, now seen corresponding path program 1 times [2021-03-26 10:41:33,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:33,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692798503] [2021-03-26 10:41:33,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:34,010 INFO L142 QuantifierPusher]: treesize reduction 3, result has 97.0 percent of original size [2021-03-26 10:41:34,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 97 [2021-03-26 10:41:34,074 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.0 percent of original size [2021-03-26 10:41:34,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-03-26 10:41:34,122 INFO L142 QuantifierPusher]: treesize reduction 31, result has 65.2 percent of original size [2021-03-26 10:41:34,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 58 [2021-03-26 10:41:34,148 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 10:41:34,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692798503] [2021-03-26 10:41:34,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:34,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:41:34,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880640406] [2021-03-26 10:41:34,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:41:34,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:34,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:41:34,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:41:34,151 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 173 [2021-03-26 10:41:34,152 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 284 flow. Second operand has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states 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 10:41:34,152 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:34,152 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 173 [2021-03-26 10:41:34,152 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:34,317 INFO L129 PetriNetUnfolder]: 215/495 cut-off events. [2021-03-26 10:41:34,317 INFO L130 PetriNetUnfolder]: For 1240/1468 co-relation queries the response was YES. [2021-03-26 10:41:34,319 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1909 conditions, 495 events. 215/495 cut-off events. For 1240/1468 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2984 event pairs, 93 based on Foata normal form. 21/482 useless extension candidates. Maximal degree in co-relation 1887. Up to 353 conditions per place. [2021-03-26 10:41:34,321 INFO L132 encePairwiseOnDemand]: 166/173 looper letters, 16 selfloop transitions, 10 changer transitions 1/45 dead transitions. [2021-03-26 10:41:34,321 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 45 transitions, 331 flow [2021-03-26 10:41:34,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:41:34,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:41:34,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 526 transitions. [2021-03-26 10:41:34,324 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7601156069364162 [2021-03-26 10:41:34,324 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 526 transitions. [2021-03-26 10:41:34,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 526 transitions. [2021-03-26 10:41:34,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:34,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 526 transitions. [2021-03-26 10:41:34,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states 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 10:41:34,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states 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 10:41:34,327 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states 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 10:41:34,327 INFO L185 Difference]: Start difference. First operand has 49 places, 44 transitions, 284 flow. Second operand 4 states and 526 transitions. [2021-03-26 10:41:34,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 45 transitions, 331 flow [2021-03-26 10:41:34,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 320 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 10:41:34,333 INFO L241 Difference]: Finished difference. Result has 52 places, 43 transitions, 285 flow [2021-03-26 10:41:34,333 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=285, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2021-03-26 10:41:34,333 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 5 predicate places. [2021-03-26 10:41:34,333 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:34,333 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 43 transitions, 285 flow [2021-03-26 10:41:34,334 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 43 transitions, 285 flow [2021-03-26 10:41:34,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 43 transitions, 285 flow [2021-03-26 10:41:34,388 INFO L129 PetriNetUnfolder]: 117/371 cut-off events. [2021-03-26 10:41:34,388 INFO L130 PetriNetUnfolder]: For 1153/1284 co-relation queries the response was YES. [2021-03-26 10:41:34,390 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1288 conditions, 371 events. 117/371 cut-off events. For 1153/1284 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2538 event pairs, 32 based on Foata normal form. 12/360 useless extension candidates. Maximal degree in co-relation 1266. Up to 154 conditions per place. [2021-03-26 10:41:34,393 INFO L142 LiptonReduction]: Number of co-enabled transitions 452 [2021-03-26 10:41:34,428 INFO L154 LiptonReduction]: Checked pairs total: 102 [2021-03-26 10:41:34,428 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:41:34,428 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 95 [2021-03-26 10:41:34,428 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 285 flow [2021-03-26 10:41:34,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states 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 10:41:34,429 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:34,429 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:34,429 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:41:34,429 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:34,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:34,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1589169328, now seen corresponding path program 1 times [2021-03-26 10:41:34,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:34,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115107821] [2021-03-26 10:41:34,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:34,526 INFO L142 QuantifierPusher]: treesize reduction 11, result has 79.6 percent of original size [2021-03-26 10:41:34,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-03-26 10:41:34,561 INFO L142 QuantifierPusher]: treesize reduction 11, result has 82.0 percent of original size [2021-03-26 10:41:34,565 INFO L147 QuantifierPusher]: treesize reduction 4, result has 92.0 percent of original size 46 [2021-03-26 10:41:34,609 INFO L142 QuantifierPusher]: treesize reduction 39, result has 53.6 percent of original size [2021-03-26 10:41:34,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 10:41:34,646 INFO L142 QuantifierPusher]: treesize reduction 13, result has 58.1 percent of original size [2021-03-26 10:41:34,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 10:41:34,660 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 10:41:34,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115107821] [2021-03-26 10:41:34,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:34,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:41:34,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003420419] [2021-03-26 10:41:34,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:41:34,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:34,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:41:34,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:41:34,663 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 173 [2021-03-26 10:41:34,663 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 285 flow. Second operand has 6 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 0 states have call successors, (0), 0 states 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 10:41:34,663 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:34,664 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 173 [2021-03-26 10:41:34,664 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:34,850 INFO L129 PetriNetUnfolder]: 206/496 cut-off events. [2021-03-26 10:41:34,851 INFO L130 PetriNetUnfolder]: For 1464/1678 co-relation queries the response was YES. [2021-03-26 10:41:34,853 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1910 conditions, 496 events. 206/496 cut-off events. For 1464/1678 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3115 event pairs, 58 based on Foata normal form. 24/492 useless extension candidates. Maximal degree in co-relation 1886. Up to 305 conditions per place. [2021-03-26 10:41:34,855 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 18 selfloop transitions, 14 changer transitions 0/50 dead transitions. [2021-03-26 10:41:34,855 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 50 transitions, 399 flow [2021-03-26 10:41:34,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:41:34,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:41:34,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 526 transitions. [2021-03-26 10:41:34,857 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7601156069364162 [2021-03-26 10:41:34,857 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 526 transitions. [2021-03-26 10:41:34,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 526 transitions. [2021-03-26 10:41:34,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:34,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 526 transitions. [2021-03-26 10:41:34,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states 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 10:41:34,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states 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 10:41:34,860 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states 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 10:41:34,860 INFO L185 Difference]: Start difference. First operand has 52 places, 43 transitions, 285 flow. Second operand 4 states and 526 transitions. [2021-03-26 10:41:34,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 50 transitions, 399 flow [2021-03-26 10:41:34,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 50 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:41:34,866 INFO L241 Difference]: Finished difference. Result has 55 places, 47 transitions, 364 flow [2021-03-26 10:41:34,866 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=364, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2021-03-26 10:41:34,866 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 8 predicate places. [2021-03-26 10:41:34,866 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:34,866 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 47 transitions, 364 flow [2021-03-26 10:41:34,867 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 47 transitions, 364 flow [2021-03-26 10:41:34,867 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 364 flow [2021-03-26 10:41:34,909 INFO L129 PetriNetUnfolder]: 111/360 cut-off events. [2021-03-26 10:41:34,909 INFO L130 PetriNetUnfolder]: For 1699/1863 co-relation queries the response was YES. [2021-03-26 10:41:34,910 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 360 events. 111/360 cut-off events. For 1699/1863 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2442 event pairs, 29 based on Foata normal form. 13/351 useless extension candidates. Maximal degree in co-relation 1362. Up to 152 conditions per place. [2021-03-26 10:41:34,914 INFO L142 LiptonReduction]: Number of co-enabled transitions 460 [2021-03-26 10:41:34,929 INFO L154 LiptonReduction]: Checked pairs total: 168 [2021-03-26 10:41:34,929 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:41:34,930 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 64 [2021-03-26 10:41:34,930 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 364 flow [2021-03-26 10:41:34,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 0 states have call successors, (0), 0 states 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 10:41:34,931 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:34,931 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:34,931 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:41:34,931 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:34,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:34,931 INFO L82 PathProgramCache]: Analyzing trace with hash 2042755311, now seen corresponding path program 1 times [2021-03-26 10:41:34,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:34,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116789417] [2021-03-26 10:41:34,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:34,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:34,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:41:34,990 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:41:34,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:41:34,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:34,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:41:34,999 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 10:41:34,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116789417] [2021-03-26 10:41:34,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:35,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:41:35,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250041634] [2021-03-26 10:41:35,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:41:35,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:35,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:41:35,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:41:35,001 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 173 [2021-03-26 10:41:35,002 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states 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 10:41:35,002 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:35,002 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 173 [2021-03-26 10:41:35,002 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:35,139 INFO L129 PetriNetUnfolder]: 493/1041 cut-off events. [2021-03-26 10:41:35,140 INFO L130 PetriNetUnfolder]: For 2128/2418 co-relation queries the response was YES. [2021-03-26 10:41:35,144 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2960 conditions, 1041 events. 493/1041 cut-off events. For 2128/2418 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 7448 event pairs, 122 based on Foata normal form. 153/1004 useless extension candidates. Maximal degree in co-relation 2933. Up to 675 conditions per place. [2021-03-26 10:41:35,147 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 11 selfloop transitions, 8 changer transitions 0/56 dead transitions. [2021-03-26 10:41:35,147 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 398 flow [2021-03-26 10:41:35,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:41:35,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:41:35,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 715 transitions. [2021-03-26 10:41:35,150 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8265895953757225 [2021-03-26 10:41:35,150 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 715 transitions. [2021-03-26 10:41:35,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 715 transitions. [2021-03-26 10:41:35,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:35,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 715 transitions. [2021-03-26 10:41:35,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states 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 10:41:35,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states 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 10:41:35,153 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states 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 10:41:35,153 INFO L185 Difference]: Start difference. First operand has 55 places, 47 transitions, 364 flow. Second operand 5 states and 715 transitions. [2021-03-26 10:41:35,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 56 transitions, 398 flow [2021-03-26 10:41:35,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 56 transitions, 386 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-26 10:41:35,158 INFO L241 Difference]: Finished difference. Result has 61 places, 52 transitions, 390 flow [2021-03-26 10:41:35,159 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=390, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2021-03-26 10:41:35,159 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 14 predicate places. [2021-03-26 10:41:35,159 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:35,159 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 52 transitions, 390 flow [2021-03-26 10:41:35,159 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 52 transitions, 390 flow [2021-03-26 10:41:35,160 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 52 transitions, 390 flow [2021-03-26 10:41:35,236 INFO L129 PetriNetUnfolder]: 317/749 cut-off events. [2021-03-26 10:41:35,237 INFO L130 PetriNetUnfolder]: For 2701/2957 co-relation queries the response was YES. [2021-03-26 10:41:35,240 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2806 conditions, 749 events. 317/749 cut-off events. For 2701/2957 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 5345 event pairs, 103 based on Foata normal form. 35/715 useless extension candidates. Maximal degree in co-relation 2777. Up to 409 conditions per place. [2021-03-26 10:41:35,247 INFO L142 LiptonReduction]: Number of co-enabled transitions 552 [2021-03-26 10:41:35,253 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:41:35,253 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:41:35,253 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 94 [2021-03-26 10:41:35,254 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 390 flow [2021-03-26 10:41:35,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states 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 10:41:35,254 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:35,254 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:35,254 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:41:35,254 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:35,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:35,255 INFO L82 PathProgramCache]: Analyzing trace with hash 508307233, now seen corresponding path program 1 times [2021-03-26 10:41:35,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:35,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469759274] [2021-03-26 10:41:35,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:35,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:35,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:41:35,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:35,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:41:35,358 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:41:35,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:41:35,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:35,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:41:35,366 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 10:41:35,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469759274] [2021-03-26 10:41:35,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:35,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:41:35,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932420842] [2021-03-26 10:41:35,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:41:35,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:35,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:41:35,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:41:35,367 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 173 [2021-03-26 10:41:35,370 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 390 flow. Second operand has 5 states, 5 states have (on average 139.8) internal successors, (699), 5 states have internal predecessors, (699), 0 states have call successors, (0), 0 states 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 10:41:35,370 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:35,370 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 173 [2021-03-26 10:41:35,370 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:35,517 INFO L129 PetriNetUnfolder]: 368/830 cut-off events. [2021-03-26 10:41:35,517 INFO L130 PetriNetUnfolder]: For 2040/3445 co-relation queries the response was YES. [2021-03-26 10:41:35,521 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3232 conditions, 830 events. 368/830 cut-off events. For 2040/3445 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 5823 event pairs, 15 based on Foata normal form. 412/1145 useless extension candidates. Maximal degree in co-relation 3201. Up to 536 conditions per place. [2021-03-26 10:41:35,523 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 8 selfloop transitions, 15 changer transitions 3/61 dead transitions. [2021-03-26 10:41:35,523 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 61 transitions, 478 flow [2021-03-26 10:41:35,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:41:35,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:41:35,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1001 transitions. [2021-03-26 10:41:35,526 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8265895953757225 [2021-03-26 10:41:35,526 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1001 transitions. [2021-03-26 10:41:35,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1001 transitions. [2021-03-26 10:41:35,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:35,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1001 transitions. [2021-03-26 10:41:35,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.0) internal successors, (1001), 7 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states 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 10:41:35,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states 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 10:41:35,532 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states 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 10:41:35,532 INFO L185 Difference]: Start difference. First operand has 61 places, 52 transitions, 390 flow. Second operand 7 states and 1001 transitions. [2021-03-26 10:41:35,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 61 transitions, 478 flow [2021-03-26 10:41:35,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 61 transitions, 443 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-03-26 10:41:35,538 INFO L241 Difference]: Finished difference. Result has 66 places, 56 transitions, 428 flow [2021-03-26 10:41:35,538 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=428, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2021-03-26 10:41:35,539 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 19 predicate places. [2021-03-26 10:41:35,539 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:35,539 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 56 transitions, 428 flow [2021-03-26 10:41:35,539 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 56 transitions, 428 flow [2021-03-26 10:41:35,540 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 56 transitions, 428 flow [2021-03-26 10:41:35,595 INFO L129 PetriNetUnfolder]: 201/564 cut-off events. [2021-03-26 10:41:35,595 INFO L130 PetriNetUnfolder]: For 2073/2461 co-relation queries the response was YES. [2021-03-26 10:41:35,598 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2455 conditions, 564 events. 201/564 cut-off events. For 2073/2461 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4087 event pairs, 14 based on Foata normal form. 29/555 useless extension candidates. Maximal degree in co-relation 2424. Up to 348 conditions per place. [2021-03-26 10:41:35,603 INFO L142 LiptonReduction]: Number of co-enabled transitions 600 [2021-03-26 10:41:35,630 INFO L154 LiptonReduction]: Checked pairs total: 47 [2021-03-26 10:41:35,631 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:41:35,631 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 92 [2021-03-26 10:41:35,633 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 412 flow [2021-03-26 10:41:35,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 139.8) internal successors, (699), 5 states have internal predecessors, (699), 0 states have call successors, (0), 0 states 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 10:41:35,634 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:35,634 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:35,634 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:41:35,634 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:35,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:35,634 INFO L82 PathProgramCache]: Analyzing trace with hash 888315043, now seen corresponding path program 1 times [2021-03-26 10:41:35,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:35,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63835234] [2021-03-26 10:41:35,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:35,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:35,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:41:35,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:35,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:41:35,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:35,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:41:35,703 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:41:35,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:41:35,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:35,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:41:35,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 10:41:35,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63835234] [2021-03-26 10:41:35,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:35,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:41:35,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360801730] [2021-03-26 10:41:35,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:41:35,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:35,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:41:35,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:41:35,714 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 173 [2021-03-26 10:41:35,715 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 412 flow. Second operand has 6 states, 6 states have (on average 139.83333333333334) internal successors, (839), 6 states have internal predecessors, (839), 0 states have call successors, (0), 0 states 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 10:41:35,715 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:35,715 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 173 [2021-03-26 10:41:35,715 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:35,822 INFO L129 PetriNetUnfolder]: 230/501 cut-off events. [2021-03-26 10:41:35,822 INFO L130 PetriNetUnfolder]: For 1546/1983 co-relation queries the response was YES. [2021-03-26 10:41:35,825 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2146 conditions, 501 events. 230/501 cut-off events. For 1546/1983 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 2860 event pairs, 0 based on Foata normal form. 87/517 useless extension candidates. Maximal degree in co-relation 2113. Up to 306 conditions per place. [2021-03-26 10:41:35,826 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 4 selfloop transitions, 10 changer transitions 23/55 dead transitions. [2021-03-26 10:41:35,826 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 55 transitions, 431 flow [2021-03-26 10:41:35,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:41:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:41:35,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 995 transitions. [2021-03-26 10:41:35,829 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8216350123864574 [2021-03-26 10:41:35,829 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 995 transitions. [2021-03-26 10:41:35,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 995 transitions. [2021-03-26 10:41:35,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:35,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 995 transitions. [2021-03-26 10:41:35,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 142.14285714285714) internal successors, (995), 7 states have internal predecessors, (995), 0 states have call successors, (0), 0 states 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 10:41:35,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states 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 10:41:35,834 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states 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 10:41:35,834 INFO L185 Difference]: Start difference. First operand has 66 places, 54 transitions, 412 flow. Second operand 7 states and 995 transitions. [2021-03-26 10:41:35,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 55 transitions, 431 flow [2021-03-26 10:41:35,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 55 transitions, 386 flow, removed 16 selfloop flow, removed 5 redundant places. [2021-03-26 10:41:35,842 INFO L241 Difference]: Finished difference. Result has 65 places, 31 transitions, 220 flow [2021-03-26 10:41:35,842 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=220, PETRI_PLACES=65, PETRI_TRANSITIONS=31} [2021-03-26 10:41:35,842 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 18 predicate places. [2021-03-26 10:41:35,842 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:35,842 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 31 transitions, 220 flow [2021-03-26 10:41:35,842 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 31 transitions, 220 flow [2021-03-26 10:41:35,843 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 31 transitions, 220 flow [2021-03-26 10:41:35,848 INFO L129 PetriNetUnfolder]: 9/42 cut-off events. [2021-03-26 10:41:35,848 INFO L130 PetriNetUnfolder]: For 83/100 co-relation queries the response was YES. [2021-03-26 10:41:35,848 INFO L84 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 42 events. 9/42 cut-off events. For 83/100 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 71 event pairs, 0 based on Foata normal form. 1/41 useless extension candidates. Maximal degree in co-relation 148. Up to 12 conditions per place. [2021-03-26 10:41:35,849 INFO L142 LiptonReduction]: Number of co-enabled transitions 174 [2021-03-26 10:41:36,485 WARN L205 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 180 [2021-03-26 10:41:36,693 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2021-03-26 10:41:38,868 WARN L205 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 334 DAG size of output: 260 [2021-03-26 10:41:39,410 WARN L205 SmtUtils]: Spent 539.00 ms on a formula simplification that was a NOOP. DAG size: 240 [2021-03-26 10:41:39,854 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 10:41:40,082 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 10:41:40,633 WARN L205 SmtUtils]: Spent 548.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 10:41:41,182 WARN L205 SmtUtils]: Spent 548.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 10:41:41,187 INFO L154 LiptonReduction]: Checked pairs total: 83 [2021-03-26 10:41:41,187 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 10:41:41,187 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5345 [2021-03-26 10:41:41,188 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 26 transitions, 210 flow [2021-03-26 10:41:41,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 139.83333333333334) internal successors, (839), 6 states have internal predecessors, (839), 0 states have call successors, (0), 0 states 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 10:41:41,188 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:41,188 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:41,188 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:41:41,188 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:41,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:41,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1469680121, now seen corresponding path program 1 times [2021-03-26 10:41:41,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:41,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265098439] [2021-03-26 10:41:41,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:41:41,228 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:41:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:41:41,266 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:41:41,297 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:41:41,297 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:41:41,297 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:41:41,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:41:41 BasicIcfg [2021-03-26 10:41:41,381 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:41:41,381 INFO L168 Benchmark]: Toolchain (without parser) took 24080.11 ms. Allocated memory was 255.9 MB in the beginning and 629.1 MB in the end (delta: 373.3 MB). Free memory was 232.3 MB in the beginning and 245.7 MB in the end (delta: -13.4 MB). Peak memory consumption was 358.6 MB. Max. memory is 16.0 GB. [2021-03-26 10:41:41,381 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:41:41,382 INFO L168 Benchmark]: CACSL2BoogieTranslator took 580.02 ms. Allocated memory was 255.9 MB in the beginning and 362.8 MB in the end (delta: 107.0 MB). Free memory was 232.3 MB in the beginning and 322.7 MB in the end (delta: -90.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. [2021-03-26 10:41:41,382 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.03 ms. Allocated memory is still 362.8 MB. Free memory was 322.7 MB in the beginning and 319.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:41:41,382 INFO L168 Benchmark]: Boogie Preprocessor took 50.34 ms. Allocated memory is still 362.8 MB. Free memory was 319.9 MB in the beginning and 317.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:41:41,382 INFO L168 Benchmark]: RCFGBuilder took 1859.93 ms. Allocated memory is still 362.8 MB. Free memory was 317.8 MB in the beginning and 223.4 MB in the end (delta: 94.5 MB). Peak memory consumption was 95.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:41:41,383 INFO L168 Benchmark]: TraceAbstraction took 21506.64 ms. Allocated memory was 362.8 MB in the beginning and 629.1 MB in the end (delta: 266.3 MB). Free memory was 222.3 MB in the beginning and 245.7 MB in the end (delta: -23.4 MB). Peak memory consumption was 241.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:41:41,384 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.45 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 580.02 ms. Allocated memory was 255.9 MB in the beginning and 362.8 MB in the end (delta: 107.0 MB). Free memory was 232.3 MB in the beginning and 322.7 MB in the end (delta: -90.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 78.03 ms. Allocated memory is still 362.8 MB. Free memory was 322.7 MB in the beginning and 319.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 50.34 ms. Allocated memory is still 362.8 MB. Free memory was 319.9 MB in the beginning and 317.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1859.93 ms. Allocated memory is still 362.8 MB. Free memory was 317.8 MB in the beginning and 223.4 MB in the end (delta: 94.5 MB). Peak memory consumption was 95.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 21506.64 ms. Allocated memory was 362.8 MB in the beginning and 629.1 MB in the end (delta: 266.3 MB). Free memory was 222.3 MB in the beginning and 245.7 MB in the end (delta: -23.4 MB). Peak memory consumption was 241.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8169.6ms, 101 PlacesBefore, 47 PlacesAfterwards, 93 TransitionsBefore, 38 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 6 FixpointIterations, 24 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 66 TotalNumberOfCompositions, 3269 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1829, positive: 1733, positive conditional: 1733, positive unconditional: 0, negative: 96, negative conditional: 96, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1829, positive: 1733, positive conditional: 0, positive unconditional: 1733, negative: 96, negative conditional: 0, negative unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1829, positive: 1733, positive conditional: 0, positive unconditional: 1733, negative: 96, negative conditional: 0, negative unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1330, positive: 1288, positive conditional: 0, positive unconditional: 1288, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1330, positive: 1278, positive conditional: 0, positive unconditional: 1278, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 52, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 725, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 696, negative conditional: 0, negative unconditional: 696, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1829, positive: 445, positive conditional: 0, positive unconditional: 445, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 1330, unknown conditional: 0, unknown unconditional: 1330] , Statistics on independence cache: Total cache size (in pairs): 1330, Positive cache size: 1288, Positive conditional cache size: 0, Positive unconditional cache size: 1288, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2645.0ms, 44 PlacesBefore, 33 PlacesAfterwards, 33 TransitionsBefore, 24 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 1218 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 303, positive: 216, positive conditional: 216, positive unconditional: 0, negative: 87, negative conditional: 87, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 303, positive: 216, positive conditional: 5, positive unconditional: 211, negative: 87, negative conditional: 4, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 303, positive: 216, positive conditional: 5, positive unconditional: 211, negative: 87, negative conditional: 4, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 41, positive: 30, positive conditional: 1, positive unconditional: 29, negative: 11, negative conditional: 1, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 41, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 11, negative conditional: 1, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 164, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 142, negative conditional: 13, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 303, positive: 186, positive conditional: 4, positive unconditional: 182, negative: 76, negative conditional: 3, negative unconditional: 73, unknown: 41, unknown conditional: 2, unknown unconditional: 39] , Statistics on independence cache: Total cache size (in pairs): 1371, Positive cache size: 1318, Positive conditional cache size: 1, Positive unconditional cache size: 1317, Negative cache size: 53, Negative conditional cache size: 1, Negative unconditional cache size: 52, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1054.9ms, 34 PlacesBefore, 32 PlacesAfterwards, 26 TransitionsBefore, 24 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 804 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 210, positive: 156, positive conditional: 156, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 210, positive: 156, positive conditional: 0, positive unconditional: 156, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 210, positive: 156, positive conditional: 0, positive unconditional: 156, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 210, positive: 150, positive conditional: 0, positive unconditional: 150, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 1377, Positive cache size: 1324, Positive conditional cache size: 1, Positive unconditional cache size: 1323, Negative cache size: 53, Negative conditional cache size: 1, Negative unconditional cache size: 52, Eliminated conditions: 36 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.7ms, 34 PlacesBefore, 34 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 198 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, positive: 47, positive conditional: 47, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1382, Positive cache size: 1329, Positive conditional cache size: 1, Positive unconditional cache size: 1328, Negative cache size: 53, Negative conditional cache size: 1, Negative unconditional cache size: 52, Eliminated conditions: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 136.2ms, 36 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 242 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, positive: 25, positive conditional: 25, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 41, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 41, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 7, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 121, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 121, negative conditional: 0, negative unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 41, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 1389, Positive cache size: 1332, Positive conditional cache size: 1, Positive unconditional cache size: 1331, Negative cache size: 57, Negative conditional cache size: 1, Negative unconditional cache size: 56, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 41.1ms, 40 PlacesBefore, 40 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 368 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 104 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 5, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 13, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1394, Positive cache size: 1336, Positive conditional cache size: 1, Positive unconditional cache size: 1335, Negative cache size: 58, Negative conditional cache size: 1, Negative unconditional cache size: 57, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 39.4ms, 43 PlacesBefore, 43 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 368 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 90 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 11, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1394, Positive cache size: 1336, Positive conditional cache size: 1, Positive unconditional cache size: 1335, Negative cache size: 58, Negative conditional cache size: 1, Negative unconditional cache size: 57, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 82.0ms, 49 PlacesBefore, 49 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 117 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, positive: 14, positive conditional: 8, positive unconditional: 6, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, positive: 14, positive conditional: 8, positive unconditional: 6, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, 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: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, positive: 9, positive conditional: 3, positive unconditional: 6, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1399, Positive cache size: 1341, Positive conditional cache size: 6, Positive unconditional cache size: 1335, Negative cache size: 58, Negative conditional cache size: 1, Negative unconditional cache size: 57, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 94.2ms, 52 PlacesBefore, 52 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 452 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 102 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, positive: 15, positive conditional: 7, positive unconditional: 8, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, positive: 15, positive conditional: 7, positive unconditional: 8, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, positive: 14, positive conditional: 6, positive unconditional: 8, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1400, Positive cache size: 1342, Positive conditional cache size: 7, Positive unconditional cache size: 1335, Negative cache size: 58, Negative conditional cache size: 1, Negative unconditional cache size: 57, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 62.9ms, 55 PlacesBefore, 55 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 460 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 168 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, positive: 21, positive conditional: 11, positive unconditional: 10, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, positive: 21, positive conditional: 11, positive unconditional: 10, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, positive: 18, positive conditional: 8, positive unconditional: 10, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1403, Positive cache size: 1345, Positive conditional cache size: 10, Positive unconditional cache size: 1335, Negative cache size: 58, Negative conditional cache size: 1, Negative unconditional cache size: 57, Eliminated conditions: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 93.7ms, 61 PlacesBefore, 61 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 552 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1403, Positive cache size: 1345, Positive conditional cache size: 10, Positive unconditional cache size: 1335, Negative cache size: 58, Negative conditional cache size: 1, Negative unconditional cache size: 57, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 91.5ms, 66 PlacesBefore, 66 PlacesAfterwards, 56 TransitionsBefore, 54 TransitionsAfterwards, 600 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 47 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, positive: 47, positive conditional: 47, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, positive: 47, positive conditional: 42, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, positive: 47, positive conditional: 42, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, 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: 9, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 47, positive: 38, positive conditional: 33, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1412, Positive cache size: 1354, Positive conditional cache size: 19, Positive unconditional cache size: 1335, Negative cache size: 58, Negative conditional cache size: 1, Negative unconditional cache size: 57, Eliminated conditions: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5344.8ms, 65 PlacesBefore, 56 PlacesAfterwards, 31 TransitionsBefore, 26 TransitionsAfterwards, 174 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 83 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, positive: 29, positive conditional: 29, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 43, positive: 29, positive conditional: 23, positive unconditional: 6, negative: 14, negative conditional: 8, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43, positive: 29, positive conditional: 23, positive unconditional: 6, negative: 14, negative conditional: 8, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 7, positive conditional: 5, positive unconditional: 2, negative: 3, negative conditional: 2, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 2, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 48, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 48, negative conditional: 35, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 43, positive: 22, positive conditional: 18, positive unconditional: 4, negative: 11, negative conditional: 6, negative unconditional: 5, unknown: 10, unknown conditional: 7, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1422, Positive cache size: 1361, Positive conditional cache size: 24, Positive unconditional cache size: 1337, Negative cache size: 61, Negative conditional cache size: 3, Negative unconditional cache size: 58, Eliminated conditions: 12 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2495; [L817] FCALL, FORK 0 pthread_create(&t2495, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2496; [L819] FCALL, FORK 0 pthread_create(&t2496, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2497; [L821] FCALL, FORK 0 pthread_create(&t2497, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 21305.7ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1461.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8266.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 52 SDtfs, 19 SDslu, 14 SDs, 0 SdLazy, 278 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 342.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 403.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=428occurred in iteration=11, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 37.7ms SsaConstructionTime, 505.5ms SatisfiabilityAnalysisTime, 1036.5ms InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 1249 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...