/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/mix030_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 20:07:01,460 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 20:07:01,462 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 20:07:01,487 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 20:07:01,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 20:07:01,489 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 20:07:01,490 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 20:07:01,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 20:07:01,496 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 20:07:01,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 20:07:01,497 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 20:07:01,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 20:07:01,499 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 20:07:01,500 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 20:07:01,500 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 20:07:01,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 20:07:01,502 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 20:07:01,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 20:07:01,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 20:07:01,506 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 20:07:01,507 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 20:07:01,508 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 20:07:01,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 20:07:01,510 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 20:07:01,512 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 20:07:01,512 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 20:07:01,512 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 20:07:01,513 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 20:07:01,514 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 20:07:01,514 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 20:07:01,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 20:07:01,515 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 20:07:01,516 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 20:07:01,517 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 20:07:01,517 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 20:07:01,518 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 20:07:01,518 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 20:07:01,519 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 20:07:01,519 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 20:07:01,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 20:07:01,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 20:07:01,605 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:07:02,388 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 20:07:02,388 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 20:07:02,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 20:07:02,390 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 20:07:02,390 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 20:07:02,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 20:07:02,390 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 20:07:02,390 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 20:07:02,391 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 20:07:02,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 20:07:02,391 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 20:07:02,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 20:07:02,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 20:07:02,391 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 20:07:02,391 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 20:07:02,392 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 20:07:02,392 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 20:07:02,392 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 20:07:02,392 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 20:07:02,392 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 20:07:02,392 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 20:07:02,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:07:02,393 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 20:07:02,393 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 20:07:02,393 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 20:07:02,393 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 20:07:02,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 20:07:02,393 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 20:07:02,393 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:07:02,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 20:07:02,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 20:07:02,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 20:07:02,709 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 20:07:02,709 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 20:07:02,710 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_pso.opt.i [2021-03-11 20:07:02,775 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84bb32fb6/b1417b415de0453a824634cef3f45ede/FLAG592cd171d [2021-03-11 20:07:03,338 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 20:07:03,338 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_pso.opt.i [2021-03-11 20:07:03,360 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84bb32fb6/b1417b415de0453a824634cef3f45ede/FLAG592cd171d [2021-03-11 20:07:03,738 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84bb32fb6/b1417b415de0453a824634cef3f45ede [2021-03-11 20:07:03,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 20:07:03,745 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 20:07:03,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 20:07:03,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 20:07:03,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 20:07:03,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:07:03" (1/1) ... [2021-03-11 20:07:03,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@87191d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:07:03, skipping insertion in model container [2021-03-11 20:07:03,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:07:03" (1/1) ... [2021-03-11 20:07:03,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 20:07:03,825 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 20:07:03,951 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/mix030_pso.opt.i[948,961] [2021-03-11 20:07:04,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:07:04,206 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 20:07:04,218 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/mix030_pso.opt.i[948,961] [2021-03-11 20:07:04,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:07:04,371 INFO L208 MainTranslator]: Completed translation [2021-03-11 20:07:04,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:07:04 WrapperNode [2021-03-11 20:07:04,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 20:07:04,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 20:07:04,373 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 20:07:04,374 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 20:07:04,380 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:07:04" (1/1) ... [2021-03-11 20:07:04,411 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:07:04" (1/1) ... [2021-03-11 20:07:04,454 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 20:07:04,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 20:07:04,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 20:07:04,455 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 20:07:04,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:07:04" (1/1) ... [2021-03-11 20:07:04,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:07:04" (1/1) ... [2021-03-11 20:07:04,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:07:04" (1/1) ... [2021-03-11 20:07:04,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:07:04" (1/1) ... [2021-03-11 20:07:04,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:07:04" (1/1) ... [2021-03-11 20:07:04,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:07:04" (1/1) ... [2021-03-11 20:07:04,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:07:04" (1/1) ... [2021-03-11 20:07:04,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 20:07:04,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 20:07:04,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 20:07:04,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 20:07:04,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:07:04" (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:07:04,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 20:07:04,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 20:07:04,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 20:07:04,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 20:07:04,594 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 20:07:04,594 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 20:07:04,594 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 20:07:04,594 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 20:07:04,595 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 20:07:04,595 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 20:07:04,595 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-11 20:07:04,595 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-11 20:07:04,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 20:07:04,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 20:07:04,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 20:07:04,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 20:07:04,598 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:07:06,439 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 20:07:06,439 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 20:07:06,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:07:06 BoogieIcfgContainer [2021-03-11 20:07:06,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 20:07:06,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 20:07:06,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 20:07:06,445 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 20:07:06,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 08:07:03" (1/3) ... [2021-03-11 20:07:06,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6adc2db0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:07:06, skipping insertion in model container [2021-03-11 20:07:06,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:07:04" (2/3) ... [2021-03-11 20:07:06,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6adc2db0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:07:06, skipping insertion in model container [2021-03-11 20:07:06,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:07:06" (3/3) ... [2021-03-11 20:07:06,447 INFO L111 eAbstractionObserver]: Analyzing ICFG mix030_pso.opt.i [2021-03-11 20:07:06,453 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 20:07:06,457 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 20:07:06,458 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 20:07:06,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,488 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,488 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,488 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,489 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,490 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,490 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,490 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,490 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,494 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,494 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,494 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,495 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,495 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,495 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,495 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,496 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,499 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,499 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,499 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,499 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,499 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,500 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,500 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,500 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,500 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,500 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,500 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,501 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,501 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,501 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,501 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,501 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,502 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,502 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,502 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,502 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,502 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,502 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,503 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,503 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,503 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,503 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,505 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,506 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,506 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,508 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,508 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,509 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,509 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,511 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,511 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,511 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,511 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,513 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,513 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:07:06,515 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 20:07:06,531 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-11 20:07:06,549 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 20:07:06,549 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 20:07:06,549 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 20:07:06,549 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 20:07:06,549 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 20:07:06,549 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 20:07:06,549 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 20:07:06,549 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 20:07:06,559 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 250 flow [2021-03-11 20:07:06,596 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-03-11 20:07:06,597 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:07:06,601 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-11 20:07:06,601 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 115 transitions, 250 flow [2021-03-11 20:07:06,605 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 111 transitions, 234 flow [2021-03-11 20:07:06,609 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 20:07:06,617 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 234 flow [2021-03-11 20:07:06,619 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 111 transitions, 234 flow [2021-03-11 20:07:06,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 234 flow [2021-03-11 20:07:06,640 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-03-11 20:07:06,640 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:07:06,641 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-11 20:07:06,643 INFO L116 LiptonReduction]: Number of co-enabled transitions 2630 [2021-03-11 20:07:08,409 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-03-11 20:07:08,880 WARN L205 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 90 [2021-03-11 20:07:09,055 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-11 20:07:11,024 WARN L205 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 192 [2021-03-11 20:07:11,313 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-11 20:07:12,616 WARN L205 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 316 DAG size of output: 272 [2021-03-11 20:07:13,234 WARN L205 SmtUtils]: Spent 616.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-11 20:07:14,505 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-11 20:07:15,106 WARN L205 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-11 20:07:15,244 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-11 20:07:15,558 WARN L205 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-11 20:07:15,717 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-11 20:07:15,722 INFO L131 LiptonReduction]: Checked pairs total: 7499 [2021-03-11 20:07:15,722 INFO L133 LiptonReduction]: Total number of compositions: 92 [2021-03-11 20:07:15,723 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9118 [2021-03-11 20:07:15,730 INFO L129 PetriNetUnfolder]: 0/12 cut-off events. [2021-03-11 20:07:15,731 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:07:15,731 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:07:15,731 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:07:15,732 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:07:15,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:07:15,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1587143554, now seen corresponding path program 1 times [2021-03-11 20:07:15,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:07:15,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446959814] [2021-03-11 20:07:15,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:07:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:07:15,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:15,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:15,927 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:07:15,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446959814] [2021-03-11 20:07:15,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:07:15,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:07:15,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835483022] [2021-03-11 20:07:15,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:07:15,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:07:15,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:07:15,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:07:15,948 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 207 [2021-03-11 20:07:15,950 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 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:07:15,951 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:07:15,951 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 207 [2021-03-11 20:07:15,952 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:07:16,043 INFO L129 PetriNetUnfolder]: 49/138 cut-off events. [2021-03-11 20:07:16,043 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:07:16,045 INFO L84 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 138 events. 49/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 579 event pairs, 27 based on Foata normal form. 11/129 useless extension candidates. Maximal degree in co-relation 226. Up to 65 conditions per place. [2021-03-11 20:07:16,047 INFO L132 encePairwiseOnDemand]: 203/207 looper letters, 9 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2021-03-11 20:07:16,047 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 33 transitions, 100 flow [2021-03-11 20:07:16,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:07:16,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:07:16,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 542 transitions. [2021-03-11 20:07:16,063 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8727858293075684 [2021-03-11 20:07:16,064 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 542 transitions. [2021-03-11 20:07:16,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 542 transitions. [2021-03-11 20:07:16,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:07:16,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 542 transitions. [2021-03-11 20:07:16,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 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:07:16,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 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:07:16,082 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 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:07:16,084 INFO L185 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 542 transitions. [2021-03-11 20:07:16,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 33 transitions, 100 flow [2021-03-11 20:07:16,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 33 transitions, 96 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-11 20:07:16,088 INFO L241 Difference]: Finished difference. Result has 40 places, 29 transitions, 70 flow [2021-03-11 20:07:16,089 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2021-03-11 20:07:16,090 INFO L335 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2021-03-11 20:07:16,090 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2021-03-11 20:07:16,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 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:07:16,090 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:07:16,091 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:07:16,091 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 20:07:16,092 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:07:16,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:07:16,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1876855890, now seen corresponding path program 1 times [2021-03-11 20:07:16,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:07:16,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89687919] [2021-03-11 20:07:16,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:07:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:07:16,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:16,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:16,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:16,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:16,309 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:07:16,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89687919] [2021-03-11 20:07:16,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:07:16,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:07:16,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158621921] [2021-03-11 20:07:16,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:07:16,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:07:16,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:07:16,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:07:16,313 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 207 [2021-03-11 20:07:16,314 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 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:07:16,314 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:07:16,314 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 207 [2021-03-11 20:07:16,315 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:07:16,351 INFO L129 PetriNetUnfolder]: 12/72 cut-off events. [2021-03-11 20:07:16,351 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:07:16,351 INFO L84 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 72 events. 12/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 240 event pairs, 3 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 109. Up to 20 conditions per place. [2021-03-11 20:07:16,352 INFO L132 encePairwiseOnDemand]: 202/207 looper letters, 4 selfloop transitions, 3 changer transitions 8/38 dead transitions. [2021-03-11 20:07:16,352 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 118 flow [2021-03-11 20:07:16,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:07:16,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:07:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 867 transitions. [2021-03-11 20:07:16,358 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8376811594202899 [2021-03-11 20:07:16,358 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 867 transitions. [2021-03-11 20:07:16,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 867 transitions. [2021-03-11 20:07:16,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:07:16,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 867 transitions. [2021-03-11 20:07:16,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 173.4) internal successors, (867), 5 states have internal predecessors, (867), 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:07:16,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 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:07:16,364 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 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:07:16,364 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 5 states and 867 transitions. [2021-03-11 20:07:16,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 118 flow [2021-03-11 20:07:16,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 38 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:07:16,366 INFO L241 Difference]: Finished difference. Result has 45 places, 30 transitions, 91 flow [2021-03-11 20:07:16,366 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2021-03-11 20:07:16,366 INFO L335 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2021-03-11 20:07:16,366 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 91 flow [2021-03-11 20:07:16,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 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:07:16,367 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:07:16,367 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:07:16,367 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 20:07:16,367 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:07:16,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:07:16,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1670878732, now seen corresponding path program 1 times [2021-03-11 20:07:16,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:07:16,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61661914] [2021-03-11 20:07:16,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:07:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:07:16,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:16,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:16,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:16,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:16,498 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:07:16,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61661914] [2021-03-11 20:07:16,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:07:16,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:07:16,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672024161] [2021-03-11 20:07:16,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:07:16,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:07:16,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:07:16,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:07:16,501 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 207 [2021-03-11 20:07:16,502 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 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:07:16,502 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:07:16,502 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 207 [2021-03-11 20:07:16,502 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:07:16,535 INFO L129 PetriNetUnfolder]: 7/60 cut-off events. [2021-03-11 20:07:16,536 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-03-11 20:07:16,537 INFO L84 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 60 events. 7/60 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 172 event pairs, 3 based on Foata normal form. 5/61 useless extension candidates. Maximal degree in co-relation 108. Up to 17 conditions per place. [2021-03-11 20:07:16,538 INFO L132 encePairwiseOnDemand]: 203/207 looper letters, 2 selfloop transitions, 2 changer transitions 2/32 dead transitions. [2021-03-11 20:07:16,538 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 109 flow [2021-03-11 20:07:16,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:07:16,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:07:16,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 883 transitions. [2021-03-11 20:07:16,541 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8531400966183574 [2021-03-11 20:07:16,541 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 883 transitions. [2021-03-11 20:07:16,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 883 transitions. [2021-03-11 20:07:16,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:07:16,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 883 transitions. [2021-03-11 20:07:16,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 176.6) internal successors, (883), 5 states have internal predecessors, (883), 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:07:16,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 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:07:16,547 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 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:07:16,547 INFO L185 Difference]: Start difference. First operand has 45 places, 30 transitions, 91 flow. Second operand 5 states and 883 transitions. [2021-03-11 20:07:16,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 109 flow [2021-03-11 20:07:16,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 32 transitions, 104 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-11 20:07:16,549 INFO L241 Difference]: Finished difference. Result has 47 places, 30 transitions, 98 flow [2021-03-11 20:07:16,549 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2021-03-11 20:07:16,549 INFO L335 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2021-03-11 20:07:16,549 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 98 flow [2021-03-11 20:07:16,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 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:07:16,550 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:07:16,552 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:07:16,552 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 20:07:16,553 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:07:16,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:07:16,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1570628230, now seen corresponding path program 1 times [2021-03-11 20:07:16,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:07:16,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848303689] [2021-03-11 20:07:16,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:07:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:07:16,725 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-03-11 20:07:16,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-11 20:07:16,773 INFO L142 QuantifierPusher]: treesize reduction 27, result has 49.1 percent of original size [2021-03-11 20:07:16,777 INFO L147 QuantifierPusher]: treesize reduction 5, result has 80.8 percent of original size 21 [2021-03-11 20:07:16,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:16,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:16,804 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:07:16,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848303689] [2021-03-11 20:07:16,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:07:16,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:07:16,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126576207] [2021-03-11 20:07:16,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:07:16,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:07:16,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:07:16,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:07:16,806 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 207 [2021-03-11 20:07:16,807 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 30 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 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:07:16,807 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:07:16,807 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 207 [2021-03-11 20:07:16,808 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:07:17,000 INFO L129 PetriNetUnfolder]: 284/528 cut-off events. [2021-03-11 20:07:17,001 INFO L130 PetriNetUnfolder]: For 495/522 co-relation queries the response was YES. [2021-03-11 20:07:17,003 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1243 conditions, 528 events. 284/528 cut-off events. For 495/522 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2860 event pairs, 182 based on Foata normal form. 39/527 useless extension candidates. Maximal degree in co-relation 1228. Up to 333 conditions per place. [2021-03-11 20:07:17,008 INFO L132 encePairwiseOnDemand]: 202/207 looper letters, 10 selfloop transitions, 3 changer transitions 9/43 dead transitions. [2021-03-11 20:07:17,008 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 43 transitions, 172 flow [2021-03-11 20:07:17,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:07:17,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:07:17,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 764 transitions. [2021-03-11 20:07:17,010 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7381642512077294 [2021-03-11 20:07:17,011 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 764 transitions. [2021-03-11 20:07:17,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 764 transitions. [2021-03-11 20:07:17,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:07:17,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 764 transitions. [2021-03-11 20:07:17,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 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:07:17,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 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:07:17,015 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 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:07:17,015 INFO L185 Difference]: Start difference. First operand has 47 places, 30 transitions, 98 flow. Second operand 5 states and 764 transitions. [2021-03-11 20:07:17,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 43 transitions, 172 flow [2021-03-11 20:07:17,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 164 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-11 20:07:17,021 INFO L241 Difference]: Finished difference. Result has 48 places, 32 transitions, 117 flow [2021-03-11 20:07:17,021 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=117, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2021-03-11 20:07:17,021 INFO L335 CegarLoopForPetriNet]: 43 programPoint places, 5 predicate places. [2021-03-11 20:07:17,021 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 32 transitions, 117 flow [2021-03-11 20:07:17,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 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:07:17,022 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:07:17,022 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:07:17,022 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 20:07:17,022 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:07:17,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:07:17,023 INFO L82 PathProgramCache]: Analyzing trace with hash 546236970, now seen corresponding path program 1 times [2021-03-11 20:07:17,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:07:17,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532043466] [2021-03-11 20:07:17,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:07:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:07:17,119 INFO L142 QuantifierPusher]: treesize reduction 27, result has 28.9 percent of original size [2021-03-11 20:07:17,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 20:07:17,128 INFO L142 QuantifierPusher]: treesize reduction 27, result has 34.1 percent of original size [2021-03-11 20:07:17,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 20:07:17,140 INFO L142 QuantifierPusher]: treesize reduction 35, result has 38.6 percent of original size [2021-03-11 20:07:17,141 INFO L147 QuantifierPusher]: treesize reduction 9, result has 59.1 percent of original size 13 [2021-03-11 20:07:17,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:17,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:17,166 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:07:17,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532043466] [2021-03-11 20:07:17,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:07:17,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:07:17,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778703519] [2021-03-11 20:07:17,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:07:17,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:07:17,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:07:17,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:07:17,170 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 207 [2021-03-11 20:07:17,171 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 32 transitions, 117 flow. Second operand has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 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:07:17,171 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:07:17,171 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 207 [2021-03-11 20:07:17,171 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:07:17,409 INFO L129 PetriNetUnfolder]: 248/458 cut-off events. [2021-03-11 20:07:17,409 INFO L130 PetriNetUnfolder]: For 533/575 co-relation queries the response was YES. [2021-03-11 20:07:17,411 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1265 conditions, 458 events. 248/458 cut-off events. For 533/575 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2274 event pairs, 96 based on Foata normal form. 27/451 useless extension candidates. Maximal degree in co-relation 1249. Up to 259 conditions per place. [2021-03-11 20:07:17,415 INFO L132 encePairwiseOnDemand]: 199/207 looper letters, 10 selfloop transitions, 8 changer transitions 8/47 dead transitions. [2021-03-11 20:07:17,415 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 47 transitions, 219 flow [2021-03-11 20:07:17,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:07:17,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:07:17,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 951 transitions. [2021-03-11 20:07:17,418 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7657004830917874 [2021-03-11 20:07:17,418 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 951 transitions. [2021-03-11 20:07:17,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 951 transitions. [2021-03-11 20:07:17,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:07:17,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 951 transitions. [2021-03-11 20:07:17,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 158.5) internal successors, (951), 6 states have internal predecessors, (951), 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:07:17,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 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:07:17,424 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 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:07:17,424 INFO L185 Difference]: Start difference. First operand has 48 places, 32 transitions, 117 flow. Second operand 6 states and 951 transitions. [2021-03-11 20:07:17,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 47 transitions, 219 flow [2021-03-11 20:07:17,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 47 transitions, 208 flow, removed 4 selfloop flow, removed 2 redundant places. [2021-03-11 20:07:17,430 INFO L241 Difference]: Finished difference. Result has 53 places, 36 transitions, 162 flow [2021-03-11 20:07:17,430 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=53, PETRI_TRANSITIONS=36} [2021-03-11 20:07:17,430 INFO L335 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2021-03-11 20:07:17,430 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 162 flow [2021-03-11 20:07:17,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 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:07:17,431 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:07:17,431 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:07:17,431 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 20:07:17,431 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:07:17,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:07:17,431 INFO L82 PathProgramCache]: Analyzing trace with hash 527152544, now seen corresponding path program 1 times [2021-03-11 20:07:17,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:07:17,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290624343] [2021-03-11 20:07:17,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:07:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:07:17,528 INFO L142 QuantifierPusher]: treesize reduction 40, result has 29.8 percent of original size [2021-03-11 20:07:17,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 20:07:17,545 INFO L142 QuantifierPusher]: treesize reduction 60, result has 46.4 percent of original size [2021-03-11 20:07:17,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-11 20:07:17,572 INFO L142 QuantifierPusher]: treesize reduction 11, result has 78.4 percent of original size [2021-03-11 20:07:17,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-11 20:07:17,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:17,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:17,597 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:07:17,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290624343] [2021-03-11 20:07:17,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:07:17,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:07:17,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094153506] [2021-03-11 20:07:17,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:07:17,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:07:17,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:07:17,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:07:17,601 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 207 [2021-03-11 20:07:17,602 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 36 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 150.83333333333334) internal successors, (905), 6 states have internal predecessors, (905), 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:07:17,602 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:07:17,602 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 207 [2021-03-11 20:07:17,602 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:07:17,804 INFO L129 PetriNetUnfolder]: 245/479 cut-off events. [2021-03-11 20:07:17,804 INFO L130 PetriNetUnfolder]: For 981/1202 co-relation queries the response was YES. [2021-03-11 20:07:17,807 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1588 conditions, 479 events. 245/479 cut-off events. For 981/1202 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2487 event pairs, 37 based on Foata normal form. 41/483 useless extension candidates. Maximal degree in co-relation 1568. Up to 212 conditions per place. [2021-03-11 20:07:17,810 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 16 selfloop transitions, 7 changer transitions 9/53 dead transitions. [2021-03-11 20:07:17,810 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 302 flow [2021-03-11 20:07:17,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:07:17,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:07:17,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 929 transitions. [2021-03-11 20:07:17,812 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7479871175523349 [2021-03-11 20:07:17,812 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 929 transitions. [2021-03-11 20:07:17,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 929 transitions. [2021-03-11 20:07:17,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:07:17,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 929 transitions. [2021-03-11 20:07:17,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 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:07:17,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 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:07:17,816 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 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:07:17,817 INFO L185 Difference]: Start difference. First operand has 53 places, 36 transitions, 162 flow. Second operand 6 states and 929 transitions. [2021-03-11 20:07:17,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 302 flow [2021-03-11 20:07:17,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 53 transitions, 292 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-03-11 20:07:17,821 INFO L241 Difference]: Finished difference. Result has 56 places, 39 transitions, 200 flow [2021-03-11 20:07:17,821 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=200, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2021-03-11 20:07:17,821 INFO L335 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2021-03-11 20:07:17,821 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 200 flow [2021-03-11 20:07:17,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 150.83333333333334) internal successors, (905), 6 states have internal predecessors, (905), 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:07:17,822 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:07:17,822 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:07:17,822 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 20:07:17,822 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:07:17,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:07:17,829 INFO L82 PathProgramCache]: Analyzing trace with hash -491038853, now seen corresponding path program 1 times [2021-03-11 20:07:17,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:07:17,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386849102] [2021-03-11 20:07:17,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:07:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:07:17,944 INFO L142 QuantifierPusher]: treesize reduction 12, result has 73.3 percent of original size [2021-03-11 20:07:17,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-11 20:07:17,967 INFO L142 QuantifierPusher]: treesize reduction 12, result has 75.0 percent of original size [2021-03-11 20:07:17,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-11 20:07:18,000 INFO L142 QuantifierPusher]: treesize reduction 52, result has 59.4 percent of original size [2021-03-11 20:07:18,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 76 [2021-03-11 20:07:18,048 INFO L142 QuantifierPusher]: treesize reduction 42, result has 46.2 percent of original size [2021-03-11 20:07:18,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-11 20:07:18,085 INFO L142 QuantifierPusher]: treesize reduction 2, result has 96.9 percent of original size [2021-03-11 20:07:18,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-03-11 20:07:18,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:18,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:18,135 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:07:18,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386849102] [2021-03-11 20:07:18,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:07:18,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 20:07:18,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065100525] [2021-03-11 20:07:18,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 20:07:18,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:07:18,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 20:07:18,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-11 20:07:18,138 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 207 [2021-03-11 20:07:18,140 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 200 flow. Second operand has 8 states, 8 states have (on average 146.875) internal successors, (1175), 8 states have internal predecessors, (1175), 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:07:18,140 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:07:18,140 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 207 [2021-03-11 20:07:18,140 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:07:18,354 INFO L129 PetriNetUnfolder]: 233/465 cut-off events. [2021-03-11 20:07:18,354 INFO L130 PetriNetUnfolder]: For 1174/1617 co-relation queries the response was YES. [2021-03-11 20:07:18,357 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1863 conditions, 465 events. 233/465 cut-off events. For 1174/1617 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2441 event pairs, 45 based on Foata normal form. 24/454 useless extension candidates. Maximal degree in co-relation 1841. Up to 272 conditions per place. [2021-03-11 20:07:18,360 INFO L132 encePairwiseOnDemand]: 198/207 looper letters, 15 selfloop transitions, 12 changer transitions 5/53 dead transitions. [2021-03-11 20:07:18,360 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 53 transitions, 363 flow [2021-03-11 20:07:18,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:07:18,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:07:18,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1050 transitions. [2021-03-11 20:07:18,363 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7246376811594203 [2021-03-11 20:07:18,363 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1050 transitions. [2021-03-11 20:07:18,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1050 transitions. [2021-03-11 20:07:18,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:07:18,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1050 transitions. [2021-03-11 20:07:18,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 150.0) internal successors, (1050), 7 states have internal predecessors, (1050), 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:07:18,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 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:07:18,368 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 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:07:18,368 INFO L185 Difference]: Start difference. First operand has 56 places, 39 transitions, 200 flow. Second operand 7 states and 1050 transitions. [2021-03-11 20:07:18,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 53 transitions, 363 flow [2021-03-11 20:07:18,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 53 transitions, 350 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-11 20:07:18,372 INFO L241 Difference]: Finished difference. Result has 60 places, 43 transitions, 261 flow [2021-03-11 20:07:18,372 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=261, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2021-03-11 20:07:18,372 INFO L335 CegarLoopForPetriNet]: 43 programPoint places, 17 predicate places. [2021-03-11 20:07:18,373 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 261 flow [2021-03-11 20:07:18,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 146.875) internal successors, (1175), 8 states have internal predecessors, (1175), 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:07:18,373 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:07:18,373 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:07:18,373 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 20:07:18,373 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:07:18,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:07:18,374 INFO L82 PathProgramCache]: Analyzing trace with hash 675802875, now seen corresponding path program 2 times [2021-03-11 20:07:18,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:07:18,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369087129] [2021-03-11 20:07:18,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:07:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:07:18,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:18,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:07:18,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:18,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:07:18,504 INFO L142 QuantifierPusher]: treesize reduction 13, result has 75.5 percent of original size [2021-03-11 20:07:18,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-11 20:07:18,532 INFO L142 QuantifierPusher]: treesize reduction 40, result has 61.5 percent of original size [2021-03-11 20:07:18,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-03-11 20:07:18,568 INFO L142 QuantifierPusher]: treesize reduction 11, result has 82.0 percent of original size [2021-03-11 20:07:18,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-11 20:07:18,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:18,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:18,607 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:07:18,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369087129] [2021-03-11 20:07:18,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:07:18,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 20:07:18,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094538539] [2021-03-11 20:07:18,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 20:07:18,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:07:18,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 20:07:18,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-11 20:07:18,610 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 207 [2021-03-11 20:07:18,611 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 43 transitions, 261 flow. Second operand has 8 states, 8 states have (on average 146.875) internal successors, (1175), 8 states have internal predecessors, (1175), 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:07:18,611 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:07:18,611 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 207 [2021-03-11 20:07:18,611 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:07:18,863 INFO L129 PetriNetUnfolder]: 225/455 cut-off events. [2021-03-11 20:07:18,863 INFO L130 PetriNetUnfolder]: For 1830/2499 co-relation queries the response was YES. [2021-03-11 20:07:18,866 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2083 conditions, 455 events. 225/455 cut-off events. For 1830/2499 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2398 event pairs, 31 based on Foata normal form. 29/452 useless extension candidates. Maximal degree in co-relation 2059. Up to 218 conditions per place. [2021-03-11 20:07:18,869 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 18 selfloop transitions, 13 changer transitions 5/57 dead transitions. [2021-03-11 20:07:18,869 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 57 transitions, 465 flow [2021-03-11 20:07:18,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:07:18,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:07:18,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1050 transitions. [2021-03-11 20:07:18,872 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7246376811594203 [2021-03-11 20:07:18,872 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1050 transitions. [2021-03-11 20:07:18,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1050 transitions. [2021-03-11 20:07:18,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:07:18,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1050 transitions. [2021-03-11 20:07:18,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 150.0) internal successors, (1050), 7 states have internal predecessors, (1050), 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:07:18,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 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:07:18,877 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 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:07:18,878 INFO L185 Difference]: Start difference. First operand has 60 places, 43 transitions, 261 flow. Second operand 7 states and 1050 transitions. [2021-03-11 20:07:18,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 57 transitions, 465 flow [2021-03-11 20:07:18,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 57 transitions, 418 flow, removed 14 selfloop flow, removed 5 redundant places. [2021-03-11 20:07:18,884 INFO L241 Difference]: Finished difference. Result has 62 places, 45 transitions, 299 flow [2021-03-11 20:07:18,884 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=299, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2021-03-11 20:07:18,884 INFO L335 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2021-03-11 20:07:18,884 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 299 flow [2021-03-11 20:07:18,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 146.875) internal successors, (1175), 8 states have internal predecessors, (1175), 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:07:18,886 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:07:18,886 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:07:18,886 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 20:07:18,886 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:07:18,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:07:18,886 INFO L82 PathProgramCache]: Analyzing trace with hash -2131435669, now seen corresponding path program 1 times [2021-03-11 20:07:18,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:07:18,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4681272] [2021-03-11 20:07:18,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:07:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:07:18,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:18,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:18,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:18,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:07:18,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:18,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:07:18,982 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:07:18,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4681272] [2021-03-11 20:07:18,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:07:18,982 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:07:18,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555665058] [2021-03-11 20:07:18,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:07:18,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:07:18,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:07:18,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:07:18,984 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 207 [2021-03-11 20:07:18,984 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 299 flow. Second operand has 4 states, 4 states have (on average 169.75) internal successors, (679), 4 states have internal predecessors, (679), 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:07:18,984 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:07:18,984 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 207 [2021-03-11 20:07:18,985 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:07:19,178 INFO L129 PetriNetUnfolder]: 689/1311 cut-off events. [2021-03-11 20:07:19,179 INFO L130 PetriNetUnfolder]: For 4308/4809 co-relation queries the response was YES. [2021-03-11 20:07:19,187 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4730 conditions, 1311 events. 689/1311 cut-off events. For 4308/4809 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 9034 event pairs, 268 based on Foata normal form. 149/1325 useless extension candidates. Maximal degree in co-relation 4705. Up to 560 conditions per place. [2021-03-11 20:07:19,196 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 11 selfloop transitions, 10 changer transitions 0/58 dead transitions. [2021-03-11 20:07:19,197 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 367 flow [2021-03-11 20:07:19,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:07:19,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:07:19,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 867 transitions. [2021-03-11 20:07:19,199 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8376811594202899 [2021-03-11 20:07:19,199 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 867 transitions. [2021-03-11 20:07:19,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 867 transitions. [2021-03-11 20:07:19,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:07:19,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 867 transitions. [2021-03-11 20:07:19,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 173.4) internal successors, (867), 5 states have internal predecessors, (867), 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:07:19,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 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:07:19,204 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 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:07:19,204 INFO L185 Difference]: Start difference. First operand has 62 places, 45 transitions, 299 flow. Second operand 5 states and 867 transitions. [2021-03-11 20:07:19,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 367 flow [2021-03-11 20:07:19,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 58 transitions, 335 flow, removed 10 selfloop flow, removed 4 redundant places. [2021-03-11 20:07:19,210 INFO L241 Difference]: Finished difference. Result has 63 places, 54 transitions, 346 flow [2021-03-11 20:07:19,210 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=346, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2021-03-11 20:07:19,211 INFO L335 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2021-03-11 20:07:19,211 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 346 flow [2021-03-11 20:07:19,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 169.75) internal successors, (679), 4 states have internal predecessors, (679), 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:07:19,211 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:07:19,211 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:07:19,211 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 20:07:19,211 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:07:19,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:07:19,212 INFO L82 PathProgramCache]: Analyzing trace with hash -316862338, now seen corresponding path program 1 times [2021-03-11 20:07:19,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:07:19,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633149410] [2021-03-11 20:07:19,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:07:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:07:19,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:19,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:19,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:19,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:19,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:19,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:07:19,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:19,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:07:19,275 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:07:19,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633149410] [2021-03-11 20:07:19,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:07:19,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:07:19,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4993867] [2021-03-11 20:07:19,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:07:19,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:07:19,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:07:19,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:07:19,278 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 207 [2021-03-11 20:07:19,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 346 flow. Second operand has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 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:07:19,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:07:19,279 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 207 [2021-03-11 20:07:19,279 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:07:19,490 INFO L129 PetriNetUnfolder]: 400/891 cut-off events. [2021-03-11 20:07:19,490 INFO L130 PetriNetUnfolder]: For 2875/5279 co-relation queries the response was YES. [2021-03-11 20:07:19,497 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3642 conditions, 891 events. 400/891 cut-off events. For 2875/5279 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 6304 event pairs, 75 based on Foata normal form. 396/1205 useless extension candidates. Maximal degree in co-relation 3616. Up to 502 conditions per place. [2021-03-11 20:07:19,504 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 11 selfloop transitions, 19 changer transitions 0/67 dead transitions. [2021-03-11 20:07:19,505 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 67 transitions, 482 flow [2021-03-11 20:07:19,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:07:19,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:07:19,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1214 transitions. [2021-03-11 20:07:19,508 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8378191856452726 [2021-03-11 20:07:19,508 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1214 transitions. [2021-03-11 20:07:19,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1214 transitions. [2021-03-11 20:07:19,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:07:19,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1214 transitions. [2021-03-11 20:07:19,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 173.42857142857142) internal successors, (1214), 7 states have internal predecessors, (1214), 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:07:19,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 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:07:19,514 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 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:07:19,514 INFO L185 Difference]: Start difference. First operand has 63 places, 54 transitions, 346 flow. Second operand 7 states and 1214 transitions. [2021-03-11 20:07:19,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 67 transitions, 482 flow [2021-03-11 20:07:19,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 67 transitions, 477 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 20:07:19,519 INFO L241 Difference]: Finished difference. Result has 71 places, 63 transitions, 479 flow [2021-03-11 20:07:19,520 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=479, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2021-03-11 20:07:19,520 INFO L335 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2021-03-11 20:07:19,521 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 479 flow [2021-03-11 20:07:19,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 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:07:19,521 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:07:19,521 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:07:19,521 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 20:07:19,521 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:07:19,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:07:19,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1023227143, now seen corresponding path program 1 times [2021-03-11 20:07:19,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:07:19,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879695083] [2021-03-11 20:07:19,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:07:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:07:19,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:19,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:07:19,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:19,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:19,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:19,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:19,581 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:07:19,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879695083] [2021-03-11 20:07:19,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:07:19,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:07:19,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323917701] [2021-03-11 20:07:19,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:07:19,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:07:19,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:07:19,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:07:19,585 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 207 [2021-03-11 20:07:19,586 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 479 flow. Second operand has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:19,586 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:07:19,586 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 207 [2021-03-11 20:07:19,586 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:07:19,786 INFO L129 PetriNetUnfolder]: 617/1335 cut-off events. [2021-03-11 20:07:19,786 INFO L130 PetriNetUnfolder]: For 6649/9978 co-relation queries the response was YES. [2021-03-11 20:07:19,796 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6440 conditions, 1335 events. 617/1335 cut-off events. For 6649/9978 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 10202 event pairs, 111 based on Foata normal form. 87/1260 useless extension candidates. Maximal degree in co-relation 6410. Up to 822 conditions per place. [2021-03-11 20:07:19,805 INFO L132 encePairwiseOnDemand]: 203/207 looper letters, 5 selfloop transitions, 5 changer transitions 0/66 dead transitions. [2021-03-11 20:07:19,805 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 66 transitions, 529 flow [2021-03-11 20:07:19,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:07:19,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:07:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 861 transitions. [2021-03-11 20:07:19,808 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8318840579710145 [2021-03-11 20:07:19,808 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 861 transitions. [2021-03-11 20:07:19,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 861 transitions. [2021-03-11 20:07:19,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:07:19,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 861 transitions. [2021-03-11 20:07:19,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 172.2) internal successors, (861), 5 states have internal predecessors, (861), 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:07:19,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 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:07:19,812 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 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:07:19,812 INFO L185 Difference]: Start difference. First operand has 71 places, 63 transitions, 479 flow. Second operand 5 states and 861 transitions. [2021-03-11 20:07:19,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 66 transitions, 529 flow [2021-03-11 20:07:19,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 66 transitions, 475 flow, removed 19 selfloop flow, removed 3 redundant places. [2021-03-11 20:07:19,831 INFO L241 Difference]: Finished difference. Result has 75 places, 65 transitions, 470 flow [2021-03-11 20:07:19,832 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=470, PETRI_PLACES=75, PETRI_TRANSITIONS=65} [2021-03-11 20:07:19,832 INFO L335 CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places. [2021-03-11 20:07:19,832 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 65 transitions, 470 flow [2021-03-11 20:07:19,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:07:19,832 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:07:19,832 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:07:19,833 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 20:07:19,833 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:07:19,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:07:19,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1415701367, now seen corresponding path program 1 times [2021-03-11 20:07:19,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:07:19,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374592850] [2021-03-11 20:07:19,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:07:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:07:19,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:19,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:19,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:19,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:19,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:19,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:19,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:19,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:07:19,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:19,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:07:19,907 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:07:19,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374592850] [2021-03-11 20:07:19,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:07:19,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:07:19,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524377892] [2021-03-11 20:07:19,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:07:19,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:07:19,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:07:19,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:07:19,910 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 207 [2021-03-11 20:07:19,910 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 470 flow. Second operand has 6 states, 6 states have (on average 169.83333333333334) internal successors, (1019), 6 states have internal predecessors, (1019), 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:07:19,911 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:07:19,911 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 207 [2021-03-11 20:07:19,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:07:20,118 INFO L129 PetriNetUnfolder]: 410/953 cut-off events. [2021-03-11 20:07:20,118 INFO L130 PetriNetUnfolder]: For 5874/9926 co-relation queries the response was YES. [2021-03-11 20:07:20,126 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4479 conditions, 953 events. 410/953 cut-off events. For 5874/9926 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 7134 event pairs, 17 based on Foata normal form. 672/1488 useless extension candidates. Maximal degree in co-relation 4447. Up to 517 conditions per place. [2021-03-11 20:07:20,131 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 6 selfloop transitions, 28 changer transitions 6/77 dead transitions. [2021-03-11 20:07:20,132 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 77 transitions, 658 flow [2021-03-11 20:07:20,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 20:07:20,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 20:07:20,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1561 transitions. [2021-03-11 20:07:20,136 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8378958668813741 [2021-03-11 20:07:20,136 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1561 transitions. [2021-03-11 20:07:20,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1561 transitions. [2021-03-11 20:07:20,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:07:20,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1561 transitions. [2021-03-11 20:07:20,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 173.44444444444446) internal successors, (1561), 9 states have internal predecessors, (1561), 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:07:20,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 207.0) internal successors, (2070), 10 states have internal predecessors, (2070), 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:07:20,143 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 207.0) internal successors, (2070), 10 states have internal predecessors, (2070), 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:07:20,143 INFO L185 Difference]: Start difference. First operand has 75 places, 65 transitions, 470 flow. Second operand 9 states and 1561 transitions. [2021-03-11 20:07:20,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 77 transitions, 658 flow [2021-03-11 20:07:20,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 77 transitions, 649 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-11 20:07:20,156 INFO L241 Difference]: Finished difference. Result has 85 places, 71 transitions, 601 flow [2021-03-11 20:07:20,156 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=601, PETRI_PLACES=85, PETRI_TRANSITIONS=71} [2021-03-11 20:07:20,156 INFO L335 CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places. [2021-03-11 20:07:20,156 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 71 transitions, 601 flow [2021-03-11 20:07:20,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 169.83333333333334) internal successors, (1019), 6 states have internal predecessors, (1019), 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:07:20,157 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:07:20,157 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:07:20,157 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 20:07:20,157 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:07:20,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:07:20,157 INFO L82 PathProgramCache]: Analyzing trace with hash -472704237, now seen corresponding path program 1 times [2021-03-11 20:07:20,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:07:20,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630500997] [2021-03-11 20:07:20,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:07:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:07:20,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:20,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:20,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:20,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:20,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:20,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:20,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:20,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:20,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:20,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:07:20,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:20,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:07:20,254 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:07:20,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630500997] [2021-03-11 20:07:20,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:07:20,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 20:07:20,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125493033] [2021-03-11 20:07:20,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 20:07:20,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:07:20,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 20:07:20,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-11 20:07:20,257 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 207 [2021-03-11 20:07:20,270 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 71 transitions, 601 flow. Second operand has 7 states, 7 states have (on average 169.85714285714286) internal successors, (1189), 7 states have internal predecessors, (1189), 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:07:20,270 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:07:20,270 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 207 [2021-03-11 20:07:20,270 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:07:20,515 INFO L129 PetriNetUnfolder]: 365/852 cut-off events. [2021-03-11 20:07:20,515 INFO L130 PetriNetUnfolder]: For 6810/11796 co-relation queries the response was YES. [2021-03-11 20:07:20,523 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4863 conditions, 852 events. 365/852 cut-off events. For 6810/11796 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 6383 event pairs, 7 based on Foata normal form. 594/1309 useless extension candidates. Maximal degree in co-relation 4831. Up to 464 conditions per place. [2021-03-11 20:07:20,528 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 2 selfloop transitions, 33 changer transitions 4/76 dead transitions. [2021-03-11 20:07:20,528 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 76 transitions, 735 flow [2021-03-11 20:07:20,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-11 20:07:20,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-11 20:07:20,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1900 transitions. [2021-03-11 20:07:20,533 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8344312692138779 [2021-03-11 20:07:20,533 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1900 transitions. [2021-03-11 20:07:20,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1900 transitions. [2021-03-11 20:07:20,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:07:20,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1900 transitions. [2021-03-11 20:07:20,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 172.72727272727272) internal successors, (1900), 11 states have internal predecessors, (1900), 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:07:20,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 207.0) internal successors, (2484), 12 states have internal predecessors, (2484), 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:07:20,542 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 207.0) internal successors, (2484), 12 states have internal predecessors, (2484), 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:07:20,542 INFO L185 Difference]: Start difference. First operand has 85 places, 71 transitions, 601 flow. Second operand 11 states and 1900 transitions. [2021-03-11 20:07:20,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 76 transitions, 735 flow [2021-03-11 20:07:20,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 76 transitions, 596 flow, removed 51 selfloop flow, removed 10 redundant places. [2021-03-11 20:07:20,582 INFO L241 Difference]: Finished difference. Result has 86 places, 72 transitions, 556 flow [2021-03-11 20:07:20,582 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=556, PETRI_PLACES=86, PETRI_TRANSITIONS=72} [2021-03-11 20:07:20,582 INFO L335 CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places. [2021-03-11 20:07:20,583 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 72 transitions, 556 flow [2021-03-11 20:07:20,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 169.85714285714286) internal successors, (1189), 7 states have internal predecessors, (1189), 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:07:20,583 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:07:20,583 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:07:20,583 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-11 20:07:20,583 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:07:20,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:07:20,584 INFO L82 PathProgramCache]: Analyzing trace with hash -2076259503, now seen corresponding path program 1 times [2021-03-11 20:07:20,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:07:20,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324158057] [2021-03-11 20:07:20,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:07:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:07:20,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:20,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:07:20,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:20,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:20,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:20,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:20,677 INFO L142 QuantifierPusher]: treesize reduction 12, result has 55.6 percent of original size [2021-03-11 20:07:20,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-11 20:07:20,689 INFO L142 QuantifierPusher]: treesize reduction 17, result has 57.5 percent of original size [2021-03-11 20:07:20,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-11 20:07:20,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:20,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:07:20,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:20,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:20,704 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:07:20,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324158057] [2021-03-11 20:07:20,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:07:20,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 20:07:20,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236672367] [2021-03-11 20:07:20,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 20:07:20,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:07:20,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 20:07:20,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-11 20:07:20,707 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 207 [2021-03-11 20:07:20,708 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 72 transitions, 556 flow. Second operand has 7 states, 7 states have (on average 152.42857142857142) internal successors, (1067), 7 states have internal predecessors, (1067), 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:07:20,708 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:07:20,708 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 207 [2021-03-11 20:07:20,708 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:07:21,020 INFO L129 PetriNetUnfolder]: 893/2168 cut-off events. [2021-03-11 20:07:21,020 INFO L130 PetriNetUnfolder]: For 9331/10923 co-relation queries the response was YES. [2021-03-11 20:07:21,038 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9341 conditions, 2168 events. 893/2168 cut-off events. For 9331/10923 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 20369 event pairs, 13 based on Foata normal form. 143/2067 useless extension candidates. Maximal degree in co-relation 9307. Up to 605 conditions per place. [2021-03-11 20:07:21,044 INFO L132 encePairwiseOnDemand]: 199/207 looper letters, 28 selfloop transitions, 1 changer transitions 36/114 dead transitions. [2021-03-11 20:07:21,045 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 114 transitions, 1020 flow [2021-03-11 20:07:21,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:07:21,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:07:21,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 931 transitions. [2021-03-11 20:07:21,047 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.749597423510467 [2021-03-11 20:07:21,047 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 931 transitions. [2021-03-11 20:07:21,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 931 transitions. [2021-03-11 20:07:21,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:07:21,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 931 transitions. [2021-03-11 20:07:21,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 155.16666666666666) internal successors, (931), 6 states have internal predecessors, (931), 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:07:21,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 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:07:21,052 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 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:07:21,052 INFO L185 Difference]: Start difference. First operand has 86 places, 72 transitions, 556 flow. Second operand 6 states and 931 transitions. [2021-03-11 20:07:21,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 114 transitions, 1020 flow [2021-03-11 20:07:21,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 114 transitions, 875 flow, removed 42 selfloop flow, removed 11 redundant places. [2021-03-11 20:07:21,193 INFO L241 Difference]: Finished difference. Result has 83 places, 72 transitions, 460 flow [2021-03-11 20:07:21,193 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=460, PETRI_PLACES=83, PETRI_TRANSITIONS=72} [2021-03-11 20:07:21,194 INFO L335 CegarLoopForPetriNet]: 43 programPoint places, 40 predicate places. [2021-03-11 20:07:21,194 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 72 transitions, 460 flow [2021-03-11 20:07:21,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 152.42857142857142) internal successors, (1067), 7 states have internal predecessors, (1067), 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:07:21,194 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:07:21,195 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:07:21,195 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-11 20:07:21,195 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:07:21,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:07:21,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1091136817, now seen corresponding path program 2 times [2021-03-11 20:07:21,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:07:21,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601709753] [2021-03-11 20:07:21,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:07:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:07:21,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:21,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:07:21,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:21,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:21,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:21,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:21,279 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:07:21,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601709753] [2021-03-11 20:07:21,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:07:21,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:07:21,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107951248] [2021-03-11 20:07:21,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:07:21,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:07:21,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:07:21,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:07:21,283 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 207 [2021-03-11 20:07:21,283 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 72 transitions, 460 flow. Second operand has 4 states, 4 states have (on average 173.5) internal successors, (694), 4 states have internal predecessors, (694), 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:07:21,283 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:07:21,283 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 207 [2021-03-11 20:07:21,283 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:07:21,516 INFO L129 PetriNetUnfolder]: 726/1701 cut-off events. [2021-03-11 20:07:21,516 INFO L130 PetriNetUnfolder]: For 3245/3494 co-relation queries the response was YES. [2021-03-11 20:07:21,528 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6057 conditions, 1701 events. 726/1701 cut-off events. For 3245/3494 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 14808 event pairs, 8 based on Foata normal form. 21/1437 useless extension candidates. Maximal degree in co-relation 6030. Up to 540 conditions per place. [2021-03-11 20:07:21,536 INFO L132 encePairwiseOnDemand]: 203/207 looper letters, 4 selfloop transitions, 2 changer transitions 12/75 dead transitions. [2021-03-11 20:07:21,536 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 75 transitions, 488 flow [2021-03-11 20:07:21,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 20:07:21,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 20:07:21,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 698 transitions. [2021-03-11 20:07:21,538 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8429951690821256 [2021-03-11 20:07:21,538 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 698 transitions. [2021-03-11 20:07:21,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 698 transitions. [2021-03-11 20:07:21,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:07:21,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 698 transitions. [2021-03-11 20:07:21,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 174.5) internal successors, (698), 4 states have internal predecessors, (698), 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:07:21,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 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:07:21,541 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 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:07:21,541 INFO L185 Difference]: Start difference. First operand has 83 places, 72 transitions, 460 flow. Second operand 4 states and 698 transitions. [2021-03-11 20:07:21,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 75 transitions, 488 flow [2021-03-11 20:07:21,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 75 transitions, 465 flow, removed 11 selfloop flow, removed 4 redundant places. [2021-03-11 20:07:21,624 INFO L241 Difference]: Finished difference. Result has 81 places, 63 transitions, 380 flow [2021-03-11 20:07:21,624 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=380, PETRI_PLACES=81, PETRI_TRANSITIONS=63} [2021-03-11 20:07:21,624 INFO L335 CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places. [2021-03-11 20:07:21,624 INFO L480 AbstractCegarLoop]: Abstraction has has 81 places, 63 transitions, 380 flow [2021-03-11 20:07:21,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 173.5) internal successors, (694), 4 states have internal predecessors, (694), 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:07:21,625 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:07:21,625 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:07:21,625 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-11 20:07:21,625 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:07:21,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:07:21,625 INFO L82 PathProgramCache]: Analyzing trace with hash 654495681, now seen corresponding path program 3 times [2021-03-11 20:07:21,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:07:21,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464256113] [2021-03-11 20:07:21,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:07:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:07:21,765 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-11 20:07:21,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-11 20:07:21,790 INFO L142 QuantifierPusher]: treesize reduction 25, result has 68.4 percent of original size [2021-03-11 20:07:21,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-03-11 20:07:21,840 INFO L142 QuantifierPusher]: treesize reduction 53, result has 55.1 percent of original size [2021-03-11 20:07:21,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-03-11 20:07:21,891 INFO L142 QuantifierPusher]: treesize reduction 48, result has 60.7 percent of original size [2021-03-11 20:07:21,892 INFO L147 QuantifierPusher]: treesize reduction 5, result has 93.2 percent of original size 69 [2021-03-11 20:07:21,948 INFO L142 QuantifierPusher]: treesize reduction 16, result has 78.4 percent of original size [2021-03-11 20:07:21,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 58 [2021-03-11 20:07:21,965 INFO L142 QuantifierPusher]: treesize reduction 38, result has 71.0 percent of original size [2021-03-11 20:07:21,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 93 [2021-03-11 20:07:22,012 INFO L142 QuantifierPusher]: treesize reduction 42, result has 50.6 percent of original size [2021-03-11 20:07:22,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-03-11 20:07:22,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:07:22,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:07:22,050 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:07:22,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464256113] [2021-03-11 20:07:22,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:07:22,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 20:07:22,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44279613] [2021-03-11 20:07:22,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 20:07:22,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:07:22,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 20:07:22,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-03-11 20:07:22,052 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 207 [2021-03-11 20:07:22,053 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 63 transitions, 380 flow. Second operand has 9 states, 9 states have (on average 144.0) internal successors, (1296), 9 states have internal predecessors, (1296), 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:07:22,053 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:07:22,053 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 207 [2021-03-11 20:07:22,053 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:07:22,308 INFO L129 PetriNetUnfolder]: 516/1139 cut-off events. [2021-03-11 20:07:22,308 INFO L130 PetriNetUnfolder]: For 2393/2776 co-relation queries the response was YES. [2021-03-11 20:07:22,314 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4137 conditions, 1139 events. 516/1139 cut-off events. For 2393/2776 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 8706 event pairs, 4 based on Foata normal form. 46/1006 useless extension candidates. Maximal degree in co-relation 4108. Up to 360 conditions per place. [2021-03-11 20:07:22,317 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 14 selfloop transitions, 6 changer transitions 7/74 dead transitions. [2021-03-11 20:07:22,317 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 74 transitions, 516 flow [2021-03-11 20:07:22,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:07:22,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:07:22,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1023 transitions. [2021-03-11 20:07:22,319 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7060041407867494 [2021-03-11 20:07:22,320 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1023 transitions. [2021-03-11 20:07:22,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1023 transitions. [2021-03-11 20:07:22,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:07:22,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1023 transitions. [2021-03-11 20:07:22,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 146.14285714285714) internal successors, (1023), 7 states have internal predecessors, (1023), 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:07:22,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 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:07:22,325 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 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:07:22,325 INFO L185 Difference]: Start difference. First operand has 81 places, 63 transitions, 380 flow. Second operand 7 states and 1023 transitions. [2021-03-11 20:07:22,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 74 transitions, 516 flow [2021-03-11 20:07:22,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 74 transitions, 490 flow, removed 9 selfloop flow, removed 6 redundant places. [2021-03-11 20:07:22,364 INFO L241 Difference]: Finished difference. Result has 81 places, 63 transitions, 391 flow [2021-03-11 20:07:22,364 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=391, PETRI_PLACES=81, PETRI_TRANSITIONS=63} [2021-03-11 20:07:22,364 INFO L335 CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places. [2021-03-11 20:07:22,364 INFO L480 AbstractCegarLoop]: Abstraction has has 81 places, 63 transitions, 391 flow [2021-03-11 20:07:22,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 144.0) internal successors, (1296), 9 states have internal predecessors, (1296), 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:07:22,364 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:07:22,365 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:07:22,365 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-11 20:07:22,365 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:07:22,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:07:22,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1688084647, now seen corresponding path program 4 times [2021-03-11 20:07:22,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:07:22,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518143592] [2021-03-11 20:07:22,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:07:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:07:22,417 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:07:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:07:22,459 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:07:22,503 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 20:07:22,503 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 20:07:22,504 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-11 20:07:22,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 08:07:22 BasicIcfg [2021-03-11 20:07:22,604 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 20:07:22,608 INFO L168 Benchmark]: Toolchain (without parser) took 18863.87 ms. Allocated memory was 255.9 MB in the beginning and 572.5 MB in the end (delta: 316.7 MB). Free memory was 234.1 MB in the beginning and 230.3 MB in the end (delta: 3.8 MB). Peak memory consumption was 320.8 MB. Max. memory is 16.0 GB. [2021-03-11 20:07:22,608 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 20:07:22,608 INFO L168 Benchmark]: CACSL2BoogieTranslator took 625.09 ms. Allocated memory was 255.9 MB in the beginning and 327.2 MB in the end (delta: 71.3 MB). Free memory was 233.7 MB in the beginning and 285.8 MB in the end (delta: -52.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-11 20:07:22,608 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.05 ms. Allocated memory is still 327.2 MB. Free memory was 285.8 MB in the beginning and 283.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-11 20:07:22,609 INFO L168 Benchmark]: Boogie Preprocessor took 61.35 ms. Allocated memory is still 327.2 MB. Free memory was 283.1 MB in the beginning and 280.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:07:22,609 INFO L168 Benchmark]: RCFGBuilder took 1924.69 ms. Allocated memory is still 327.2 MB. Free memory was 280.5 MB in the beginning and 181.1 MB in the end (delta: 99.4 MB). Peak memory consumption was 103.5 MB. Max. memory is 16.0 GB. [2021-03-11 20:07:22,609 INFO L168 Benchmark]: TraceAbstraction took 16162.00 ms. Allocated memory was 327.2 MB in the beginning and 572.5 MB in the end (delta: 245.4 MB). Free memory was 181.1 MB in the beginning and 230.3 MB in the end (delta: -49.2 MB). Peak memory consumption was 196.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:07:22,610 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.12 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 625.09 ms. Allocated memory was 255.9 MB in the beginning and 327.2 MB in the end (delta: 71.3 MB). Free memory was 233.7 MB in the beginning and 285.8 MB in the end (delta: -52.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 82.05 ms. Allocated memory is still 327.2 MB. Free memory was 285.8 MB in the beginning and 283.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 61.35 ms. Allocated memory is still 327.2 MB. Free memory was 283.1 MB in the beginning and 280.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1924.69 ms. Allocated memory is still 327.2 MB. Free memory was 280.5 MB in the beginning and 181.1 MB in the end (delta: 99.4 MB). Peak memory consumption was 103.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 16162.00 ms. Allocated memory was 327.2 MB in the beginning and 572.5 MB in the end (delta: 245.4 MB). Free memory was 181.1 MB in the beginning and 230.3 MB in the end (delta: -49.2 MB). Peak memory consumption was 196.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9103.5ms, 122 PlacesBefore, 43 PlacesAfterwards, 111 TransitionsBefore, 31 TransitionsAfterwards, 2630 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 7499 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3256, positive: 3043, positive conditional: 0, positive unconditional: 3043, negative: 213, negative conditional: 0, negative unconditional: 213, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1836, positive: 1775, positive conditional: 0, positive unconditional: 1775, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1836, positive: 1740, positive conditional: 0, positive unconditional: 1740, negative: 96, negative conditional: 0, negative unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 96, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1266, positive: 85, positive conditional: 0, positive unconditional: 85, negative: 1182, negative conditional: 0, negative unconditional: 1182, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3256, positive: 1268, positive conditional: 0, positive unconditional: 1268, negative: 152, negative conditional: 0, negative unconditional: 152, unknown: 1836, unknown conditional: 0, unknown unconditional: 1836] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 183, Positive conditional cache size: 0, Positive unconditional cache size: 183, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff0_thd4; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$r_buff1_thd4; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t813; [L845] FCALL, FORK 0 pthread_create(&t813, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] 0 pthread_t t814; [L847] FCALL, FORK 0 pthread_create(&t814, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t815; [L849] FCALL, FORK 0 pthread_create(&t815, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t816; [L851] FCALL, FORK 0 pthread_create(&t816, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L816] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L766] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 2 return 0; [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L823] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L824] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L826] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L826] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L857] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L869] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L870] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L871] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L872] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L874] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 15958.9ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3900.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9178.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 102 SDtfs, 75 SDslu, 134 SDs, 0 SdLazy, 616 SolverSat, 152 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 729.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1090.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=601occurred in iteration=12, InterpolantAutomatonStates: 98, 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: 53.5ms SsaConstructionTime, 678.1ms SatisfiabilityAnalysisTime, 1799.2ms InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 2554 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...