/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 20:15:41,267 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 20:15:41,268 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 20:15:41,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 20:15:41,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 20:15:41,295 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 20:15:41,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 20:15:41,304 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 20:15:41,305 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 20:15:41,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 20:15:41,306 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 20:15:41,307 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 20:15:41,307 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 20:15:41,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 20:15:41,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 20:15:41,309 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 20:15:41,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 20:15:41,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 20:15:41,311 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 20:15:41,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 20:15:41,313 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 20:15:41,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 20:15:41,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 20:15:41,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 20:15:41,316 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 20:15:41,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 20:15:41,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 20:15:41,317 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 20:15:41,318 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 20:15:41,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 20:15:41,318 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 20:15:41,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 20:15:41,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 20:15:41,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 20:15:41,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 20:15:41,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 20:15:41,321 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 20:15:41,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 20:15:41,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 20:15:41,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 20:15:41,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 20:15:41,323 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-SemanticLbe.epf [2021-03-11 20:15:41,337 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 20:15:41,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 20:15:41,338 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 20:15:41,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 20:15:41,338 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 20:15:41,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 20:15:41,338 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 20:15:41,338 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 20:15:41,338 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 20:15:41,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 20:15:41,339 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 20:15:41,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 20:15:41,339 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 20:15:41,339 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 20:15:41,339 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 20:15:41,339 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 20:15:41,339 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 20:15:41,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 20:15:41,340 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 20:15:41,340 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 20:15:41,340 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 20:15:41,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:15:41,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 20:15:41,340 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 20:15:41,340 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 20:15:41,340 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 20:15:41,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 20:15:41,340 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 20:15:41,341 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-11 20:15:41,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 20:15:41,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 20:15:41,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 20:15:41,629 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 20:15:41,630 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 20:15:41,630 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_rmo.opt.i [2021-03-11 20:15:41,687 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73fe3275f/a60214902f3d4623a1a28a740861febf/FLAGf5e6ee5e7 [2021-03-11 20:15:42,131 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 20:15:42,132 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_rmo.opt.i [2021-03-11 20:15:42,141 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73fe3275f/a60214902f3d4623a1a28a740861febf/FLAGf5e6ee5e7 [2021-03-11 20:15:42,152 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73fe3275f/a60214902f3d4623a1a28a740861febf [2021-03-11 20:15:42,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 20:15:42,158 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 20:15:42,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 20:15:42,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 20:15:42,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 20:15:42,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:15:42" (1/1) ... [2021-03-11 20:15:42,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bac9a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:15:42, skipping insertion in model container [2021-03-11 20:15:42,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:15:42" (1/1) ... [2021-03-11 20:15:42,166 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 20:15:42,201 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 20:15:42,345 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_rmo.opt.i[948,961] [2021-03-11 20:15:42,523 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:15:42,533 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 20:15:42,542 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_rmo.opt.i[948,961] [2021-03-11 20:15:42,574 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:15:42,625 INFO L208 MainTranslator]: Completed translation [2021-03-11 20:15:42,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:15:42 WrapperNode [2021-03-11 20:15:42,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 20:15:42,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 20:15:42,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 20:15:42,630 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 20:15:42,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:15:42" (1/1) ... [2021-03-11 20:15:42,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:15:42" (1/1) ... [2021-03-11 20:15:42,675 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 20:15:42,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 20:15:42,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 20:15:42,676 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 20:15:42,680 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:15:42" (1/1) ... [2021-03-11 20:15:42,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:15:42" (1/1) ... [2021-03-11 20:15:42,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:15:42" (1/1) ... [2021-03-11 20:15:42,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:15:42" (1/1) ... [2021-03-11 20:15:42,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:15:42" (1/1) ... [2021-03-11 20:15:42,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:15:42" (1/1) ... [2021-03-11 20:15:42,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:15:42" (1/1) ... [2021-03-11 20:15:42,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 20:15:42,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 20:15:42,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 20:15:42,694 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 20:15:42,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:15:42" (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-11 20:15:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 20:15:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 20:15:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 20:15:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 20:15:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 20:15:42,756 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 20:15:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 20:15:42,757 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 20:15:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 20:15:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 20:15:42,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 20:15:42,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 20:15:42,759 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 20:15:43,970 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 20:15:43,970 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 20:15:43,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:15:43 BoogieIcfgContainer [2021-03-11 20:15:43,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 20:15:43,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 20:15:43,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 20:15:43,976 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 20:15:43,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 08:15:42" (1/3) ... [2021-03-11 20:15:43,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b9833e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:15:43, skipping insertion in model container [2021-03-11 20:15:43,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:15:42" (2/3) ... [2021-03-11 20:15:43,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b9833e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:15:43, skipping insertion in model container [2021-03-11 20:15:43,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:15:43" (3/3) ... [2021-03-11 20:15:43,978 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi000_rmo.opt.i [2021-03-11 20:15:43,982 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 20:15:43,985 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 20:15:43,986 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 20:15:44,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,014 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,014 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,014 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,014 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,014 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,014 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,014 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,014 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,014 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,014 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,016 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,017 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,017 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,017 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,017 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,018 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,018 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,018 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,018 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,018 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,018 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,018 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,019 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,019 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,020 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,020 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,020 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,020 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,020 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,020 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,020 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,022 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,023 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,023 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,026 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,026 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,028 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 20:15:44,041 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-11 20:15:44,061 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 20:15:44,061 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 20:15:44,061 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 20:15:44,061 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 20:15:44,062 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 20:15:44,062 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 20:15:44,062 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 20:15:44,062 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 20:15:44,072 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 83 transitions, 176 flow [2021-03-11 20:15:44,093 INFO L129 PetriNetUnfolder]: 2/81 cut-off events. [2021-03-11 20:15:44,093 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:15:44,095 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 2/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-03-11 20:15:44,095 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 83 transitions, 176 flow [2021-03-11 20:15:44,098 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 81 transitions, 168 flow [2021-03-11 20:15:44,100 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 20:15:44,106 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 81 transitions, 168 flow [2021-03-11 20:15:44,107 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 81 transitions, 168 flow [2021-03-11 20:15:44,108 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 81 transitions, 168 flow [2021-03-11 20:15:44,118 INFO L129 PetriNetUnfolder]: 2/81 cut-off events. [2021-03-11 20:15:44,118 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:15:44,118 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 2/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-03-11 20:15:44,119 INFO L116 LiptonReduction]: Number of co-enabled transitions 1046 [2021-03-11 20:15:45,577 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-03-11 20:15:45,971 WARN L205 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2021-03-11 20:15:46,105 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-11 20:15:47,457 WARN L205 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2021-03-11 20:15:47,746 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-11 20:15:49,044 WARN L205 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-11 20:15:49,618 WARN L205 SmtUtils]: Spent 566.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-11 20:15:50,302 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2021-03-11 20:15:50,480 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2021-03-11 20:15:50,800 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2021-03-11 20:15:50,914 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-11 20:15:51,162 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2021-03-11 20:15:51,275 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-11 20:15:51,277 INFO L131 LiptonReduction]: Checked pairs total: 3005 [2021-03-11 20:15:51,277 INFO L133 LiptonReduction]: Total number of compositions: 72 [2021-03-11 20:15:51,278 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7180 [2021-03-11 20:15:51,284 INFO L129 PetriNetUnfolder]: 0/8 cut-off events. [2021-03-11 20:15:51,284 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:15:51,284 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:15:51,285 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-03-11 20:15:51,285 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:15:51,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:15:51,288 INFO L82 PathProgramCache]: Analyzing trace with hash 887242843, now seen corresponding path program 1 times [2021-03-11 20:15:51,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:15:51,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584148339] [2021-03-11 20:15:51,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:15:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:15:51,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:51,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:15:51,458 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-11 20:15:51,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584148339] [2021-03-11 20:15:51,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:15:51,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:15:51,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16788243] [2021-03-11 20:15:51,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:15:51,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:15:51,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:15:51,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:15:51,473 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 155 [2021-03-11 20:15:51,475 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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-11 20:15:51,475 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:15:51,475 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 155 [2021-03-11 20:15:51,476 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:15:51,513 INFO L129 PetriNetUnfolder]: 16/62 cut-off events. [2021-03-11 20:15:51,513 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:15:51,514 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 62 events. 16/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 210 event pairs, 6 based on Foata normal form. 6/58 useless extension candidates. Maximal degree in co-relation 95. Up to 27 conditions per place. [2021-03-11 20:15:51,515 INFO L132 encePairwiseOnDemand]: 151/155 looper letters, 7 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2021-03-11 20:15:51,515 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 22 transitions, 68 flow [2021-03-11 20:15:51,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:15:51,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:15:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2021-03-11 20:15:51,523 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8516129032258064 [2021-03-11 20:15:51,524 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2021-03-11 20:15:51,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2021-03-11 20:15:51,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:15:51,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2021-03-11 20:15:51,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 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-11 20:15:51,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:15:51,533 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:15:51,534 INFO L185 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 396 transitions. [2021-03-11 20:15:51,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 22 transitions, 68 flow [2021-03-11 20:15:51,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 22 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:15:51,537 INFO L241 Difference]: Finished difference. Result has 26 places, 19 transitions, 46 flow [2021-03-11 20:15:51,538 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2021-03-11 20:15:51,539 INFO L335 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2021-03-11 20:15:51,539 INFO L480 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 46 flow [2021-03-11 20:15:51,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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-11 20:15:51,539 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:15:51,540 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:15:51,540 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 20:15:51,540 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:15:51,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:15:51,540 INFO L82 PathProgramCache]: Analyzing trace with hash 624883219, now seen corresponding path program 1 times [2021-03-11 20:15:51,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:15:51,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469803358] [2021-03-11 20:15:51,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:15:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:15:51,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:51,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:15:51,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:51,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:15:51,653 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-11 20:15:51,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469803358] [2021-03-11 20:15:51,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:15:51,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:15:51,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216409001] [2021-03-11 20:15:51,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:15:51,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:15:51,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:15:51,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:15:51,656 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 155 [2021-03-11 20:15:51,656 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 46 flow. Second operand has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 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-11 20:15:51,656 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:15:51,656 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 155 [2021-03-11 20:15:51,656 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:15:51,703 INFO L129 PetriNetUnfolder]: 40/116 cut-off events. [2021-03-11 20:15:51,703 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:15:51,703 INFO L84 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 116 events. 40/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 441 event pairs, 15 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 201. Up to 56 conditions per place. [2021-03-11 20:15:51,704 INFO L132 encePairwiseOnDemand]: 150/155 looper letters, 6 selfloop transitions, 3 changer transitions 10/30 dead transitions. [2021-03-11 20:15:51,704 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 30 transitions, 106 flow [2021-03-11 20:15:51,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:15:51,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:15:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 631 transitions. [2021-03-11 20:15:51,706 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8141935483870968 [2021-03-11 20:15:51,706 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 631 transitions. [2021-03-11 20:15:51,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 631 transitions. [2021-03-11 20:15:51,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:15:51,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 631 transitions. [2021-03-11 20:15:51,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 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-11 20:15:51,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:15:51,710 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:15:51,710 INFO L185 Difference]: Start difference. First operand has 26 places, 19 transitions, 46 flow. Second operand 5 states and 631 transitions. [2021-03-11 20:15:51,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 30 transitions, 106 flow [2021-03-11 20:15:51,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 30 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:15:51,711 INFO L241 Difference]: Finished difference. Result has 31 places, 20 transitions, 67 flow [2021-03-11 20:15:51,711 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=67, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2021-03-11 20:15:51,711 INFO L335 CegarLoopForPetriNet]: 27 programPoint places, 4 predicate places. [2021-03-11 20:15:51,711 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 67 flow [2021-03-11 20:15:51,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 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-11 20:15:51,712 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:15:51,712 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:15:51,712 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 20:15:51,712 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:15:51,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:15:51,712 INFO L82 PathProgramCache]: Analyzing trace with hash -2103489915, now seen corresponding path program 1 times [2021-03-11 20:15:51,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:15:51,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88275366] [2021-03-11 20:15:51,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:15:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:15:51,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:51,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:15:51,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:51,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:15:51,808 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-11 20:15:51,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88275366] [2021-03-11 20:15:51,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:15:51,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:15:51,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137195050] [2021-03-11 20:15:51,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:15:51,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:15:51,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:15:51,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:15:51,810 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 155 [2021-03-11 20:15:51,811 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 67 flow. Second operand has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:15:51,811 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:15:51,811 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 155 [2021-03-11 20:15:51,811 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:15:51,831 INFO L129 PetriNetUnfolder]: 5/41 cut-off events. [2021-03-11 20:15:51,832 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-03-11 20:15:51,832 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 41 events. 5/41 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 104 event pairs, 1 based on Foata normal form. 5/45 useless extension candidates. Maximal degree in co-relation 77. Up to 14 conditions per place. [2021-03-11 20:15:51,832 INFO L132 encePairwiseOnDemand]: 151/155 looper letters, 2 selfloop transitions, 2 changer transitions 2/22 dead transitions. [2021-03-11 20:15:51,832 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 22 transitions, 85 flow [2021-03-11 20:15:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:15:51,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:15:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 633 transitions. [2021-03-11 20:15:51,834 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8167741935483871 [2021-03-11 20:15:51,834 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 633 transitions. [2021-03-11 20:15:51,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 633 transitions. [2021-03-11 20:15:51,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:15:51,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 633 transitions. [2021-03-11 20:15:51,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 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-11 20:15:51,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:15:51,836 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:15:51,837 INFO L185 Difference]: Start difference. First operand has 31 places, 20 transitions, 67 flow. Second operand 5 states and 633 transitions. [2021-03-11 20:15:51,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 22 transitions, 85 flow [2021-03-11 20:15:51,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 22 transitions, 78 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-11 20:15:51,838 INFO L241 Difference]: Finished difference. Result has 33 places, 20 transitions, 72 flow [2021-03-11 20:15:51,838 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=33, PETRI_TRANSITIONS=20} [2021-03-11 20:15:51,838 INFO L335 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2021-03-11 20:15:51,838 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 20 transitions, 72 flow [2021-03-11 20:15:51,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:15:51,838 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:15:51,838 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:15:51,838 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 20:15:51,839 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:15:51,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:15:51,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1157543222, now seen corresponding path program 1 times [2021-03-11 20:15:51,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:15:51,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356171812] [2021-03-11 20:15:51,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:15:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:15:51,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:51,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:15:51,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:51,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:15:51,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:51,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:15:51,953 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-11 20:15:51,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356171812] [2021-03-11 20:15:51,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:15:51,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:15:51,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178979476] [2021-03-11 20:15:51,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:15:51,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:15:51,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:15:51,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:15:51,954 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 155 [2021-03-11 20:15:51,955 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 20 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:15:51,955 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:15:51,955 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 155 [2021-03-11 20:15:51,955 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:15:51,993 INFO L129 PetriNetUnfolder]: 7/56 cut-off events. [2021-03-11 20:15:51,993 INFO L130 PetriNetUnfolder]: For 47/49 co-relation queries the response was YES. [2021-03-11 20:15:51,993 INFO L84 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 56 events. 7/56 cut-off events. For 47/49 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 188 event pairs, 0 based on Foata normal form. 6/62 useless extension candidates. Maximal degree in co-relation 120. Up to 15 conditions per place. [2021-03-11 20:15:51,993 INFO L132 encePairwiseOnDemand]: 151/155 looper letters, 7 selfloop transitions, 2 changer transitions 6/26 dead transitions. [2021-03-11 20:15:51,993 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 26 transitions, 125 flow [2021-03-11 20:15:51,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:15:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:15:51,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 626 transitions. [2021-03-11 20:15:51,995 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.807741935483871 [2021-03-11 20:15:51,995 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 626 transitions. [2021-03-11 20:15:51,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 626 transitions. [2021-03-11 20:15:51,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:15:51,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 626 transitions. [2021-03-11 20:15:51,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 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-11 20:15:51,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:15:51,998 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:15:51,998 INFO L185 Difference]: Start difference. First operand has 33 places, 20 transitions, 72 flow. Second operand 5 states and 626 transitions. [2021-03-11 20:15:51,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 26 transitions, 125 flow [2021-03-11 20:15:51,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 26 transitions, 111 flow, removed 4 selfloop flow, removed 4 redundant places. [2021-03-11 20:15:51,999 INFO L241 Difference]: Finished difference. Result has 34 places, 18 transitions, 66 flow [2021-03-11 20:15:51,999 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=34, PETRI_TRANSITIONS=18} [2021-03-11 20:15:51,999 INFO L335 CegarLoopForPetriNet]: 27 programPoint places, 7 predicate places. [2021-03-11 20:15:51,999 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 18 transitions, 66 flow [2021-03-11 20:15:52,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:15:52,000 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:15:52,000 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:15:52,000 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 20:15:52,000 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:15:52,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:15:52,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1540654328, now seen corresponding path program 1 times [2021-03-11 20:15:52,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:15:52,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369869835] [2021-03-11 20:15:52,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:15:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:15:52,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:15:52,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:15:52,039 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-11 20:15:52,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369869835] [2021-03-11 20:15:52,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:15:52,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:15:52,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100273898] [2021-03-11 20:15:52,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:15:52,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:15:52,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:15:52,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:15:52,041 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 155 [2021-03-11 20:15:52,042 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 18 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:15:52,042 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:15:52,042 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 155 [2021-03-11 20:15:52,042 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:15:52,060 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-11 20:15:52,060 INFO L130 PetriNetUnfolder]: For 28/30 co-relation queries the response was YES. [2021-03-11 20:15:52,061 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 22 events. 0/22 cut-off events. For 28/30 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 2/24 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2021-03-11 20:15:52,061 INFO L132 encePairwiseOnDemand]: 151/155 looper letters, 2 selfloop transitions, 2 changer transitions 2/20 dead transitions. [2021-03-11 20:15:52,061 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 20 transitions, 88 flow [2021-03-11 20:15:52,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:15:52,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:15:52,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 633 transitions. [2021-03-11 20:15:52,062 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8167741935483871 [2021-03-11 20:15:52,062 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 633 transitions. [2021-03-11 20:15:52,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 633 transitions. [2021-03-11 20:15:52,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:15:52,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 633 transitions. [2021-03-11 20:15:52,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 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-11 20:15:52,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:15:52,065 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:15:52,065 INFO L185 Difference]: Start difference. First operand has 34 places, 18 transitions, 66 flow. Second operand 5 states and 633 transitions. [2021-03-11 20:15:52,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 20 transitions, 88 flow [2021-03-11 20:15:52,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 20 transitions, 74 flow, removed 4 selfloop flow, removed 6 redundant places. [2021-03-11 20:15:52,066 INFO L241 Difference]: Finished difference. Result has 33 places, 18 transitions, 64 flow [2021-03-11 20:15:52,066 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=64, PETRI_PLACES=33, PETRI_TRANSITIONS=18} [2021-03-11 20:15:52,067 INFO L335 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2021-03-11 20:15:52,067 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 18 transitions, 64 flow [2021-03-11 20:15:52,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:15:52,067 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:15:52,067 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:15:52,067 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 20:15:52,067 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:15:52,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:15:52,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1489068270, now seen corresponding path program 1 times [2021-03-11 20:15:52,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:15:52,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325439114] [2021-03-11 20:15:52,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:15:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:15:52,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:15:52,115 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-11 20:15:52,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-11 20:15:52,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:15:52,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:15:52,146 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-11 20:15:52,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325439114] [2021-03-11 20:15:52,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:15:52,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:15:52,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10513941] [2021-03-11 20:15:52,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:15:52,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:15:52,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:15:52,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:15:52,148 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 155 [2021-03-11 20:15:52,148 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 18 transitions, 64 flow. Second operand has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 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-11 20:15:52,148 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:15:52,148 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 155 [2021-03-11 20:15:52,148 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:15:52,226 INFO L129 PetriNetUnfolder]: 22/72 cut-off events. [2021-03-11 20:15:52,226 INFO L130 PetriNetUnfolder]: For 83/85 co-relation queries the response was YES. [2021-03-11 20:15:52,226 INFO L84 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 72 events. 22/72 cut-off events. For 83/85 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 223 event pairs, 11 based on Foata normal form. 7/77 useless extension candidates. Maximal degree in co-relation 163. Up to 40 conditions per place. [2021-03-11 20:15:52,226 INFO L132 encePairwiseOnDemand]: 149/155 looper letters, 8 selfloop transitions, 4 changer transitions 6/28 dead transitions. [2021-03-11 20:15:52,227 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 28 transitions, 128 flow [2021-03-11 20:15:52,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:15:52,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:15:52,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 638 transitions. [2021-03-11 20:15:52,228 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6860215053763441 [2021-03-11 20:15:52,229 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 638 transitions. [2021-03-11 20:15:52,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 638 transitions. [2021-03-11 20:15:52,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:15:52,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 638 transitions. [2021-03-11 20:15:52,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.33333333333333) internal successors, (638), 6 states have internal predecessors, (638), 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-11 20:15:52,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 155.0) internal successors, (1085), 7 states have internal predecessors, (1085), 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-11 20:15:52,231 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 155.0) internal successors, (1085), 7 states have internal predecessors, (1085), 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-11 20:15:52,231 INFO L185 Difference]: Start difference. First operand has 33 places, 18 transitions, 64 flow. Second operand 6 states and 638 transitions. [2021-03-11 20:15:52,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 28 transitions, 128 flow [2021-03-11 20:15:52,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 28 transitions, 108 flow, removed 6 selfloop flow, removed 6 redundant places. [2021-03-11 20:15:52,233 INFO L241 Difference]: Finished difference. Result has 33 places, 20 transitions, 77 flow [2021-03-11 20:15:52,233 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=77, PETRI_PLACES=33, PETRI_TRANSITIONS=20} [2021-03-11 20:15:52,233 INFO L335 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2021-03-11 20:15:52,233 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 20 transitions, 77 flow [2021-03-11 20:15:52,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 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-11 20:15:52,233 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:15:52,233 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:15:52,233 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 20:15:52,234 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:15:52,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:15:52,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1160473120, now seen corresponding path program 1 times [2021-03-11 20:15:52,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:15:52,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788157909] [2021-03-11 20:15:52,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:15:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:15:52,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:15:52,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:15:52,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:15:52,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:15:52,291 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-11 20:15:52,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788157909] [2021-03-11 20:15:52,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:15:52,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:15:52,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295090923] [2021-03-11 20:15:52,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:15:52,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:15:52,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:15:52,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:15:52,293 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 155 [2021-03-11 20:15:52,294 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 20 transitions, 77 flow. Second operand has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 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-11 20:15:52,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:15:52,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 155 [2021-03-11 20:15:52,294 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:15:52,328 INFO L129 PetriNetUnfolder]: 9/51 cut-off events. [2021-03-11 20:15:52,328 INFO L130 PetriNetUnfolder]: For 53/54 co-relation queries the response was YES. [2021-03-11 20:15:52,329 INFO L84 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 51 events. 9/51 cut-off events. For 53/54 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 161 event pairs, 3 based on Foata normal form. 4/55 useless extension candidates. Maximal degree in co-relation 131. Up to 22 conditions per place. [2021-03-11 20:15:52,329 INFO L132 encePairwiseOnDemand]: 151/155 looper letters, 7 selfloop transitions, 1 changer transitions 3/24 dead transitions. [2021-03-11 20:15:52,329 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 115 flow [2021-03-11 20:15:52,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:15:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:15:52,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2021-03-11 20:15:52,330 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7638709677419355 [2021-03-11 20:15:52,330 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 592 transitions. [2021-03-11 20:15:52,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 592 transitions. [2021-03-11 20:15:52,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:15:52,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 592 transitions. [2021-03-11 20:15:52,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:15:52,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:15:52,333 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:15:52,333 INFO L185 Difference]: Start difference. First operand has 33 places, 20 transitions, 77 flow. Second operand 5 states and 592 transitions. [2021-03-11 20:15:52,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 115 flow [2021-03-11 20:15:52,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 108 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-11 20:15:52,335 INFO L241 Difference]: Finished difference. Result has 35 places, 20 transitions, 79 flow [2021-03-11 20:15:52,336 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=79, PETRI_PLACES=35, PETRI_TRANSITIONS=20} [2021-03-11 20:15:52,336 INFO L335 CegarLoopForPetriNet]: 27 programPoint places, 8 predicate places. [2021-03-11 20:15:52,337 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 20 transitions, 79 flow [2021-03-11 20:15:52,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 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-11 20:15:52,337 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:15:52,337 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:15:52,337 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 20:15:52,337 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:15:52,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:15:52,337 INFO L82 PathProgramCache]: Analyzing trace with hash 571341088, now seen corresponding path program 2 times [2021-03-11 20:15:52,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:15:52,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596601649] [2021-03-11 20:15:52,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:15:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:15:52,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:15:52,398 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-03-11 20:15:52,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-11 20:15:52,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:15:52,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:15:52,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:15:52,421 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-11 20:15:52,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596601649] [2021-03-11 20:15:52,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:15:52,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:15:52,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418179517] [2021-03-11 20:15:52,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:15:52,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:15:52,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:15:52,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:15:52,423 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 155 [2021-03-11 20:15:52,423 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 20 transitions, 79 flow. Second operand has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 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-11 20:15:52,423 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:15:52,423 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 155 [2021-03-11 20:15:52,424 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:15:52,509 INFO L129 PetriNetUnfolder]: 22/75 cut-off events. [2021-03-11 20:15:52,509 INFO L130 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2021-03-11 20:15:52,510 INFO L84 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 75 events. 22/75 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 235 event pairs, 7 based on Foata normal form. 5/77 useless extension candidates. Maximal degree in co-relation 204. Up to 36 conditions per place. [2021-03-11 20:15:52,511 INFO L132 encePairwiseOnDemand]: 148/155 looper letters, 9 selfloop transitions, 6 changer transitions 5/30 dead transitions. [2021-03-11 20:15:52,511 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 30 transitions, 163 flow [2021-03-11 20:15:52,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:15:52,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:15:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 755 transitions. [2021-03-11 20:15:52,513 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.695852534562212 [2021-03-11 20:15:52,513 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 755 transitions. [2021-03-11 20:15:52,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 755 transitions. [2021-03-11 20:15:52,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:15:52,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 755 transitions. [2021-03-11 20:15:52,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.85714285714286) internal successors, (755), 7 states have internal predecessors, (755), 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-11 20:15:52,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 155.0) internal successors, (1240), 8 states have internal predecessors, (1240), 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-11 20:15:52,516 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 155.0) internal successors, (1240), 8 states have internal predecessors, (1240), 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-11 20:15:52,516 INFO L185 Difference]: Start difference. First operand has 35 places, 20 transitions, 79 flow. Second operand 7 states and 755 transitions. [2021-03-11 20:15:52,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 30 transitions, 163 flow [2021-03-11 20:15:52,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 30 transitions, 154 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-03-11 20:15:52,519 INFO L241 Difference]: Finished difference. Result has 39 places, 22 transitions, 112 flow [2021-03-11 20:15:52,519 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=112, PETRI_PLACES=39, PETRI_TRANSITIONS=22} [2021-03-11 20:15:52,519 INFO L335 CegarLoopForPetriNet]: 27 programPoint places, 12 predicate places. [2021-03-11 20:15:52,519 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 22 transitions, 112 flow [2021-03-11 20:15:52,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 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-11 20:15:52,519 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:15:52,519 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:15:52,519 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 20:15:52,520 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:15:52,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:15:52,520 INFO L82 PathProgramCache]: Analyzing trace with hash -373378611, now seen corresponding path program 1 times [2021-03-11 20:15:52,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:15:52,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106767275] [2021-03-11 20:15:52,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:15:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:15:52,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:15:52,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:15:52,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:15:52,591 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-11 20:15:52,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106767275] [2021-03-11 20:15:52,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:15:52,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:15:52,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720569261] [2021-03-11 20:15:52,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:15:52,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:15:52,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:15:52,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:15:52,595 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 155 [2021-03-11 20:15:52,595 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 22 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 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-11 20:15:52,595 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:15:52,595 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 155 [2021-03-11 20:15:52,595 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:15:52,619 INFO L129 PetriNetUnfolder]: 14/70 cut-off events. [2021-03-11 20:15:52,619 INFO L130 PetriNetUnfolder]: For 91/94 co-relation queries the response was YES. [2021-03-11 20:15:52,620 INFO L84 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 70 events. 14/70 cut-off events. For 91/94 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 223 event pairs, 5 based on Foata normal form. 7/76 useless extension candidates. Maximal degree in co-relation 193. Up to 25 conditions per place. [2021-03-11 20:15:52,620 INFO L132 encePairwiseOnDemand]: 150/155 looper letters, 4 selfloop transitions, 5 changer transitions 3/29 dead transitions. [2021-03-11 20:15:52,620 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 29 transitions, 150 flow [2021-03-11 20:15:52,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:15:52,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:15:52,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 624 transitions. [2021-03-11 20:15:52,622 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8051612903225807 [2021-03-11 20:15:52,622 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 624 transitions. [2021-03-11 20:15:52,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 624 transitions. [2021-03-11 20:15:52,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:15:52,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 624 transitions. [2021-03-11 20:15:52,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 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-11 20:15:52,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:15:52,624 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:15:52,624 INFO L185 Difference]: Start difference. First operand has 39 places, 22 transitions, 112 flow. Second operand 5 states and 624 transitions. [2021-03-11 20:15:52,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 29 transitions, 150 flow [2021-03-11 20:15:52,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 138 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-11 20:15:52,626 INFO L241 Difference]: Finished difference. Result has 40 places, 26 transitions, 137 flow [2021-03-11 20:15:52,626 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2021-03-11 20:15:52,626 INFO L335 CegarLoopForPetriNet]: 27 programPoint places, 13 predicate places. [2021-03-11 20:15:52,626 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 137 flow [2021-03-11 20:15:52,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 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-11 20:15:52,627 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:15:52,627 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:15:52,627 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 20:15:52,627 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:15:52,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:15:52,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1904434113, now seen corresponding path program 1 times [2021-03-11 20:15:52,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:15:52,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683947097] [2021-03-11 20:15:52,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:15:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:15:52,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:15:52,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:15:52,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:15:52,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:15:52,689 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-11 20:15:52,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683947097] [2021-03-11 20:15:52,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:15:52,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:15:52,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57252606] [2021-03-11 20:15:52,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:15:52,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:15:52,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:15:52,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:15:52,691 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 155 [2021-03-11 20:15:52,691 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 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-11 20:15:52,692 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:15:52,692 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 155 [2021-03-11 20:15:52,692 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:15:52,730 INFO L129 PetriNetUnfolder]: 17/105 cut-off events. [2021-03-11 20:15:52,730 INFO L130 PetriNetUnfolder]: For 208/220 co-relation queries the response was YES. [2021-03-11 20:15:52,731 INFO L84 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 105 events. 17/105 cut-off events. For 208/220 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 480 event pairs, 6 based on Foata normal form. 12/115 useless extension candidates. Maximal degree in co-relation 338. Up to 30 conditions per place. [2021-03-11 20:15:52,731 INFO L132 encePairwiseOnDemand]: 151/155 looper letters, 6 selfloop transitions, 1 changer transitions 2/28 dead transitions. [2021-03-11 20:15:52,731 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 28 transitions, 168 flow [2021-03-11 20:15:52,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:15:52,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:15:52,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2021-03-11 20:15:52,733 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7612903225806451 [2021-03-11 20:15:52,733 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 590 transitions. [2021-03-11 20:15:52,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 590 transitions. [2021-03-11 20:15:52,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:15:52,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 590 transitions. [2021-03-11 20:15:52,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 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-11 20:15:52,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:15:52,736 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:15:52,737 INFO L185 Difference]: Start difference. First operand has 40 places, 26 transitions, 137 flow. Second operand 5 states and 590 transitions. [2021-03-11 20:15:52,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 28 transitions, 168 flow [2021-03-11 20:15:52,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 28 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-11 20:15:52,738 INFO L241 Difference]: Finished difference. Result has 47 places, 26 transitions, 146 flow [2021-03-11 20:15:52,739 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=47, PETRI_TRANSITIONS=26} [2021-03-11 20:15:52,739 INFO L335 CegarLoopForPetriNet]: 27 programPoint places, 20 predicate places. [2021-03-11 20:15:52,739 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 26 transitions, 146 flow [2021-03-11 20:15:52,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 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-11 20:15:52,739 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:15:52,739 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:15:52,740 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 20:15:52,740 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:15:52,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:15:52,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1427865755, now seen corresponding path program 2 times [2021-03-11 20:15:52,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:15:52,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445680621] [2021-03-11 20:15:52,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:15:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:15:52,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:15:52,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:15:52,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:15:52,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:15:52,800 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-11 20:15:52,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445680621] [2021-03-11 20:15:52,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:15:52,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:15:52,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645341286] [2021-03-11 20:15:52,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:15:52,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:15:52,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:15:52,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:15:52,801 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 155 [2021-03-11 20:15:52,802 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 26 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 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-11 20:15:52,802 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:15:52,802 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 155 [2021-03-11 20:15:52,802 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:15:52,835 INFO L129 PetriNetUnfolder]: 4/48 cut-off events. [2021-03-11 20:15:52,835 INFO L130 PetriNetUnfolder]: For 77/96 co-relation queries the response was YES. [2021-03-11 20:15:52,835 INFO L84 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 48 events. 4/48 cut-off events. For 77/96 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 0 based on Foata normal form. 26/74 useless extension candidates. Maximal degree in co-relation 153. Up to 18 conditions per place. [2021-03-11 20:15:52,835 INFO L132 encePairwiseOnDemand]: 150/155 looper letters, 2 selfloop transitions, 8 changer transitions 2/29 dead transitions. [2021-03-11 20:15:52,835 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 29 transitions, 184 flow [2021-03-11 20:15:52,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:15:52,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:15:52,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 868 transitions. [2021-03-11 20:15:52,837 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8 [2021-03-11 20:15:52,837 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 868 transitions. [2021-03-11 20:15:52,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 868 transitions. [2021-03-11 20:15:52,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:15:52,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 868 transitions. [2021-03-11 20:15:52,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 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-11 20:15:52,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 155.0) internal successors, (1240), 8 states have internal predecessors, (1240), 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-11 20:15:52,840 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 155.0) internal successors, (1240), 8 states have internal predecessors, (1240), 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-11 20:15:52,840 INFO L185 Difference]: Start difference. First operand has 47 places, 26 transitions, 146 flow. Second operand 7 states and 868 transitions. [2021-03-11 20:15:52,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 29 transitions, 184 flow [2021-03-11 20:15:52,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 29 transitions, 153 flow, removed 13 selfloop flow, removed 7 redundant places. [2021-03-11 20:15:52,842 INFO L241 Difference]: Finished difference. Result has 47 places, 27 transitions, 148 flow [2021-03-11 20:15:52,842 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=148, PETRI_PLACES=47, PETRI_TRANSITIONS=27} [2021-03-11 20:15:52,843 INFO L335 CegarLoopForPetriNet]: 27 programPoint places, 20 predicate places. [2021-03-11 20:15:52,843 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 27 transitions, 148 flow [2021-03-11 20:15:52,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 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-11 20:15:52,843 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:15:52,843 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:15:52,843 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 20:15:52,843 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:15:52,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:15:52,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1020381689, now seen corresponding path program 1 times [2021-03-11 20:15:52,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:15:52,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354881326] [2021-03-11 20:15:52,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:15:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:15:52,870 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:15:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:15:52,914 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:15:52,943 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 20:15:52,943 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 20:15:52,943 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 20:15:53,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 08:15:53 BasicIcfg [2021-03-11 20:15:53,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 20:15:53,003 INFO L168 Benchmark]: Toolchain (without parser) took 10847.58 ms. Allocated memory was 358.6 MB in the beginning and 536.9 MB in the end (delta: 178.3 MB). Free memory was 321.7 MB in the beginning and 236.6 MB in the end (delta: 85.1 MB). Peak memory consumption was 265.2 MB. Max. memory is 16.0 GB. [2021-03-11 20:15:53,003 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 358.6 MB. Free memory was 340.1 MB in the beginning and 340.0 MB in the end (delta: 69.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 20:15:53,003 INFO L168 Benchmark]: CACSL2BoogieTranslator took 469.43 ms. Allocated memory is still 358.6 MB. Free memory was 321.1 MB in the beginning and 319.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 8.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:15:53,004 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.04 ms. Allocated memory is still 358.6 MB. Free memory was 319.7 MB in the beginning and 317.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:15:53,004 INFO L168 Benchmark]: Boogie Preprocessor took 17.68 ms. Allocated memory is still 358.6 MB. Free memory was 317.6 MB in the beginning and 315.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:15:53,004 INFO L168 Benchmark]: RCFGBuilder took 1278.22 ms. Allocated memory is still 358.6 MB. Free memory was 315.5 MB in the beginning and 299.3 MB in the end (delta: 16.2 MB). Peak memory consumption was 169.9 MB. Max. memory is 16.0 GB. [2021-03-11 20:15:53,004 INFO L168 Benchmark]: TraceAbstraction took 9028.42 ms. Allocated memory was 358.6 MB in the beginning and 536.9 MB in the end (delta: 178.3 MB). Free memory was 299.3 MB in the beginning and 236.6 MB in the end (delta: 62.6 MB). Peak memory consumption was 240.9 MB. Max. memory is 16.0 GB. [2021-03-11 20:15:53,007 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.10 ms. Allocated memory is still 358.6 MB. Free memory was 340.1 MB in the beginning and 340.0 MB in the end (delta: 69.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 469.43 ms. Allocated memory is still 358.6 MB. Free memory was 321.1 MB in the beginning and 319.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 8.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 46.04 ms. Allocated memory is still 358.6 MB. Free memory was 319.7 MB in the beginning and 317.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 17.68 ms. Allocated memory is still 358.6 MB. Free memory was 317.6 MB in the beginning and 315.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1278.22 ms. Allocated memory is still 358.6 MB. Free memory was 315.5 MB in the beginning and 299.3 MB in the end (delta: 16.2 MB). Peak memory consumption was 169.9 MB. Max. memory is 16.0 GB. * TraceAbstraction took 9028.42 ms. Allocated memory was 358.6 MB in the beginning and 536.9 MB in the end (delta: 178.3 MB). Free memory was 299.3 MB in the beginning and 236.6 MB in the end (delta: 62.6 MB). Peak memory consumption was 240.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7170.0ms, 86 PlacesBefore, 27 PlacesAfterwards, 81 TransitionsBefore, 21 TransitionsAfterwards, 1046 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 72 TotalNumberOfCompositions, 3005 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1192, positive: 1055, positive conditional: 0, positive unconditional: 1055, negative: 137, negative conditional: 0, negative unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 740, positive: 697, positive conditional: 0, positive unconditional: 697, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 740, positive: 680, positive conditional: 0, positive unconditional: 680, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 748, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 720, negative conditional: 0, negative unconditional: 720, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1192, positive: 358, positive conditional: 0, positive unconditional: 358, negative: 94, negative conditional: 0, negative unconditional: 94, unknown: 740, unknown conditional: 0, unknown unconditional: 740] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 65, Positive conditional cache size: 0, Positive unconditional cache size: 65, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L800] 0 pthread_t t1595; [L801] FCALL, FORK 0 pthread_create(&t1595, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] 0 pthread_t t1596; [L803] FCALL, FORK 0 pthread_create(&t1596, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L805] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L813] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L816] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 0 x$flush_delayed = weak$$choice2 [L819] 0 x$mem_tmp = x [L820] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L820] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L821] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L821] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L822] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L822] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L823] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L823] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L824] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L824] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L825] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L826] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L828] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L828] 0 x = x$flush_delayed ? x$mem_tmp : x [L829] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 82 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 8887.0ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 575.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7220.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 56 SDtfs, 41 SDslu, 55 SDs, 0 SdLazy, 193 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 185.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 208.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=11, InterpolantAutomatonStates: 58, 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: 36.1ms SsaConstructionTime, 387.2ms SatisfiabilityAnalysisTime, 439.9ms InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 504 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...