/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/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 01:09:51,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 01:09:51,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 01:09:51,433 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 01:09:51,433 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 01:09:51,434 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 01:09:51,435 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 01:09:51,437 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 01:09:51,438 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 01:09:51,439 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 01:09:51,440 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 01:09:51,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 01:09:51,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 01:09:51,442 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 01:09:51,443 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 01:09:51,444 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 01:09:51,444 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 01:09:51,445 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 01:09:51,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 01:09:51,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 01:09:51,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 01:09:51,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 01:09:51,451 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 01:09:51,452 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 01:09:51,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 01:09:51,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 01:09:51,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 01:09:51,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 01:09:51,456 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 01:09:51,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 01:09:51,457 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 01:09:51,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 01:09:51,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 01:09:51,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 01:09:51,459 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 01:09:51,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 01:09:51,460 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 01:09:51,460 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 01:09:51,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 01:09:51,461 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 01:09:51,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 01:09:51,463 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 01:09:51,483 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 01:09:51,483 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 01:09:51,484 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 01:09:51,484 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 01:09:51,484 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 01:09:51,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 01:09:51,485 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 01:09:51,485 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 01:09:51,485 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 01:09:51,485 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 01:09:51,485 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 01:09:51,485 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 01:09:51,486 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 01:09:51,486 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 01:09:51,486 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 01:09:51,486 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 01:09:51,486 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 01:09:51,486 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 01:09:51,486 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 01:09:51,487 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 01:09:51,487 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 01:09:51,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 01:09:51,487 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 01:09:51,487 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 01:09:51,487 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 01:09:51,488 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 01:09:51,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 01:09:51,488 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 01:09:51,488 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 01:09:51,488 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 01:09:51,488 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 01:09:51,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 01:09:51,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 01:09:51,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 01:09:51,805 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 01:09:51,806 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 01:09:51,806 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2021-03-26 01:09:51,874 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b89295eb/f3b6e41395b74f3e9ddd4b878c001671/FLAGfe31f02a5 [2021-03-26 01:09:52,503 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 01:09:52,504 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2021-03-26 01:09:52,526 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b89295eb/f3b6e41395b74f3e9ddd4b878c001671/FLAGfe31f02a5 [2021-03-26 01:09:52,854 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b89295eb/f3b6e41395b74f3e9ddd4b878c001671 [2021-03-26 01:09:52,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 01:09:52,857 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 01:09:52,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 01:09:52,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 01:09:52,863 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 01:09:52,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 01:09:52" (1/1) ... [2021-03-26 01:09:52,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2285aeaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 01:09:52, skipping insertion in model container [2021-03-26 01:09:52,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 01:09:52" (1/1) ... [2021-03-26 01:09:52,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 01:09:52,925 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 01:09:53,041 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-03-26 01:09:53,628 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[75009,75022] [2021-03-26 01:09:53,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 01:09:53,670 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 01:09:53,680 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-03-26 01:09:53,719 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[75009,75022] [2021-03-26 01:09:53,733 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 01:09:54,041 INFO L208 MainTranslator]: Completed translation [2021-03-26 01:09:54,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 01:09:54 WrapperNode [2021-03-26 01:09:54,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 01:09:54,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 01:09:54,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 01:09:54,043 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 01:09:54,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 01:09:54" (1/1) ... [2021-03-26 01:09:54,080 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 01:09:54" (1/1) ... [2021-03-26 01:09:54,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 01:09:54,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 01:09:54,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 01:09:54,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 01:09:54,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 01:09:54" (1/1) ... [2021-03-26 01:09:54,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 01:09:54" (1/1) ... [2021-03-26 01:09:54,123 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 01:09:54" (1/1) ... [2021-03-26 01:09:54,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 01:09:54" (1/1) ... [2021-03-26 01:09:54,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 01:09:54" (1/1) ... [2021-03-26 01:09:54,147 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 01:09:54" (1/1) ... [2021-03-26 01:09:54,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 01:09:54" (1/1) ... [2021-03-26 01:09:54,155 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 01:09:54,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 01:09:54,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 01:09:54,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 01:09:54,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 01:09:54" (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 01:09:54,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 01:09:54,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 01:09:54,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 01:09:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-26 01:09:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-03-26 01:09:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 01:09:54,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 01:09:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2021-03-26 01:09:54,228 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2021-03-26 01:09:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 01:09:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 01:09:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 01:09:54,230 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 01:09:54,965 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 01:09:54,966 INFO L299 CfgBuilder]: Removed 24 assume(true) statements. [2021-03-26 01:09:54,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 01:09:54 BoogieIcfgContainer [2021-03-26 01:09:54,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 01:09:54,969 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 01:09:54,969 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 01:09:54,972 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 01:09:54,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 01:09:52" (1/3) ... [2021-03-26 01:09:54,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384d518e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 01:09:54, skipping insertion in model container [2021-03-26 01:09:54,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 01:09:54" (2/3) ... [2021-03-26 01:09:54,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384d518e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 01:09:54, skipping insertion in model container [2021-03-26 01:09:54,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 01:09:54" (3/3) ... [2021-03-26 01:09:54,974 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2021-03-26 01:09:54,979 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 01:09:54,983 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2021-03-26 01:09:54,983 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 01:09:55,040 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,041 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,041 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,041 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,041 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,041 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,041 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,041 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,042 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,042 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,042 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,042 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,042 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,042 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,042 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,042 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,043 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,043 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,043 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,043 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,043 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,043 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,043 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,043 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,043 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,044 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,044 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,044 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,044 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,044 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,044 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,044 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,045 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,045 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,045 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,045 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,045 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,045 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,045 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,045 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,045 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,046 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,046 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,046 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,046 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,046 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,046 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,046 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,047 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,047 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,047 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,047 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,047 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,047 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,047 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,047 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,047 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,048 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,048 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,048 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,048 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,048 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,048 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,048 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,048 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,048 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,049 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,049 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,049 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,049 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,049 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,049 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,049 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,049 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,050 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,050 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,050 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,050 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,050 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,050 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,050 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,050 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,051 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,051 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,051 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,051 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,051 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,051 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,051 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,051 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,052 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,052 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,056 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,057 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,057 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,057 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,057 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,058 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,059 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,061 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,061 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,061 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,063 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,066 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,066 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,066 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,066 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,066 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,066 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,066 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,066 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,067 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 01:09:55,075 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-03-26 01:09:55,091 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-03-26 01:09:55,119 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 01:09:55,119 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 01:09:55,119 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 01:09:55,119 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 01:09:55,119 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 01:09:55,119 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 01:09:55,119 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 01:09:55,119 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 01:09:55,135 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 152 places, 156 transitions, 334 flow [2021-03-26 01:09:55,221 INFO L129 PetriNetUnfolder]: 11/196 cut-off events. [2021-03-26 01:09:55,221 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-26 01:09:55,227 INFO L84 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 196 events. 11/196 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 358 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 111. Up to 4 conditions per place. [2021-03-26 01:09:55,227 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 156 transitions, 334 flow [2021-03-26 01:09:55,235 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 144 transitions, 306 flow [2021-03-26 01:09:55,236 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 01:09:55,246 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 144 transitions, 306 flow [2021-03-26 01:09:55,248 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 144 transitions, 306 flow [2021-03-26 01:09:55,252 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 142 places, 144 transitions, 306 flow [2021-03-26 01:09:55,291 INFO L129 PetriNetUnfolder]: 8/177 cut-off events. [2021-03-26 01:09:55,291 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-26 01:09:55,299 INFO L84 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 177 events. 8/177 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 300 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 101. Up to 4 conditions per place. [2021-03-26 01:09:55,302 INFO L142 LiptonReduction]: Number of co-enabled transitions 1512 [2021-03-26 01:10:01,383 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2021-03-26 01:10:23,509 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-03-26 01:10:33,079 INFO L154 LiptonReduction]: Checked pairs total: 1692 [2021-03-26 01:10:33,080 INFO L156 LiptonReduction]: Total number of compositions: 113 [2021-03-26 01:10:33,085 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 37850 [2021-03-26 01:10:33,095 INFO L129 PetriNetUnfolder]: 0/8 cut-off events. [2021-03-26 01:10:33,095 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 01:10:33,095 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 01:10:33,096 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 01:10:33,096 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 01:10:33,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 01:10:33,107 INFO L82 PathProgramCache]: Analyzing trace with hash 2133033277, now seen corresponding path program 1 times [2021-03-26 01:10:33,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 01:10:33,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116592862] [2021-03-26 01:10:33,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 01:10:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 01:10:33,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 01:10:33,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 01:10:33,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 01:10:33,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 01:10:33,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 01:10:33,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 01:10:33,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 01:10:33,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 01:10:33,507 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 01:10:33,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116592862] [2021-03-26 01:10:33,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 01:10:33,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 01:10:33,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184551945] [2021-03-26 01:10:33,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 01:10:33,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 01:10:33,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 01:10:33,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 01:10:33,537 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 269 [2021-03-26 01:10:33,543 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 62 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 142.2) internal successors, (711), 5 states have internal predecessors, (711), 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 01:10:33,544 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 01:10:33,544 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 269 [2021-03-26 01:10:33,545 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 01:10:33,725 INFO L129 PetriNetUnfolder]: 170/350 cut-off events. [2021-03-26 01:10:33,725 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-03-26 01:10:33,727 INFO L84 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 350 events. 170/350 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1489 event pairs, 165 based on Foata normal form. 1/321 useless extension candidates. Maximal degree in co-relation 587. Up to 315 conditions per place. [2021-03-26 01:10:33,732 INFO L132 encePairwiseOnDemand]: 257/269 looper letters, 28 selfloop transitions, 7 changer transitions 2/58 dead transitions. [2021-03-26 01:10:33,732 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 58 transitions, 208 flow [2021-03-26 01:10:33,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 01:10:33,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 01:10:33,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 747 transitions. [2021-03-26 01:10:33,754 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5553903345724907 [2021-03-26 01:10:33,755 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 747 transitions. [2021-03-26 01:10:33,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 747 transitions. [2021-03-26 01:10:33,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 01:10:33,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 747 transitions. [2021-03-26 01:10:33,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 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 01:10:33,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 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 01:10:33,772 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 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 01:10:33,773 INFO L185 Difference]: Start difference. First operand has 61 places, 62 transitions, 142 flow. Second operand 5 states and 747 transitions. [2021-03-26 01:10:33,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 58 transitions, 208 flow [2021-03-26 01:10:33,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 58 transitions, 196 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 01:10:33,779 INFO L241 Difference]: Finished difference. Result has 58 places, 56 transitions, 144 flow [2021-03-26 01:10:33,784 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=144, PETRI_PLACES=58, PETRI_TRANSITIONS=56} [2021-03-26 01:10:33,784 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2021-03-26 01:10:33,785 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 01:10:33,785 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 56 transitions, 144 flow [2021-03-26 01:10:33,786 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 56 transitions, 144 flow [2021-03-26 01:10:33,786 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 56 transitions, 144 flow [2021-03-26 01:10:33,793 INFO L129 PetriNetUnfolder]: 4/84 cut-off events. [2021-03-26 01:10:33,794 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-26 01:10:33,794 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 84 events. 4/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 224 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 38. Up to 10 conditions per place. [2021-03-26 01:10:33,794 INFO L142 LiptonReduction]: Number of co-enabled transitions 252 [2021-03-26 01:10:40,301 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2021-03-26 01:10:40,872 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2021-03-26 01:10:41,106 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2021-03-26 01:10:46,638 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-03-26 01:11:05,999 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2021-03-26 01:11:06,262 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2021-03-26 01:11:06,367 INFO L154 LiptonReduction]: Checked pairs total: 768 [2021-03-26 01:11:06,367 INFO L156 LiptonReduction]: Total number of compositions: 26 [2021-03-26 01:11:06,367 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 32582 [2021-03-26 01:11:06,369 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 37 transitions, 106 flow [2021-03-26 01:11:06,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 142.2) internal successors, (711), 5 states have internal predecessors, (711), 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 01:11:06,370 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 01:11:06,370 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 01:11:06,370 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 01:11:06,370 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 01:11:06,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 01:11:06,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1151715474, now seen corresponding path program 1 times [2021-03-26 01:11:06,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 01:11:06,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950079040] [2021-03-26 01:11:06,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 01:11:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 01:11:06,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 01:11:06,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 01:11:06,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 01:11:06,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 01:11:06,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 01:11:06,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 01:11:06,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 01:11:06,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 01:11:06,454 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 01:11:06,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950079040] [2021-03-26 01:11:06,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 01:11:06,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 01:11:06,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427821744] [2021-03-26 01:11:06,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 01:11:06,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 01:11:06,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 01:11:06,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 01:11:06,459 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 295 [2021-03-26 01:11:06,460 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 37 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 146.6) internal successors, (733), 5 states have internal predecessors, (733), 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 01:11:06,460 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 01:11:06,460 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 295 [2021-03-26 01:11:06,460 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 01:11:06,559 INFO L129 PetriNetUnfolder]: 171/331 cut-off events. [2021-03-26 01:11:06,559 INFO L130 PetriNetUnfolder]: For 50/54 co-relation queries the response was YES. [2021-03-26 01:11:06,560 INFO L84 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 331 events. 171/331 cut-off events. For 50/54 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1421 event pairs, 93 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 658. Up to 182 conditions per place. [2021-03-26 01:11:06,561 INFO L132 encePairwiseOnDemand]: 283/295 looper letters, 25 selfloop transitions, 11 changer transitions 1/46 dead transitions. [2021-03-26 01:11:06,561 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 197 flow [2021-03-26 01:11:06,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 01:11:06,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 01:11:06,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 763 transitions. [2021-03-26 01:11:06,564 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5172881355932203 [2021-03-26 01:11:06,564 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 763 transitions. [2021-03-26 01:11:06,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 763 transitions. [2021-03-26 01:11:06,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 01:11:06,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 763 transitions. [2021-03-26 01:11:06,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.6) internal successors, (763), 5 states have internal predecessors, (763), 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 01:11:06,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 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 01:11:06,571 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 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 01:11:06,571 INFO L185 Difference]: Start difference. First operand has 37 places, 37 transitions, 106 flow. Second operand 5 states and 763 transitions. [2021-03-26 01:11:06,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 197 flow [2021-03-26 01:11:06,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 46 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 01:11:06,572 INFO L241 Difference]: Finished difference. Result has 39 places, 38 transitions, 132 flow [2021-03-26 01:11:06,573 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=39, PETRI_TRANSITIONS=38} [2021-03-26 01:11:06,573 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -22 predicate places. [2021-03-26 01:11:06,573 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 01:11:06,573 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 38 transitions, 132 flow [2021-03-26 01:11:06,574 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 38 transitions, 132 flow [2021-03-26 01:11:06,574 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 38 transitions, 132 flow [2021-03-26 01:11:06,578 INFO L129 PetriNetUnfolder]: 5/53 cut-off events. [2021-03-26 01:11:06,578 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-03-26 01:11:06,578 INFO L84 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 53 events. 5/53 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 121 event pairs, 1 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 34. Up to 10 conditions per place. [2021-03-26 01:11:06,579 INFO L142 LiptonReduction]: Number of co-enabled transitions 158 [2021-03-26 01:11:06,681 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-03-26 01:11:06,865 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-26 01:11:06,983 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-26 01:11:07,101 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-26 01:11:07,216 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-26 01:11:07,357 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2021-03-26 01:11:07,474 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2021-03-26 01:11:10,348 WARN L205 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-26 01:11:10,555 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-03-26 01:11:10,998 WARN L205 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 127 [2021-03-26 01:11:11,150 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-26 01:11:12,045 WARN L205 SmtUtils]: Spent 766.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 162 [2021-03-26 01:11:12,368 WARN L205 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2021-03-26 01:11:13,067 WARN L205 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 169 [2021-03-26 01:11:13,380 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2021-03-26 01:11:13,386 INFO L154 LiptonReduction]: Checked pairs total: 444 [2021-03-26 01:11:13,386 INFO L156 LiptonReduction]: Total number of compositions: 8 [2021-03-26 01:11:13,386 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6813 [2021-03-26 01:11:13,387 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 122 flow [2021-03-26 01:11:13,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 146.6) internal successors, (733), 5 states have internal predecessors, (733), 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 01:11:13,388 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 01:11:13,388 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2021-03-26 01:11:13,388 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 01:11:13,388 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 01:11:13,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 01:11:13,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1328672246, now seen corresponding path program 1 times [2021-03-26 01:11:13,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 01:11:13,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872711196] [2021-03-26 01:11:13,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 01:11:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 01:11:13,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 01:11:13,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 01:11:13,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 01:11:13,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 01:11:13,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 01:11:13,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 01:11:13,443 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 01:11:13,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872711196] [2021-03-26 01:11:13,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 01:11:13,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 01:11:13,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164577414] [2021-03-26 01:11:13,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 01:11:13,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 01:11:13,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 01:11:13,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 01:11:13,446 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 303 [2021-03-26 01:11:13,446 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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 01:11:13,446 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 01:11:13,447 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 303 [2021-03-26 01:11:13,447 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 01:11:13,553 INFO L129 PetriNetUnfolder]: 241/453 cut-off events. [2021-03-26 01:11:13,553 INFO L130 PetriNetUnfolder]: For 81/85 co-relation queries the response was YES. [2021-03-26 01:11:13,555 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 453 events. 241/453 cut-off events. For 81/85 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2016 event pairs, 94 based on Foata normal form. 0/428 useless extension candidates. Maximal degree in co-relation 513. Up to 340 conditions per place. [2021-03-26 01:11:13,557 INFO L132 encePairwiseOnDemand]: 295/303 looper letters, 27 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2021-03-26 01:11:13,557 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 209 flow [2021-03-26 01:11:13,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 01:11:13,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 01:11:13,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 540 transitions. [2021-03-26 01:11:13,559 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.594059405940594 [2021-03-26 01:11:13,559 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 540 transitions. [2021-03-26 01:11:13,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 540 transitions. [2021-03-26 01:11:13,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 01:11:13,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 540 transitions. [2021-03-26 01:11:13,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 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 01:11:13,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 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 01:11:13,564 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 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 01:11:13,564 INFO L185 Difference]: Start difference. First operand has 34 places, 33 transitions, 122 flow. Second operand 3 states and 540 transitions. [2021-03-26 01:11:13,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 41 transitions, 209 flow [2021-03-26 01:11:13,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 41 transitions, 194 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 01:11:13,566 INFO L241 Difference]: Finished difference. Result has 34 places, 36 transitions, 145 flow [2021-03-26 01:11:13,566 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=34, PETRI_TRANSITIONS=36} [2021-03-26 01:11:13,566 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -27 predicate places. [2021-03-26 01:11:13,566 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 01:11:13,567 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 36 transitions, 145 flow [2021-03-26 01:11:13,567 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 36 transitions, 145 flow [2021-03-26 01:11:13,567 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 36 transitions, 145 flow [2021-03-26 01:11:13,578 INFO L129 PetriNetUnfolder]: 31/132 cut-off events. [2021-03-26 01:11:13,578 INFO L130 PetriNetUnfolder]: For 46/49 co-relation queries the response was YES. [2021-03-26 01:11:13,578 INFO L84 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 132 events. 31/132 cut-off events. For 46/49 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 620 event pairs, 15 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 150. Up to 54 conditions per place. [2021-03-26 01:11:13,579 INFO L142 LiptonReduction]: Number of co-enabled transitions 156 [2021-03-26 01:11:29,087 WARN L205 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 167 DAG size of output: 165 [2021-03-26 01:11:29,783 WARN L205 SmtUtils]: Spent 694.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2021-03-26 01:11:31,800 WARN L205 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 175 DAG size of output: 173 [2021-03-26 01:11:32,696 WARN L205 SmtUtils]: Spent 893.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2021-03-26 01:11:32,702 INFO L154 LiptonReduction]: Checked pairs total: 262 [2021-03-26 01:11:32,702 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 01:11:32,702 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 19136 [2021-03-26 01:11:32,703 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 35 transitions, 143 flow [2021-03-26 01:11:32,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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 01:11:32,704 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 01:11:32,704 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-03-26 01:11:32,704 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 01:11:32,704 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 01:11:32,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 01:11:32,704 INFO L82 PathProgramCache]: Analyzing trace with hash 519993322, now seen corresponding path program 1 times [2021-03-26 01:11:32,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 01:11:32,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844918887] [2021-03-26 01:11:32,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 01:11:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 01:11:32,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 01:11:32,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 01:11:32,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 01:11:32,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 01:11:32,757 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 01:11:32,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844918887] [2021-03-26 01:11:32,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 01:11:32,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 01:11:32,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81199010] [2021-03-26 01:11:32,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 01:11:32,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 01:11:32,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 01:11:32,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 01:11:32,760 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 304 [2021-03-26 01:11:32,761 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 35 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 01:11:32,761 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 01:11:32,761 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 304 [2021-03-26 01:11:32,761 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 01:11:32,897 INFO L129 PetriNetUnfolder]: 268/507 cut-off events. [2021-03-26 01:11:32,897 INFO L130 PetriNetUnfolder]: For 316/320 co-relation queries the response was YES. [2021-03-26 01:11:32,898 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 507 events. 268/507 cut-off events. For 316/320 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2440 event pairs, 106 based on Foata normal form. 32/534 useless extension candidates. Maximal degree in co-relation 722. Up to 376 conditions per place. [2021-03-26 01:11:32,900 INFO L132 encePairwiseOnDemand]: 298/304 looper letters, 27 selfloop transitions, 9 changer transitions 4/47 dead transitions. [2021-03-26 01:11:32,900 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 47 transitions, 277 flow [2021-03-26 01:11:32,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 01:11:32,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 01:11:32,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 538 transitions. [2021-03-26 01:11:32,903 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5899122807017544 [2021-03-26 01:11:32,903 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 538 transitions. [2021-03-26 01:11:32,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 538 transitions. [2021-03-26 01:11:32,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 01:11:32,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 538 transitions. [2021-03-26 01:11:32,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 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 01:11:32,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 304.0) internal successors, (1216), 4 states have internal predecessors, (1216), 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 01:11:32,907 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 304.0) internal successors, (1216), 4 states have internal predecessors, (1216), 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 01:11:32,907 INFO L185 Difference]: Start difference. First operand has 33 places, 35 transitions, 143 flow. Second operand 3 states and 538 transitions. [2021-03-26 01:11:32,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 47 transitions, 277 flow [2021-03-26 01:11:32,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 47 transitions, 262 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 01:11:32,909 INFO L241 Difference]: Finished difference. Result has 35 places, 39 transitions, 191 flow [2021-03-26 01:11:32,909 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=35, PETRI_TRANSITIONS=39} [2021-03-26 01:11:32,910 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -26 predicate places. [2021-03-26 01:11:32,910 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 01:11:32,910 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 39 transitions, 191 flow [2021-03-26 01:11:32,910 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 39 transitions, 191 flow [2021-03-26 01:11:32,910 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 39 transitions, 191 flow [2021-03-26 01:11:32,925 INFO L129 PetriNetUnfolder]: 74/206 cut-off events. [2021-03-26 01:11:32,925 INFO L130 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2021-03-26 01:11:32,925 INFO L84 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 206 events. 74/206 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1071 event pairs, 23 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 192. Up to 113 conditions per place. [2021-03-26 01:11:32,927 INFO L142 LiptonReduction]: Number of co-enabled transitions 148 [2021-03-26 01:11:35,385 INFO L154 LiptonReduction]: Checked pairs total: 421 [2021-03-26 01:11:35,385 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 01:11:35,386 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2476 [2021-03-26 01:11:35,387 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 38 transitions, 189 flow [2021-03-26 01:11:35,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 01:11:35,387 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 01:11:35,387 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 01:11:35,387 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 01:11:35,388 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 01:11:35,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 01:11:35,388 INFO L82 PathProgramCache]: Analyzing trace with hash 199178544, now seen corresponding path program 1 times [2021-03-26 01:11:35,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 01:11:35,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985774614] [2021-03-26 01:11:35,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 01:11:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 01:11:35,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 01:11:35,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 01:11:35,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 01:11:35,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 01:11:35,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 01:11:35,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 01:11:35,428 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 01:11:35,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985774614] [2021-03-26 01:11:35,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 01:11:35,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 01:11:35,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151326762] [2021-03-26 01:11:35,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 01:11:35,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 01:11:35,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 01:11:35,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 01:11:35,430 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 306 [2021-03-26 01:11:35,431 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 38 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 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 01:11:35,431 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 01:11:35,431 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 306 [2021-03-26 01:11:35,431 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 01:11:35,454 INFO L129 PetriNetUnfolder]: 6/41 cut-off events. [2021-03-26 01:11:35,454 INFO L130 PetriNetUnfolder]: For 40/49 co-relation queries the response was YES. [2021-03-26 01:11:35,454 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 41 events. 6/41 cut-off events. For 40/49 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 99 event pairs, 4 based on Foata normal form. 16/55 useless extension candidates. Maximal degree in co-relation 82. Up to 14 conditions per place. [2021-03-26 01:11:35,455 INFO L132 encePairwiseOnDemand]: 304/306 looper letters, 1 selfloop transitions, 1 changer transitions 0/21 dead transitions. [2021-03-26 01:11:35,455 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 86 flow [2021-03-26 01:11:35,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 01:11:35,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 01:11:35,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 738 transitions. [2021-03-26 01:11:35,457 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.803921568627451 [2021-03-26 01:11:35,457 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 738 transitions. [2021-03-26 01:11:35,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 738 transitions. [2021-03-26 01:11:35,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 01:11:35,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 738 transitions. [2021-03-26 01:11:35,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 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 01:11:35,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 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 01:11:35,462 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 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 01:11:35,462 INFO L185 Difference]: Start difference. First operand has 34 places, 38 transitions, 189 flow. Second operand 3 states and 738 transitions. [2021-03-26 01:11:35,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 86 flow [2021-03-26 01:11:35,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 21 transitions, 70 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-03-26 01:11:35,463 INFO L241 Difference]: Finished difference. Result has 26 places, 21 transitions, 68 flow [2021-03-26 01:11:35,463 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=26, PETRI_TRANSITIONS=21} [2021-03-26 01:11:35,463 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -35 predicate places. [2021-03-26 01:11:35,464 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 01:11:35,464 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 68 flow [2021-03-26 01:11:35,464 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 21 transitions, 68 flow [2021-03-26 01:11:35,464 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 68 flow [2021-03-26 01:11:35,468 INFO L129 PetriNetUnfolder]: 6/41 cut-off events. [2021-03-26 01:11:35,468 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 01:11:35,468 INFO L84 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 41 events. 6/41 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 102 event pairs, 4 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 14 conditions per place. [2021-03-26 01:11:35,469 INFO L142 LiptonReduction]: Number of co-enabled transitions 68 [2021-03-26 01:11:35,484 INFO L154 LiptonReduction]: Checked pairs total: 26 [2021-03-26 01:11:35,484 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 01:11:35,484 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-03-26 01:11:35,485 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 68 flow [2021-03-26 01:11:35,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 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 01:11:35,486 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 01:11:35,486 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 01:11:35,486 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 01:11:35,486 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 01:11:35,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 01:11:35,486 INFO L82 PathProgramCache]: Analyzing trace with hash 923373163, now seen corresponding path program 1 times [2021-03-26 01:11:35,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 01:11:35,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256763273] [2021-03-26 01:11:35,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 01:11:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 01:11:35,628 INFO L142 QuantifierPusher]: treesize reduction 12, result has 83.6 percent of original size [2021-03-26 01:11:35,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2021-03-26 01:11:35,660 INFO L142 QuantifierPusher]: treesize reduction 12, result has 81.5 percent of original size [2021-03-26 01:11:35,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-26 01:11:35,693 INFO L142 QuantifierPusher]: treesize reduction 20, result has 63.0 percent of original size [2021-03-26 01:11:35,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-26 01:11:35,714 INFO L142 QuantifierPusher]: treesize reduction 20, result has 58.3 percent of original size [2021-03-26 01:11:35,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 01:11:35,736 INFO L142 QuantifierPusher]: treesize reduction 18, result has 66.0 percent of original size [2021-03-26 01:11:35,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 01:11:35,757 INFO L142 QuantifierPusher]: treesize reduction 14, result has 70.2 percent of original size [2021-03-26 01:11:35,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 01:11:35,782 INFO L142 QuantifierPusher]: treesize reduction 44, result has 37.1 percent of original size [2021-03-26 01:11:35,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 01:11:35,817 INFO L142 QuantifierPusher]: treesize reduction 10, result has 64.3 percent of original size [2021-03-26 01:11:35,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 01:11:35,835 INFO L142 QuantifierPusher]: treesize reduction 10, result has 63.0 percent of original size [2021-03-26 01:11:35,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 01:11:35,854 INFO L142 QuantifierPusher]: treesize reduction 10, result has 63.0 percent of original size [2021-03-26 01:11:35,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 01:11:35,855 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 01:11:35,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256763273] [2021-03-26 01:11:35,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 01:11:35,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-26 01:11:35,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741175075] [2021-03-26 01:11:35,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-26 01:11:35,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 01:11:35,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-26 01:11:35,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-03-26 01:11:35,859 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 306 [2021-03-26 01:11:35,860 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 68 flow. Second operand has 11 states, 11 states have (on average 142.27272727272728) internal successors, (1565), 11 states have internal predecessors, (1565), 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 01:11:35,860 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 01:11:35,860 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 306 [2021-03-26 01:11:35,860 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 01:11:36,603 INFO L129 PetriNetUnfolder]: 67/178 cut-off events. [2021-03-26 01:11:36,603 INFO L130 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2021-03-26 01:11:36,603 INFO L84 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 178 events. 67/178 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 695 event pairs, 8 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 242. Up to 52 conditions per place. [2021-03-26 01:11:36,604 INFO L132 encePairwiseOnDemand]: 295/306 looper letters, 39 selfloop transitions, 27 changer transitions 0/70 dead transitions. [2021-03-26 01:11:36,604 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 70 transitions, 351 flow [2021-03-26 01:11:36,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-26 01:11:36,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-26 01:11:36,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1758 transitions. [2021-03-26 01:11:36,609 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.47875816993464054 [2021-03-26 01:11:36,610 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1758 transitions. [2021-03-26 01:11:36,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1758 transitions. [2021-03-26 01:11:36,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 01:11:36,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1758 transitions. [2021-03-26 01:11:36,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 146.5) internal successors, (1758), 12 states have internal predecessors, (1758), 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 01:11:36,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 306.0) internal successors, (3978), 13 states have internal predecessors, (3978), 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 01:11:36,619 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 306.0) internal successors, (3978), 13 states have internal predecessors, (3978), 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 01:11:36,619 INFO L185 Difference]: Start difference. First operand has 25 places, 21 transitions, 68 flow. Second operand 12 states and 1758 transitions. [2021-03-26 01:11:36,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 70 transitions, 351 flow [2021-03-26 01:11:36,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 70 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 01:11:36,621 INFO L241 Difference]: Finished difference. Result has 40 places, 49 transitions, 247 flow [2021-03-26 01:11:36,622 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=247, PETRI_PLACES=40, PETRI_TRANSITIONS=49} [2021-03-26 01:11:36,622 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -21 predicate places. [2021-03-26 01:11:36,622 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 01:11:36,622 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 49 transitions, 247 flow [2021-03-26 01:11:36,622 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 49 transitions, 247 flow [2021-03-26 01:11:36,623 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 49 transitions, 247 flow [2021-03-26 01:11:36,630 INFO L129 PetriNetUnfolder]: 21/98 cut-off events. [2021-03-26 01:11:36,630 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-03-26 01:11:36,631 INFO L84 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 98 events. 21/98 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 419 event pairs, 3 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 172. Up to 23 conditions per place. [2021-03-26 01:11:36,631 INFO L142 LiptonReduction]: Number of co-enabled transitions 88 [2021-03-26 01:11:39,095 INFO L154 LiptonReduction]: Checked pairs total: 168 [2021-03-26 01:11:39,095 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 01:11:39,095 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2473 [2021-03-26 01:11:39,096 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 49 transitions, 262 flow [2021-03-26 01:11:39,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 142.27272727272728) internal successors, (1565), 11 states have internal predecessors, (1565), 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 01:11:39,097 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 01:11:39,097 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 01:11:39,097 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 01:11:39,097 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 01:11:39,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 01:11:39,097 INFO L82 PathProgramCache]: Analyzing trace with hash 282653399, now seen corresponding path program 2 times [2021-03-26 01:11:39,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 01:11:39,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432967156] [2021-03-26 01:11:39,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 01:11:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 01:11:39,132 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 01:11:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 01:11:39,166 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 01:11:39,201 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 01:11:39,201 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 01:11:39,201 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 01:11:39,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 01:11:39 BasicIcfg [2021-03-26 01:11:39,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 01:11:39,261 INFO L168 Benchmark]: Toolchain (without parser) took 106403.51 ms. Allocated memory was 255.9 MB in the beginning and 453.0 MB in the end (delta: 197.1 MB). Free memory was 232.4 MB in the beginning and 272.8 MB in the end (delta: -40.5 MB). Peak memory consumption was 156.3 MB. Max. memory is 16.0 GB. [2021-03-26 01:11:39,261 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 255.9 MB. Free memory was 238.0 MB in the beginning and 238.0 MB in the end (delta: 26.2 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 01:11:39,262 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1183.46 ms. Allocated memory was 255.9 MB in the beginning and 375.4 MB in the end (delta: 119.5 MB). Free memory was 232.4 MB in the beginning and 352.8 MB in the end (delta: -120.5 MB). Peak memory consumption was 62.7 MB. Max. memory is 16.0 GB. [2021-03-26 01:11:39,262 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.49 ms. Allocated memory is still 375.4 MB. Free memory was 352.8 MB in the beginning and 349.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 01:11:39,262 INFO L168 Benchmark]: Boogie Preprocessor took 47.57 ms. Allocated memory is still 375.4 MB. Free memory was 349.7 MB in the beginning and 346.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 01:11:39,262 INFO L168 Benchmark]: RCFGBuilder took 795.82 ms. Allocated memory is still 375.4 MB. Free memory was 346.6 MB in the beginning and 298.3 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.0 GB. [2021-03-26 01:11:39,263 INFO L168 Benchmark]: TraceAbstraction took 104291.48 ms. Allocated memory was 375.4 MB in the beginning and 453.0 MB in the end (delta: 77.6 MB). Free memory was 298.3 MB in the beginning and 272.8 MB in the end (delta: 25.5 MB). Peak memory consumption was 104.1 MB. Max. memory is 16.0 GB. [2021-03-26 01:11:39,264 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.15 ms. Allocated memory is still 255.9 MB. Free memory was 238.0 MB in the beginning and 238.0 MB in the end (delta: 26.2 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 1183.46 ms. Allocated memory was 255.9 MB in the beginning and 375.4 MB in the end (delta: 119.5 MB). Free memory was 232.4 MB in the beginning and 352.8 MB in the end (delta: -120.5 MB). Peak memory consumption was 62.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 68.49 ms. Allocated memory is still 375.4 MB. Free memory was 352.8 MB in the beginning and 349.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 47.57 ms. Allocated memory is still 375.4 MB. Free memory was 349.7 MB in the beginning and 346.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 795.82 ms. Allocated memory is still 375.4 MB. Free memory was 346.6 MB in the beginning and 298.3 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 104291.48 ms. Allocated memory was 375.4 MB in the beginning and 453.0 MB in the end (delta: 77.6 MB). Free memory was 298.3 MB in the beginning and 272.8 MB in the end (delta: 25.5 MB). Peak memory consumption was 104.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 37831.5ms, 142 PlacesBefore, 61 PlacesAfterwards, 144 TransitionsBefore, 62 TransitionsAfterwards, 1512 CoEnabledTransitionPairs, 4 FixpointIterations, 63 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 113 TotalNumberOfCompositions, 1692 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 951, positive: 902, positive conditional: 902, positive unconditional: 0, negative: 49, negative conditional: 49, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 861, positive: 834, positive conditional: 0, positive unconditional: 834, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 861, positive: 834, positive conditional: 0, positive unconditional: 834, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 861, positive: 834, positive conditional: 0, positive unconditional: 834, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 27, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34514, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 671, negative conditional: 0, negative unconditional: 671, unknown: 33843, unknown conditional: 0, unknown unconditional: 33843] ], Cache Queries: [ total: 951, positive: 68, positive conditional: 68, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 861, unknown conditional: 861, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 6, Positive conditional cache size: 6, Positive unconditional cache size: 0, Negative cache size: 14, Negative conditional cache size: 14, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32581.4ms, 58 PlacesBefore, 37 PlacesAfterwards, 56 TransitionsBefore, 37 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 4 FixpointIterations, 20 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 26 TotalNumberOfCompositions, 768 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 187, positive: 124, positive conditional: 124, positive unconditional: 0, negative: 63, negative conditional: 63, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 101, positive: 78, positive conditional: 1, positive unconditional: 77, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 101, positive: 78, positive conditional: 1, positive unconditional: 77, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 101, positive: 77, positive conditional: 0, positive unconditional: 77, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 24, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29555, positive: 244, positive conditional: 0, positive unconditional: 244, negative: 553, negative conditional: 0, negative unconditional: 553, unknown: 28758, unknown conditional: 0, unknown unconditional: 28758] ], Cache Queries: [ total: 187, positive: 46, positive conditional: 46, positive unconditional: 0, negative: 40, negative conditional: 40, negative unconditional: 0, unknown: 101, unknown conditional: 101, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 21, Positive conditional cache size: 21, Positive unconditional cache size: 0, Negative cache size: 16, Negative conditional cache size: 16, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6812.3ms, 39 PlacesBefore, 34 PlacesAfterwards, 38 TransitionsBefore, 33 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 3 FixpointIterations, 7 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 444 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 79, positive: 30, positive conditional: 30, positive unconditional: 0, negative: 49, negative conditional: 49, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 1, positive unconditional: 3, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 1, positive unconditional: 3, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 1, negative conditional: 1, negative unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2152, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 2144, unknown conditional: 0, unknown unconditional: 2144] ], Cache Queries: [ total: 79, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 47, negative conditional: 47, negative unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 19, Positive conditional cache size: 19, Positive unconditional cache size: 0, Negative cache size: 18, Negative conditional cache size: 18, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19135.3ms, 34 PlacesBefore, 33 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 262 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 32, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 9, negative conditional: 4, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 9, negative conditional: 4, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 4, negative unconditional: 2, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13721, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 521, negative conditional: 434, negative unconditional: 86, unknown: 13200, unknown conditional: 0, unknown unconditional: 13200] ], Cache Queries: [ total: 32, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 20, Positive conditional cache size: 20, 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: 2475.4ms, 35 PlacesBefore, 34 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 421 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 68, positive: 44, positive conditional: 44, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 9, positive conditional: 1, positive unconditional: 8, negative: 11, negative conditional: 5, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 9, positive conditional: 1, positive unconditional: 8, negative: 11, negative conditional: 5, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 10, negative conditional: 5, negative unconditional: 5, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2263, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 143, negative conditional: 47, negative unconditional: 95, unknown: 2120, unknown conditional: 0, unknown unconditional: 2120] ], Cache Queries: [ total: 68, positive: 35, positive conditional: 35, 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): 55, Positive cache size: 22, Positive conditional cache size: 22, Positive unconditional cache size: 0, Negative cache size: 33, Negative conditional cache size: 33, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.2ms, 26 PlacesBefore, 25 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 68 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 26 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 4, negative conditional: 4, 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: 0, negative unconditional: 2, 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: 0, negative unconditional: 2, 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: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 22, Positive conditional cache size: 22, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2472.9ms, 40 PlacesBefore, 40 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 168 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 29, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 5, negative conditional: 3, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 5, negative conditional: 3, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 4, negative conditional: 3, negative unconditional: 1, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2073, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 43, negative conditional: 36, negative unconditional: 7, unknown: 2020, unknown conditional: 0, unknown unconditional: 2020] ], Cache Queries: [ total: 29, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 1, Positive conditional cache size: 1, Positive unconditional cache size: 0, Negative cache size: 22, Negative conditional cache size: 22, Negative unconditional cache size: 0 - CounterExampleResult [Line: 1675]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1676] 0 pthread_t t1,t2; [L1688] 0 struct device *my_dev; [L1727] 0 return 0; [L1733] 0 int ret = my_drv_init(); [L1734] COND TRUE 0 ret==0 [L1735] 0 int probe_ret; [L1736] 0 struct my_data data; [L1705] 0 data->shared.a = 0 [L1706] 0 data->shared.b = 0 [L1707] 0 data->shared.a [L1675] COND FALSE 0 !(!expression) [L1708] 0 data->shared.b [L1675] COND FALSE 0 !(!expression) [L1709] 0 int res = __VERIFIER_nondet_int(); [L1710] COND FALSE 0 !(\read(res)) [L1712] 0 my_dev = &data->dev [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, my_dev={5:24}, t1={9:0}, t2={7:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, my_dev={5:24}, t1={9:0}, t2={7:0}] [L1690] 1 struct my_data *data; [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1693] 1 data->shared.a = 1 VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1={9:0}, t2={7:0}] [L1696] EXPR 1 data->shared.b [L1696] 1 int lb = data->shared.b; [L1715] 0 return 0; [L1737] 0 probe_ret = my_drv_probe(&data) [L1738] COND TRUE 0 probe_ret==0 [L1721] 0 void *status; [L1722] 0 \read(t1) VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:24}, t1={9:0}, t2={7:0}] [L1690] 2 struct my_data *data; [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1693] 2 data->shared.a = 1 VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:24}, t1={9:0}, t2={7:0}] [L1696] EXPR 2 data->shared.b [L1696] 2 int lb = data->shared.b; [L1699] 1 data->shared.b = lb + 1 [L1701] 1 return 0; [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:24}, t1={9:0}, t2={7:0}] [L1723] 0 \read(t2) VAL [\result={0:0}, __mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:24}, t1={9:0}, t2={7:0}] [L1699] 2 data->shared.b = lb + 1 [L1701] 2 return 0; [L1723] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:24}, t1={9:0}, t2={7:0}] [L1740] 0 data.shared.a [L1675] COND FALSE 0 !(!expression) [L1741] 0 data.shared.b [L1675] COND TRUE 0 !expression [L1675] 0 reach_error() VAL [\result={0:0}, __mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:24}, t1={9:0}, t2={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 136 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 104088.0ms, OverallIterations: 7, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1444.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 37973.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 94 SDtfs, 111 SDslu, 42 SDs, 0 SdLazy, 469 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 586.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 577.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=6, InterpolantAutomatonStates: 31, 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: 14.0ms SsaConstructionTime, 162.0ms SatisfiabilityAnalysisTime, 685.0ms InterpolantComputationTime, 73 NumberOfCodeBlocks, 73 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 504 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...