/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi003_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:28:56,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:28:56,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:28:56,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:28:56,752 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:28:56,754 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:28:56,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:28:56,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:28:56,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:28:56,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:28:56,765 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:28:56,766 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:28:56,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:28:56,768 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:28:56,769 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:28:56,769 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:28:56,771 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:28:56,772 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:28:56,774 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:28:56,780 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:28:56,781 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:28:56,781 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:28:56,782 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:28:56,783 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:28:56,788 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:28:56,788 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:28:56,788 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:28:56,789 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:28:56,789 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:28:56,790 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:28:56,790 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:28:56,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:28:56,791 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:28:56,792 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:28:56,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:28:56,793 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:28:56,793 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:28:56,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:28:56,793 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:28:56,794 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:28:56,794 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:28:56,795 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:28:56,821 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:28:56,821 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:28:56,824 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:28:56,824 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:28:56,824 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:28:56,824 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:28:56,824 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:28:56,824 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:28:56,824 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:28:56,825 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:28:56,825 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:28:56,826 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:28:56,826 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:28:56,826 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:28:56,826 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:28:56,826 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:28:56,826 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:28:56,826 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:28:56,826 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:28:56,826 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:28:56,827 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:28:56,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:28:56,827 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:28:56,827 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:28:56,827 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:28:56,827 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:28:56,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:28:56,827 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:28:56,828 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:28:56,828 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:28:56,828 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:28:57,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:28:57,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:28:57,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:28:57,108 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:28:57,109 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:28:57,109 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_rmo.opt.i [2021-03-26 00:28:57,181 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/828f20eca/1e64fc1399d14c1a8f8a899fce16bd8a/FLAG7a8c439bf [2021-03-26 00:28:57,631 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:28:57,632 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_rmo.opt.i [2021-03-26 00:28:57,650 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/828f20eca/1e64fc1399d14c1a8f8a899fce16bd8a/FLAG7a8c439bf [2021-03-26 00:28:57,665 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/828f20eca/1e64fc1399d14c1a8f8a899fce16bd8a [2021-03-26 00:28:57,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:28:57,668 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:28:57,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:28:57,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:28:57,674 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:28:57,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:28:57" (1/1) ... [2021-03-26 00:28:57,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c35b5b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:28:57, skipping insertion in model container [2021-03-26 00:28:57,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:28:57" (1/1) ... [2021-03-26 00:28:57,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:28:57,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:28:57,912 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/rfi003_rmo.opt.i[991,1004] [2021-03-26 00:28:58,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:28:58,118 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:28:58,133 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/rfi003_rmo.opt.i[991,1004] [2021-03-26 00:28:58,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:28:58,236 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:28:58,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:28:58 WrapperNode [2021-03-26 00:28:58,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:28:58,241 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:28:58,241 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:28:58,241 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:28:58,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:28:58" (1/1) ... [2021-03-26 00:28:58,268 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:28:58" (1/1) ... [2021-03-26 00:28:58,286 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:28:58,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:28:58,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:28:58,287 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:28:58,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:28:58" (1/1) ... [2021-03-26 00:28:58,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:28:58" (1/1) ... [2021-03-26 00:28:58,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:28:58" (1/1) ... [2021-03-26 00:28:58,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:28:58" (1/1) ... [2021-03-26 00:28:58,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:28:58" (1/1) ... [2021-03-26 00:28:58,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:28:58" (1/1) ... [2021-03-26 00:28:58,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:28:58" (1/1) ... [2021-03-26 00:28:58,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:28:58,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:28:58,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:28:58,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:28:58,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:28:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:28:58,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:28:58,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:28:58,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:28:58,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:28:58,384 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:28:58,384 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:28:58,384 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:28:58,384 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:28:58,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:28:58,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:28:58,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:28:58,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:28:58,386 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:28:59,765 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:28:59,765 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:28:59,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:28:59 BoogieIcfgContainer [2021-03-26 00:28:59,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:28:59,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:28:59,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:28:59,770 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:28:59,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:28:57" (1/3) ... [2021-03-26 00:28:59,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b8da23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:28:59, skipping insertion in model container [2021-03-26 00:28:59,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:28:58" (2/3) ... [2021-03-26 00:28:59,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b8da23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:28:59, skipping insertion in model container [2021-03-26 00:28:59,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:28:59" (3/3) ... [2021-03-26 00:28:59,773 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi003_rmo.opt.i [2021-03-26 00:28:59,779 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:28:59,783 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:28:59,784 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:28:59,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,807 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,807 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,807 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,808 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,817 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,817 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,817 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,817 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,818 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,818 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,818 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,818 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,822 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,823 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,823 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,825 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,825 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:28:59,828 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:28:59,842 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-26 00:28:59,859 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:28:59,859 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:28:59,859 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:28:59,859 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:28:59,859 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:28:59,859 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:28:59,859 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:28:59,859 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:28:59,868 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 83 transitions, 176 flow [2021-03-26 00:28:59,891 INFO L129 PetriNetUnfolder]: 2/81 cut-off events. [2021-03-26 00:28:59,891 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:28:59,893 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 2/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2021-03-26 00:28:59,893 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 83 transitions, 176 flow [2021-03-26 00:28:59,896 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 81 transitions, 168 flow [2021-03-26 00:28:59,898 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:28:59,907 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 81 transitions, 168 flow [2021-03-26 00:28:59,909 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 81 transitions, 168 flow [2021-03-26 00:28:59,910 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 81 transitions, 168 flow [2021-03-26 00:28:59,921 INFO L129 PetriNetUnfolder]: 2/81 cut-off events. [2021-03-26 00:28:59,921 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:28:59,921 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 2/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2021-03-26 00:28:59,923 INFO L142 LiptonReduction]: Number of co-enabled transitions 968 [2021-03-26 00:29:00,565 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:29:00,989 WARN L205 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:29:01,133 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:29:02,041 INFO L154 LiptonReduction]: Checked pairs total: 1537 [2021-03-26 00:29:02,041 INFO L156 LiptonReduction]: Total number of compositions: 56 [2021-03-26 00:29:02,044 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2147 [2021-03-26 00:29:02,061 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-03-26 00:29:02,061 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:29:02,061 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:29:02,062 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:29:02,062 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:29:02,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:29:02,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1519518288, now seen corresponding path program 1 times [2021-03-26 00:29:02,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:29:02,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465047525] [2021-03-26 00:29:02,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:29:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:29:02,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:02,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:29:02,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:02,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:29:02,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:29:02,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465047525] [2021-03-26 00:29:02,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:29:02,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:29:02,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543236825] [2021-03-26 00:29:02,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:29:02,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:29:02,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:29:02,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:29:02,337 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 139 [2021-03-26 00:29:02,339 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:02,340 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:29:02,340 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 139 [2021-03-26 00:29:02,340 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:29:02,365 INFO L129 PetriNetUnfolder]: 9/59 cut-off events. [2021-03-26 00:29:02,366 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:29:02,366 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 59 events. 9/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 154 event pairs, 1 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 70. Up to 17 conditions per place. [2021-03-26 00:29:02,367 INFO L132 encePairwiseOnDemand]: 135/139 looper letters, 5 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2021-03-26 00:29:02,367 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 84 flow [2021-03-26 00:29:02,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:29:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:29:02,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2021-03-26 00:29:02,376 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8800959232613909 [2021-03-26 00:29:02,376 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2021-03-26 00:29:02,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2021-03-26 00:29:02,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:29:02,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2021-03-26 00:29:02,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:02,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:02,384 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:02,385 INFO L185 Difference]: Start difference. First operand has 38 places, 32 transitions, 70 flow. Second operand 3 states and 367 transitions. [2021-03-26 00:29:02,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 84 flow [2021-03-26 00:29:02,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:29:02,388 INFO L241 Difference]: Finished difference. Result has 37 places, 30 transitions, 68 flow [2021-03-26 00:29:02,389 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2021-03-26 00:29:02,390 INFO L343 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2021-03-26 00:29:02,390 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:29:02,390 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 68 flow [2021-03-26 00:29:02,390 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 68 flow [2021-03-26 00:29:02,391 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 68 flow [2021-03-26 00:29:02,394 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2021-03-26 00:29:02,394 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:29:02,394 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:29:02,394 INFO L142 LiptonReduction]: Number of co-enabled transitions 192 [2021-03-26 00:29:03,212 INFO L154 LiptonReduction]: Checked pairs total: 744 [2021-03-26 00:29:03,213 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 00:29:03,213 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 823 [2021-03-26 00:29:03,216 INFO L480 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 46 flow [2021-03-26 00:29:03,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:03,216 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:29:03,216 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:29:03,216 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:29:03,217 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:29:03,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:29:03,218 INFO L82 PathProgramCache]: Analyzing trace with hash -983923570, now seen corresponding path program 1 times [2021-03-26 00:29:03,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:29:03,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462815770] [2021-03-26 00:29:03,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:29:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:29:03,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:03,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:29:03,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:03,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:29:03,285 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:29:03,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:29:03,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:03,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:29:03,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:29:03,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462815770] [2021-03-26 00:29:03,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:29:03,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:29:03,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072135870] [2021-03-26 00:29:03,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:29:03,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:29:03,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:29:03,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:29:03,342 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 151 [2021-03-26 00:29:03,342 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 46 flow. Second operand has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:03,343 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:29:03,343 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 151 [2021-03-26 00:29:03,343 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:29:03,390 INFO L129 PetriNetUnfolder]: 24/78 cut-off events. [2021-03-26 00:29:03,390 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 00:29:03,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 78 events. 24/78 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 265 event pairs, 4 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 130. Up to 21 conditions per place. [2021-03-26 00:29:03,391 INFO L132 encePairwiseOnDemand]: 145/151 looper letters, 6 selfloop transitions, 4 changer transitions 12/32 dead transitions. [2021-03-26 00:29:03,391 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 32 transitions, 116 flow [2021-03-26 00:29:03,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:29:03,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:29:03,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 801 transitions. [2021-03-26 00:29:03,394 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7578051087984863 [2021-03-26 00:29:03,394 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 801 transitions. [2021-03-26 00:29:03,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 801 transitions. [2021-03-26 00:29:03,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:29:03,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 801 transitions. [2021-03-26 00:29:03,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.42857142857143) internal successors, (801), 7 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:03,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 151.0) internal successors, (1208), 8 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:03,400 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 151.0) internal successors, (1208), 8 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:03,400 INFO L185 Difference]: Start difference. First operand has 26 places, 19 transitions, 46 flow. Second operand 7 states and 801 transitions. [2021-03-26 00:29:03,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 32 transitions, 116 flow [2021-03-26 00:29:03,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 32 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:29:03,401 INFO L241 Difference]: Finished difference. Result has 33 places, 20 transitions, 69 flow [2021-03-26 00:29:03,401 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=69, PETRI_PLACES=33, PETRI_TRANSITIONS=20} [2021-03-26 00:29:03,401 INFO L343 CegarLoopForPetriNet]: 38 programPoint places, -5 predicate places. [2021-03-26 00:29:03,402 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:29:03,402 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 20 transitions, 69 flow [2021-03-26 00:29:03,402 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 20 transitions, 69 flow [2021-03-26 00:29:03,402 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 29 places, 20 transitions, 69 flow [2021-03-26 00:29:03,406 INFO L129 PetriNetUnfolder]: 2/30 cut-off events. [2021-03-26 00:29:03,406 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-03-26 00:29:03,406 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 30 events. 2/30 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 50. Up to 9 conditions per place. [2021-03-26 00:29:03,406 INFO L142 LiptonReduction]: Number of co-enabled transitions 98 [2021-03-26 00:29:03,920 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-03-26 00:29:04,024 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-26 00:29:04,253 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-03-26 00:29:04,384 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-26 00:29:04,422 INFO L154 LiptonReduction]: Checked pairs total: 270 [2021-03-26 00:29:04,422 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:29:04,422 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1020 [2021-03-26 00:29:04,423 INFO L480 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 65 flow [2021-03-26 00:29:04,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:04,423 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:29:04,424 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:29:04,424 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:29:04,424 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:29:04,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:29:04,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1438951755, now seen corresponding path program 1 times [2021-03-26 00:29:04,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:29:04,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790840891] [2021-03-26 00:29:04,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:29:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:29:04,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:04,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:29:04,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:04,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:29:04,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:04,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:29:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:29:04,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790840891] [2021-03-26 00:29:04,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:29:04,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:29:04,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493818679] [2021-03-26 00:29:04,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:29:04,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:29:04,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:29:04,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:29:04,486 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 153 [2021-03-26 00:29:04,487 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:04,487 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:29:04,487 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 153 [2021-03-26 00:29:04,487 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:29:04,521 INFO L129 PetriNetUnfolder]: 14/63 cut-off events. [2021-03-26 00:29:04,521 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-03-26 00:29:04,521 INFO L84 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 63 events. 14/63 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 216 event pairs, 4 based on Foata normal form. 8/67 useless extension candidates. Maximal degree in co-relation 128. Up to 32 conditions per place. [2021-03-26 00:29:04,522 INFO L132 encePairwiseOnDemand]: 148/153 looper letters, 4 selfloop transitions, 5 changer transitions 3/25 dead transitions. [2021-03-26 00:29:04,522 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 25 transitions, 103 flow [2021-03-26 00:29:04,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:29:04,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:29:04,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 639 transitions. [2021-03-26 00:29:04,524 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8352941176470589 [2021-03-26 00:29:04,524 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 639 transitions. [2021-03-26 00:29:04,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 639 transitions. [2021-03-26 00:29:04,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:29:04,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 639 transitions. [2021-03-26 00:29:04,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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 00:29:04,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:04,527 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:04,527 INFO L185 Difference]: Start difference. First operand has 27 places, 18 transitions, 65 flow. Second operand 5 states and 639 transitions. [2021-03-26 00:29:04,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 25 transitions, 103 flow [2021-03-26 00:29:04,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 25 transitions, 94 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-26 00:29:04,528 INFO L241 Difference]: Finished difference. Result has 31 places, 22 transitions, 93 flow [2021-03-26 00:29:04,528 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2021-03-26 00:29:04,528 INFO L343 CegarLoopForPetriNet]: 38 programPoint places, -7 predicate places. [2021-03-26 00:29:04,528 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:29:04,528 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 22 transitions, 93 flow [2021-03-26 00:29:04,529 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 22 transitions, 93 flow [2021-03-26 00:29:04,529 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 22 transitions, 93 flow [2021-03-26 00:29:04,534 INFO L129 PetriNetUnfolder]: 8/56 cut-off events. [2021-03-26 00:29:04,534 INFO L130 PetriNetUnfolder]: For 23/25 co-relation queries the response was YES. [2021-03-26 00:29:04,534 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 56 events. 8/56 cut-off events. For 23/25 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 197 event pairs, 5 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 133. Up to 23 conditions per place. [2021-03-26 00:29:04,535 INFO L142 LiptonReduction]: Number of co-enabled transitions 112 [2021-03-26 00:29:04,651 INFO L154 LiptonReduction]: Checked pairs total: 62 [2021-03-26 00:29:04,651 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:29:04,651 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 123 [2021-03-26 00:29:04,652 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 93 flow [2021-03-26 00:29:04,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:04,652 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:29:04,652 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:29:04,653 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:29:04,653 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:29:04,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:29:04,653 INFO L82 PathProgramCache]: Analyzing trace with hash 281019099, now seen corresponding path program 1 times [2021-03-26 00:29:04,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:29:04,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882825059] [2021-03-26 00:29:04,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:29:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:29:04,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:04,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:29:04,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:04,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:29:04,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:29:04,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882825059] [2021-03-26 00:29:04,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:29:04,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:29:04,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839782900] [2021-03-26 00:29:04,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:29:04,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:29:04,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:29:04,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:29:04,747 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 153 [2021-03-26 00:29:04,747 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:04,748 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:29:04,748 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 153 [2021-03-26 00:29:04,748 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:29:04,781 INFO L129 PetriNetUnfolder]: 11/95 cut-off events. [2021-03-26 00:29:04,781 INFO L130 PetriNetUnfolder]: For 57/66 co-relation queries the response was YES. [2021-03-26 00:29:04,783 INFO L84 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 95 events. 11/95 cut-off events. For 57/66 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 465 event pairs, 5 based on Foata normal form. 8/100 useless extension candidates. Maximal degree in co-relation 247. Up to 39 conditions per place. [2021-03-26 00:29:04,783 INFO L132 encePairwiseOnDemand]: 150/153 looper letters, 6 selfloop transitions, 3 changer transitions 1/25 dead transitions. [2021-03-26 00:29:04,783 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 25 transitions, 124 flow [2021-03-26 00:29:04,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:29:04,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:29:04,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2021-03-26 00:29:04,784 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8518518518518519 [2021-03-26 00:29:04,784 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 391 transitions. [2021-03-26 00:29:04,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 391 transitions. [2021-03-26 00:29:04,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:29:04,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 391 transitions. [2021-03-26 00:29:04,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:04,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:04,787 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:04,787 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 93 flow. Second operand 3 states and 391 transitions. [2021-03-26 00:29:04,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 25 transitions, 124 flow [2021-03-26 00:29:04,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 124 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 00:29:04,790 INFO L241 Difference]: Finished difference. Result has 34 places, 22 transitions, 104 flow [2021-03-26 00:29:04,790 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2021-03-26 00:29:04,790 INFO L343 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places. [2021-03-26 00:29:04,791 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:29:04,791 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 22 transitions, 104 flow [2021-03-26 00:29:04,791 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 22 transitions, 104 flow [2021-03-26 00:29:04,791 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 22 transitions, 104 flow [2021-03-26 00:29:04,800 INFO L129 PetriNetUnfolder]: 8/55 cut-off events. [2021-03-26 00:29:04,801 INFO L130 PetriNetUnfolder]: For 32/35 co-relation queries the response was YES. [2021-03-26 00:29:04,801 INFO L84 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 55 events. 8/55 cut-off events. For 32/35 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 187 event pairs, 4 based on Foata normal form. 3/58 useless extension candidates. Maximal degree in co-relation 138. Up to 22 conditions per place. [2021-03-26 00:29:04,803 INFO L142 LiptonReduction]: Number of co-enabled transitions 80 [2021-03-26 00:29:04,913 INFO L154 LiptonReduction]: Checked pairs total: 83 [2021-03-26 00:29:04,913 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:29:04,913 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 122 [2021-03-26 00:29:04,916 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 21 transitions, 102 flow [2021-03-26 00:29:04,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:04,916 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:29:04,916 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:29:04,917 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:29:04,917 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:29:04,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:29:04,917 INFO L82 PathProgramCache]: Analyzing trace with hash -118054989, now seen corresponding path program 2 times [2021-03-26 00:29:04,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:29:04,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403209444] [2021-03-26 00:29:04,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:29:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:29:05,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:05,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:29:05,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:05,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:29:05,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:05,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:29:05,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:05,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:29:05,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:29:05,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403209444] [2021-03-26 00:29:05,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:29:05,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:29:05,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788902543] [2021-03-26 00:29:05,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:29:05,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:29:05,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:29:05,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:29:05,039 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 154 [2021-03-26 00:29:05,040 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:05,040 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:29:05,040 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 154 [2021-03-26 00:29:05,040 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:29:05,078 INFO L129 PetriNetUnfolder]: 5/46 cut-off events. [2021-03-26 00:29:05,079 INFO L130 PetriNetUnfolder]: For 54/72 co-relation queries the response was YES. [2021-03-26 00:29:05,079 INFO L84 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 46 events. 5/46 cut-off events. For 54/72 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 0 based on Foata normal form. 25/71 useless extension candidates. Maximal degree in co-relation 138. Up to 20 conditions per place. [2021-03-26 00:29:05,079 INFO L132 encePairwiseOnDemand]: 149/154 looper letters, 2 selfloop transitions, 8 changer transitions 2/24 dead transitions. [2021-03-26 00:29:05,080 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 24 transitions, 140 flow [2021-03-26 00:29:05,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:29:05,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:29:05,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 896 transitions. [2021-03-26 00:29:05,081 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8311688311688312 [2021-03-26 00:29:05,082 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 896 transitions. [2021-03-26 00:29:05,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 896 transitions. [2021-03-26 00:29:05,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:29:05,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 896 transitions. [2021-03-26 00:29:05,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:05,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 154.0) internal successors, (1232), 8 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:05,086 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 154.0) internal successors, (1232), 8 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:05,086 INFO L185 Difference]: Start difference. First operand has 33 places, 21 transitions, 102 flow. Second operand 7 states and 896 transitions. [2021-03-26 00:29:05,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 24 transitions, 140 flow [2021-03-26 00:29:05,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 24 transitions, 125 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-26 00:29:05,088 INFO L241 Difference]: Finished difference. Result has 38 places, 22 transitions, 120 flow [2021-03-26 00:29:05,089 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=120, PETRI_PLACES=38, PETRI_TRANSITIONS=22} [2021-03-26 00:29:05,089 INFO L343 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2021-03-26 00:29:05,089 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:29:05,089 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 22 transitions, 120 flow [2021-03-26 00:29:05,089 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 22 transitions, 120 flow [2021-03-26 00:29:05,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 22 transitions, 120 flow [2021-03-26 00:29:05,094 INFO L129 PetriNetUnfolder]: 3/40 cut-off events. [2021-03-26 00:29:05,094 INFO L130 PetriNetUnfolder]: For 58/59 co-relation queries the response was YES. [2021-03-26 00:29:05,095 INFO L84 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 40 events. 3/40 cut-off events. For 58/59 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 113 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 118. Up to 16 conditions per place. [2021-03-26 00:29:05,095 INFO L142 LiptonReduction]: Number of co-enabled transitions 56 [2021-03-26 00:29:05,365 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-26 00:29:05,489 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-26 00:29:05,824 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2021-03-26 00:29:05,977 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2021-03-26 00:29:05,985 INFO L154 LiptonReduction]: Checked pairs total: 88 [2021-03-26 00:29:05,985 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 00:29:05,985 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 896 [2021-03-26 00:29:05,987 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 18 transitions, 100 flow [2021-03-26 00:29:05,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:05,988 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:29:05,988 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:29:05,988 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:29:05,988 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:29:05,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:29:05,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1738399277, now seen corresponding path program 1 times [2021-03-26 00:29:05,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:29:05,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819862621] [2021-03-26 00:29:05,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:29:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:29:06,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:06,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:29:06,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:06,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:29:06,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:06,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:29:06,077 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:29:06,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:29:06,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:29:06,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819862621] [2021-03-26 00:29:06,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:29:06,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:29:06,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051804339] [2021-03-26 00:29:06,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:29:06,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:29:06,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:29:06,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:29:06,089 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 156 [2021-03-26 00:29:06,090 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 18 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:06,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:29:06,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 156 [2021-03-26 00:29:06,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:29:06,147 INFO L129 PetriNetUnfolder]: 6/38 cut-off events. [2021-03-26 00:29:06,147 INFO L130 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2021-03-26 00:29:06,147 INFO L84 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 38 events. 6/38 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 99 event pairs, 0 based on Foata normal form. 1/39 useless extension candidates. Maximal degree in co-relation 119. Up to 12 conditions per place. [2021-03-26 00:29:06,148 INFO L132 encePairwiseOnDemand]: 150/156 looper letters, 5 selfloop transitions, 2 changer transitions 6/21 dead transitions. [2021-03-26 00:29:06,148 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 21 transitions, 131 flow [2021-03-26 00:29:06,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:29:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:29:06,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions. [2021-03-26 00:29:06,150 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7638888888888888 [2021-03-26 00:29:06,150 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 715 transitions. [2021-03-26 00:29:06,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 715 transitions. [2021-03-26 00:29:06,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:29:06,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 715 transitions. [2021-03-26 00:29:06,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 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 00:29:06,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 156.0) internal successors, (1092), 7 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:06,153 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 156.0) internal successors, (1092), 7 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:06,154 INFO L185 Difference]: Start difference. First operand has 35 places, 18 transitions, 100 flow. Second operand 6 states and 715 transitions. [2021-03-26 00:29:06,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 21 transitions, 131 flow [2021-03-26 00:29:06,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 21 transitions, 108 flow, removed 7 selfloop flow, removed 7 redundant places. [2021-03-26 00:29:06,156 INFO L241 Difference]: Finished difference. Result has 32 places, 15 transitions, 75 flow [2021-03-26 00:29:06,157 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=75, PETRI_PLACES=32, PETRI_TRANSITIONS=15} [2021-03-26 00:29:06,157 INFO L343 CegarLoopForPetriNet]: 38 programPoint places, -6 predicate places. [2021-03-26 00:29:06,157 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:29:06,157 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 15 transitions, 75 flow [2021-03-26 00:29:06,157 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 15 transitions, 75 flow [2021-03-26 00:29:06,157 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 15 transitions, 75 flow [2021-03-26 00:29:06,160 INFO L129 PetriNetUnfolder]: 1/15 cut-off events. [2021-03-26 00:29:06,161 INFO L130 PetriNetUnfolder]: For 12/13 co-relation queries the response was YES. [2021-03-26 00:29:06,161 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 15 events. 1/15 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 5 event pairs, 0 based on Foata normal form. 1/16 useless extension candidates. Maximal degree in co-relation 34. Up to 4 conditions per place. [2021-03-26 00:29:06,161 INFO L142 LiptonReduction]: Number of co-enabled transitions 10 [2021-03-26 00:29:06,792 WARN L205 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 00:29:07,020 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 00:29:08,148 WARN L205 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 302 DAG size of output: 257 [2021-03-26 00:29:08,782 WARN L205 SmtUtils]: Spent 632.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-26 00:29:08,971 INFO L154 LiptonReduction]: Checked pairs total: 22 [2021-03-26 00:29:08,971 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:29:08,971 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2814 [2021-03-26 00:29:08,978 INFO L480 AbstractCegarLoop]: Abstraction has has 27 places, 12 transitions, 65 flow [2021-03-26 00:29:08,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:08,979 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:29:08,979 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:29:08,979 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:29:08,979 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:29:08,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:29:08,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1075706671, now seen corresponding path program 1 times [2021-03-26 00:29:08,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:29:08,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692518815] [2021-03-26 00:29:08,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:29:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:29:09,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:29:09,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:29:09,063 INFO L142 QuantifierPusher]: treesize reduction 12, result has 60.0 percent of original size [2021-03-26 00:29:09,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 00:29:09,090 INFO L142 QuantifierPusher]: treesize reduction 24, result has 67.6 percent of original size [2021-03-26 00:29:09,091 INFO L147 QuantifierPusher]: treesize reduction 9, result has 82.0 percent of original size 41 [2021-03-26 00:29:09,111 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:29:09,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:29:09,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:29:09,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692518815] [2021-03-26 00:29:09,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:29:09,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:29:09,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666190840] [2021-03-26 00:29:09,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:29:09,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:29:09,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:29:09,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:29:09,121 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 159 [2021-03-26 00:29:09,121 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 12 transitions, 65 flow. Second operand has 5 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:09,121 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:29:09,121 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 159 [2021-03-26 00:29:09,121 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:29:09,178 INFO L129 PetriNetUnfolder]: 2/18 cut-off events. [2021-03-26 00:29:09,178 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-03-26 00:29:09,178 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 18 events. 2/18 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 1/19 useless extension candidates. Maximal degree in co-relation 50. Up to 6 conditions per place. [2021-03-26 00:29:09,179 INFO L132 encePairwiseOnDemand]: 154/159 looper letters, 2 selfloop transitions, 3 changer transitions 2/14 dead transitions. [2021-03-26 00:29:09,179 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 14 transitions, 90 flow [2021-03-26 00:29:09,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:29:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:29:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 498 transitions. [2021-03-26 00:29:09,180 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6264150943396226 [2021-03-26 00:29:09,181 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 498 transitions. [2021-03-26 00:29:09,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 498 transitions. [2021-03-26 00:29:09,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:29:09,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 498 transitions. [2021-03-26 00:29:09,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:09,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 159.0) internal successors, (954), 6 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:09,184 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 159.0) internal successors, (954), 6 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:09,184 INFO L185 Difference]: Start difference. First operand has 27 places, 12 transitions, 65 flow. Second operand 5 states and 498 transitions. [2021-03-26 00:29:09,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 14 transitions, 90 flow [2021-03-26 00:29:09,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 14 transitions, 71 flow, removed 5 selfloop flow, removed 6 redundant places. [2021-03-26 00:29:09,185 INFO L241 Difference]: Finished difference. Result has 27 places, 12 transitions, 63 flow [2021-03-26 00:29:09,185 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=63, PETRI_PLACES=27, PETRI_TRANSITIONS=12} [2021-03-26 00:29:09,186 INFO L343 CegarLoopForPetriNet]: 38 programPoint places, -11 predicate places. [2021-03-26 00:29:09,186 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:29:09,186 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 12 transitions, 63 flow [2021-03-26 00:29:09,186 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 12 transitions, 63 flow [2021-03-26 00:29:09,186 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 12 transitions, 63 flow [2021-03-26 00:29:09,188 INFO L129 PetriNetUnfolder]: 1/12 cut-off events. [2021-03-26 00:29:09,188 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2021-03-26 00:29:09,188 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 12 events. 1/12 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 4 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 29. Up to 4 conditions per place. [2021-03-26 00:29:09,188 INFO L142 LiptonReduction]: Number of co-enabled transitions 2 [2021-03-26 00:29:09,576 WARN L205 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 00:29:09,905 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 00:29:10,418 WARN L205 SmtUtils]: Spent 500.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 00:29:10,950 WARN L205 SmtUtils]: Spent 529.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 00:29:11,113 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-03-26 00:29:11,500 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 90 [2021-03-26 00:29:11,622 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-26 00:29:11,848 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-03-26 00:29:12,181 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 87 [2021-03-26 00:29:12,286 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 00:29:12,287 INFO L154 LiptonReduction]: Checked pairs total: 3 [2021-03-26 00:29:12,287 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:29:12,288 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3102 [2021-03-26 00:29:12,288 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 11 transitions, 68 flow [2021-03-26 00:29:12,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:29:12,288 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:29:12,288 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:29:12,288 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:29:12,288 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:29:12,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:29:12,289 INFO L82 PathProgramCache]: Analyzing trace with hash -689293590, now seen corresponding path program 1 times [2021-03-26 00:29:12,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:29:12,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276039295] [2021-03-26 00:29:12,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:29:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:29:12,341 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:29:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:29:12,395 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:29:12,434 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:29:12,434 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:29:12,434 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:29:12,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:29:12 BasicIcfg [2021-03-26 00:29:12,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:29:12,486 INFO L168 Benchmark]: Toolchain (without parser) took 14817.92 ms. Allocated memory was 333.4 MB in the beginning and 635.4 MB in the end (delta: 302.0 MB). Free memory was 295.9 MB in the beginning and 488.1 MB in the end (delta: -192.2 MB). Peak memory consumption was 110.0 MB. Max. memory is 16.0 GB. [2021-03-26 00:29:12,486 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 333.4 MB. Free memory was 314.2 MB in the beginning and 314.1 MB in the end (delta: 75.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:29:12,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 568.35 ms. Allocated memory is still 333.4 MB. Free memory was 295.7 MB in the beginning and 293.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 6.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:29:12,487 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.35 ms. Allocated memory is still 333.4 MB. Free memory was 293.0 MB in the beginning and 289.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:29:12,487 INFO L168 Benchmark]: Boogie Preprocessor took 24.92 ms. Allocated memory is still 333.4 MB. Free memory was 289.9 MB in the beginning and 288.8 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:29:12,487 INFO L168 Benchmark]: RCFGBuilder took 1455.17 ms. Allocated memory is still 333.4 MB. Free memory was 288.8 MB in the beginning and 294.6 MB in the end (delta: -5.8 MB). Peak memory consumption was 163.0 MB. Max. memory is 16.0 GB. [2021-03-26 00:29:12,487 INFO L168 Benchmark]: TraceAbstraction took 12717.59 ms. Allocated memory was 333.4 MB in the beginning and 635.4 MB in the end (delta: 302.0 MB). Free memory was 293.6 MB in the beginning and 488.1 MB in the end (delta: -194.5 MB). Peak memory consumption was 107.5 MB. Max. memory is 16.0 GB. [2021-03-26 00:29:12,488 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.34 ms. Allocated memory is still 333.4 MB. Free memory was 314.2 MB in the beginning and 314.1 MB in the end (delta: 75.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 568.35 ms. Allocated memory is still 333.4 MB. Free memory was 295.7 MB in the beginning and 293.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 6.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 45.35 ms. Allocated memory is still 333.4 MB. Free memory was 293.0 MB in the beginning and 289.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 24.92 ms. Allocated memory is still 333.4 MB. Free memory was 289.9 MB in the beginning and 288.8 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 1455.17 ms. Allocated memory is still 333.4 MB. Free memory was 288.8 MB in the beginning and 294.6 MB in the end (delta: -5.8 MB). Peak memory consumption was 163.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 12717.59 ms. Allocated memory was 333.4 MB in the beginning and 635.4 MB in the end (delta: 302.0 MB). Free memory was 293.6 MB in the beginning and 488.1 MB in the end (delta: -194.5 MB). Peak memory consumption was 107.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2132.0ms, 86 PlacesBefore, 38 PlacesAfterwards, 81 TransitionsBefore, 32 TransitionsAfterwards, 968 CoEnabledTransitionPairs, 4 FixpointIterations, 25 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 56 TotalNumberOfCompositions, 1537 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 908, positive: 855, positive conditional: 855, positive unconditional: 0, negative: 53, negative conditional: 53, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 685, positive: 660, positive conditional: 0, positive unconditional: 660, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 685, positive: 660, positive conditional: 0, positive unconditional: 660, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 685, positive: 650, positive conditional: 0, positive unconditional: 650, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 35, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 288, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 273, negative conditional: 0, negative unconditional: 273, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 908, positive: 195, positive conditional: 195, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 685, unknown conditional: 685, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 43, Positive conditional cache size: 43, Positive unconditional cache size: 0, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 822.4ms, 37 PlacesBefore, 26 PlacesAfterwards, 30 TransitionsBefore, 19 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 744 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 323, positive: 248, positive conditional: 248, positive unconditional: 0, negative: 75, negative conditional: 75, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 91, positive: 78, positive conditional: 12, positive unconditional: 66, negative: 13, negative conditional: 1, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 91, positive: 78, positive conditional: 12, positive unconditional: 66, negative: 13, negative conditional: 1, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 91, positive: 77, positive conditional: 0, positive unconditional: 77, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 13, negative conditional: 1, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 148, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 145, negative conditional: 11, negative unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 323, positive: 170, positive conditional: 170, positive unconditional: 0, negative: 62, negative conditional: 62, negative unconditional: 0, unknown: 91, unknown conditional: 91, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 50, Positive conditional cache size: 50, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1020.2ms, 33 PlacesBefore, 27 PlacesAfterwards, 20 TransitionsBefore, 18 TransitionsAfterwards, 98 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 270 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 116, positive: 80, positive conditional: 80, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 10, negative conditional: 2, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 10, negative conditional: 2, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 10, negative conditional: 2, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 154, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 154, negative conditional: 67, negative unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 116, positive: 73, positive conditional: 73, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 57, Positive conditional cache size: 57, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 122.6ms, 31 PlacesBefore, 31 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 62 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 47, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, positive: 28, positive conditional: 13, positive unconditional: 15, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35, positive: 28, positive conditional: 13, positive unconditional: 15, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 114, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 114, negative conditional: 0, negative unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 85, Positive conditional cache size: 85, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 122.3ms, 34 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 83 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 34, positive: 23, positive conditional: 23, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, positive: 23, positive conditional: 23, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 57, Positive conditional cache size: 57, Positive unconditional cache size: 0, Negative cache size: 24, Negative conditional cache size: 24, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 895.8ms, 38 PlacesBefore, 35 PlacesAfterwards, 22 TransitionsBefore, 18 TransitionsAfterwards, 56 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 88 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 54, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 28, Positive conditional cache size: 28, Positive unconditional cache size: 0, Negative cache size: 20, Negative conditional cache size: 20, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2813.9ms, 32 PlacesBefore, 27 PlacesAfterwards, 15 TransitionsBefore, 12 TransitionsAfterwards, 10 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 22 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 3, negative conditional: 2, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 4, positive conditional: 4, positive unconditional: 0, 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: 7, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 2, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 88, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 88, negative conditional: 64, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 4, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3101.5ms, 27 PlacesBefore, 25 PlacesAfterwards, 12 TransitionsBefore, 11 TransitionsAfterwards, 2 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 3 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1643; [L814] FCALL, FORK 0 pthread_create(&t1643, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L815] 0 pthread_t t1644; [L816] FCALL, FORK 0 pthread_create(&t1644, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 [L782] 2 y = 1 [L785] 2 __unbuffered_p1_EAX = y [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 y = 2 [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L4] COND FALSE 0 !(!cond) [L822] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L822] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L822] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L822] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L824] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 82 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 6.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 12579.4ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 389.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2194.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 33 SDtfs, 31 SDslu, 17 SDs, 0 SdLazy, 89 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 98.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 176.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=5, InterpolantAutomatonStates: 36, 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: 25.5ms SsaConstructionTime, 279.5ms SatisfiabilityAnalysisTime, 496.6ms InterpolantComputationTime, 111 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 94 ConstructedInterpolants, 0 QuantifiedInterpolants, 486 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...