/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:38:59,255 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:38:59,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:38:59,301 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:38:59,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:38:59,310 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:38:59,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:38:59,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:38:59,320 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:38:59,323 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:38:59,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:38:59,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:38:59,325 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:38:59,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:38:59,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:38:59,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:38:59,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:38:59,336 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:38:59,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:38:59,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:38:59,349 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:38:59,350 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:38:59,351 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:38:59,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:38:59,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:38:59,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:38:59,364 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:38:59,369 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:38:59,370 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:38:59,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:38:59,371 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:38:59,372 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:38:59,376 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:38:59,377 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:38:59,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:38:59,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:38:59,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:38:59,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:38:59,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:38:59,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:38:59,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:38:59,387 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 [2020-10-16 01:38:59,424 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:38:59,424 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:38:59,425 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:38:59,426 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:38:59,426 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:38:59,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:38:59,427 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:38:59,427 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:38:59,427 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:38:59,427 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:38:59,428 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:38:59,428 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:38:59,428 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:38:59,429 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:38:59,429 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:38:59,429 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:38:59,429 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:38:59,430 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:38:59,430 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:38:59,430 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:38:59,430 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:38:59,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:38:59,431 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:38:59,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:38:59,431 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:38:59,431 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:38:59,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:38:59,432 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:38:59,432 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:38:59,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:38:59,770 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:38:59,774 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:38:59,776 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:38:59,777 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:38:59,777 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i [2020-10-16 01:38:59,853 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8cf07258/c6bcd1d7501943cdb2ba70f74a67119c/FLAG381a0e7ef [2020-10-16 01:39:00,398 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:39:00,399 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i [2020-10-16 01:39:00,424 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8cf07258/c6bcd1d7501943cdb2ba70f74a67119c/FLAG381a0e7ef [2020-10-16 01:39:00,687 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8cf07258/c6bcd1d7501943cdb2ba70f74a67119c [2020-10-16 01:39:00,696 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:39:00,697 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:39:00,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:39:00,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:39:00,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:39:00,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:39:00" (1/1) ... [2020-10-16 01:39:00,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e26a2d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:00, skipping insertion in model container [2020-10-16 01:39:00,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:39:00" (1/1) ... [2020-10-16 01:39:00,717 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:39:00,787 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:39:01,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:39:01,295 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:39:01,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:39:01,450 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:39:01,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:01 WrapperNode [2020-10-16 01:39:01,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:39:01,452 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:39:01,452 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:39:01,452 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:39:01,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:01" (1/1) ... [2020-10-16 01:39:01,482 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:01" (1/1) ... [2020-10-16 01:39:01,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:39:01,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:39:01,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:39:01,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:39:01,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:01" (1/1) ... [2020-10-16 01:39:01,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:01" (1/1) ... [2020-10-16 01:39:01,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:01" (1/1) ... [2020-10-16 01:39:01,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:01" (1/1) ... [2020-10-16 01:39:01,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:01" (1/1) ... [2020-10-16 01:39:01,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:01" (1/1) ... [2020-10-16 01:39:01,588 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:01" (1/1) ... [2020-10-16 01:39:01,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:39:01,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:39:01,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:39:01,597 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:39:01,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:01" (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 [2020-10-16 01:39:01,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:39:01,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:39:01,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:39:01,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:39:01,669 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:39:01,670 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:39:01,670 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:39:01,670 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:39:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:39:01,672 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:39:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:39:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:39:01,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:39:01,676 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 01:39:03,871 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:39:03,871 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:39:03,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:39:03 BoogieIcfgContainer [2020-10-16 01:39:03,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:39:03,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:39:03,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:39:03,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:39:03,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:39:00" (1/3) ... [2020-10-16 01:39:03,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70161a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:39:03, skipping insertion in model container [2020-10-16 01:39:03,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:39:01" (2/3) ... [2020-10-16 01:39:03,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70161a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:39:03, skipping insertion in model container [2020-10-16 01:39:03,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:39:03" (3/3) ... [2020-10-16 01:39:03,882 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_power.opt.i [2020-10-16 01:39:03,894 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:39:03,902 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:39:03,903 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:39:03,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,935 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,935 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,938 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,938 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,939 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,939 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,940 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,940 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,942 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,942 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,942 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,942 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,944 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,944 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,947 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,951 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,951 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,951 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,952 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,952 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,952 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,952 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,961 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,961 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,963 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,963 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,963 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:39:03,983 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 01:39:04,005 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:39:04,005 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:39:04,005 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:39:04,006 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:39:04,006 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:39:04,006 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:39:04,006 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:39:04,006 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:39:04,020 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-16 01:39:04,068 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-16 01:39:04,068 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:39:04,074 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 01:39:04,074 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 92 transitions, 199 flow [2020-10-16 01:39:04,081 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 89 transitions, 187 flow [2020-10-16 01:39:04,083 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:39:04,086 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 89 transitions, 187 flow [2020-10-16 01:39:04,089 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 89 transitions, 187 flow [2020-10-16 01:39:04,089 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 97 places, 89 transitions, 187 flow [2020-10-16 01:39:04,152 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-16 01:39:04,152 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:39:04,153 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 01:39:04,158 INFO L117 LiptonReduction]: Number of co-enabled transitions 1642 [2020-10-16 01:39:04,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:04,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:04,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:04,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:04,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:04,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:04,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:04,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:04,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:04,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:04,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:04,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:04,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:04,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:04,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:04,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:04,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:04,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:04,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:04,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:04,621 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:04,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:04,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:04,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:04,643 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:04,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:04,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:04,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:04,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:04,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:04,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:04,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:04,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:04,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:04,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:04,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:04,730 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:04,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:04,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:04,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:04,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:04,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:04,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:04,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:04,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:04,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:04,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:04,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:04,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:04,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:04,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:04,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:04,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:04,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:04,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:04,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:04,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:04,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:04,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:04,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:04,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:04,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:04,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:04,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:04,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:04,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:04,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:04,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:04,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:04,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:04,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:04,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:04,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:04,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:04,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:04,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:04,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:04,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:04,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:04,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:05,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:39:05,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:05,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:39:05,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:05,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:39:05,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:39:05,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:39:05,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:39:05,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:39:05,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:39:05,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:39:05,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:39:05,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:05,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:05,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:05,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:05,633 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:05,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:05,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:05,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:05,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:05,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:05,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:05,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:05,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:05,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:05,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:05,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:06,132 WARN L193 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2020-10-16 01:39:06,251 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-10-16 01:39:06,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:06,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:06,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:06,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:06,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:06,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:06,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:06,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:06,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:06,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:06,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:06,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:06,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:06,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:06,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:06,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:06,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:06,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:06,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:06,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:06,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:06,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:39:06,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:06,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:39:06,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:06,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:06,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:06,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:06,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:06,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:06,548 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:06,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:06,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:39:06,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:06,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:06,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:06,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:06,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:06,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:06,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:06,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:06,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:06,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:06,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:06,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:06,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:06,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:06,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:39:06,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:06,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:39:06,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:06,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:06,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:06,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:06,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:06,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:06,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:06,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:06,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:06,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:06,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:06,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:39:06,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:39:06,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:06,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:39:06,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:39:07,324 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-16 01:39:07,436 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-16 01:39:07,443 INFO L132 LiptonReduction]: Checked pairs total: 4263 [2020-10-16 01:39:07,443 INFO L134 LiptonReduction]: Total number of compositions: 76 [2020-10-16 01:39:07,446 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3365 [2020-10-16 01:39:07,453 INFO L129 PetriNetUnfolder]: 0/7 cut-off events. [2020-10-16 01:39:07,453 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:39:07,454 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:39:07,455 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 01:39:07,455 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:39:07,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:39:07,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1000615786, now seen corresponding path program 1 times [2020-10-16 01:39:07,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:39:07,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852009115] [2020-10-16 01:39:07,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:39:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:39:07,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:39:07,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852009115] [2020-10-16 01:39:07,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:39:07,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:39:07,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457818397] [2020-10-16 01:39:07,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:39:07,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:39:07,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:39:07,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:39:07,728 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 168 [2020-10-16 01:39:07,730 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states. [2020-10-16 01:39:07,730 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:39:07,730 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 168 [2020-10-16 01:39:07,732 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:39:07,831 INFO L129 PetriNetUnfolder]: 49/132 cut-off events. [2020-10-16 01:39:07,832 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:39:07,833 INFO L80 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 132 events. 49/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 574 event pairs, 27 based on Foata normal form. 11/126 useless extension candidates. Maximal degree in co-relation 218. Up to 65 conditions per place. [2020-10-16 01:39:07,835 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 9 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2020-10-16 01:39:07,835 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 85 flow [2020-10-16 01:39:07,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:39:07,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:39:07,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2020-10-16 01:39:07,854 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8670634920634921 [2020-10-16 01:39:07,855 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2020-10-16 01:39:07,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2020-10-16 01:39:07,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:39:07,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2020-10-16 01:39:07,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:39:07,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:39:07,874 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:39:07,876 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 437 transitions. [2020-10-16 01:39:07,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 85 flow [2020-10-16 01:39:07,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 82 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 01:39:07,883 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 56 flow [2020-10-16 01:39:07,886 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2020-10-16 01:39:07,887 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2020-10-16 01:39:07,887 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2020-10-16 01:39:07,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:39:07,887 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:39:07,887 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:39:07,888 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:39:07,888 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:39:07,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:39:07,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1651972836, now seen corresponding path program 1 times [2020-10-16 01:39:07,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:39:07,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328483671] [2020-10-16 01:39:07,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:39:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:39:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:39:08,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328483671] [2020-10-16 01:39:08,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:39:08,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:39:08,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587970369] [2020-10-16 01:39:08,045 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:39:08,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:39:08,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:39:08,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:39:08,048 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 168 [2020-10-16 01:39:08,049 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand 4 states. [2020-10-16 01:39:08,049 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:39:08,049 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 168 [2020-10-16 01:39:08,049 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:39:08,105 INFO L129 PetriNetUnfolder]: 13/60 cut-off events. [2020-10-16 01:39:08,106 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:39:08,106 INFO L80 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 60 events. 13/60 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 177 event pairs, 2 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 93. Up to 15 conditions per place. [2020-10-16 01:39:08,107 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 4 selfloop transitions, 3 changer transitions 8/32 dead transitions. [2020-10-16 01:39:08,107 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 104 flow [2020-10-16 01:39:08,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:39:08,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:39:08,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 692 transitions. [2020-10-16 01:39:08,111 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8238095238095238 [2020-10-16 01:39:08,112 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 692 transitions. [2020-10-16 01:39:08,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 692 transitions. [2020-10-16 01:39:08,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:39:08,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 692 transitions. [2020-10-16 01:39:08,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:39:08,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:39:08,117 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:39:08,117 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 5 states and 692 transitions. [2020-10-16 01:39:08,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 104 flow [2020-10-16 01:39:08,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 32 transitions, 100 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:39:08,119 INFO L241 Difference]: Finished difference. Result has 37 places, 24 transitions, 77 flow [2020-10-16 01:39:08,119 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=77, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2020-10-16 01:39:08,120 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2020-10-16 01:39:08,120 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 77 flow [2020-10-16 01:39:08,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:39:08,120 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:39:08,120 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:39:08,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:39:08,121 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:39:08,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:39:08,121 INFO L82 PathProgramCache]: Analyzing trace with hash 328529813, now seen corresponding path program 1 times [2020-10-16 01:39:08,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:39:08,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872517835] [2020-10-16 01:39:08,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:39:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:39:08,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:39:08,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872517835] [2020-10-16 01:39:08,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:39:08,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:39:08,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564151751] [2020-10-16 01:39:08,250 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:39:08,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:39:08,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:39:08,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:39:08,253 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 168 [2020-10-16 01:39:08,253 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 77 flow. Second operand 4 states. [2020-10-16 01:39:08,254 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:39:08,254 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 168 [2020-10-16 01:39:08,254 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:39:08,301 INFO L129 PetriNetUnfolder]: 5/41 cut-off events. [2020-10-16 01:39:08,301 INFO L130 PetriNetUnfolder]: For 23/24 co-relation queries the response was YES. [2020-10-16 01:39:08,302 INFO L80 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 41 events. 5/41 cut-off events. For 23/24 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 96 event pairs, 2 based on Foata normal form. 3/43 useless extension candidates. Maximal degree in co-relation 80. Up to 14 conditions per place. [2020-10-16 01:39:08,302 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 2 selfloop transitions, 2 changer transitions 2/26 dead transitions. [2020-10-16 01:39:08,302 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 26 transitions, 95 flow [2020-10-16 01:39:08,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:39:08,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:39:08,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 703 transitions. [2020-10-16 01:39:08,306 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8369047619047619 [2020-10-16 01:39:08,306 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 703 transitions. [2020-10-16 01:39:08,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 703 transitions. [2020-10-16 01:39:08,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:39:08,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 703 transitions. [2020-10-16 01:39:08,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:39:08,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:39:08,310 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:39:08,310 INFO L185 Difference]: Start difference. First operand has 37 places, 24 transitions, 77 flow. Second operand 5 states and 703 transitions. [2020-10-16 01:39:08,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 26 transitions, 95 flow [2020-10-16 01:39:08,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 26 transitions, 90 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:39:08,312 INFO L241 Difference]: Finished difference. Result has 39 places, 24 transitions, 84 flow [2020-10-16 01:39:08,312 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2020-10-16 01:39:08,313 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2020-10-16 01:39:08,313 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 84 flow [2020-10-16 01:39:08,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:39:08,313 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:39:08,313 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:39:08,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:39:08,314 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:39:08,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:39:08,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1594594774, now seen corresponding path program 1 times [2020-10-16 01:39:08,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:39:08,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066215563] [2020-10-16 01:39:08,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:39:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:39:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:39:08,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066215563] [2020-10-16 01:39:08,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:39:08,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:39:08,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175226533] [2020-10-16 01:39:08,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:39:08,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:39:08,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:39:08,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:39:08,431 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 168 [2020-10-16 01:39:08,432 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 84 flow. Second operand 5 states. [2020-10-16 01:39:08,432 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:39:08,432 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 168 [2020-10-16 01:39:08,432 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:39:08,554 INFO L129 PetriNetUnfolder]: 12/63 cut-off events. [2020-10-16 01:39:08,555 INFO L130 PetriNetUnfolder]: For 75/77 co-relation queries the response was YES. [2020-10-16 01:39:08,555 INFO L80 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 63 events. 12/63 cut-off events. For 75/77 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 214 event pairs, 4 based on Foata normal form. 7/68 useless extension candidates. Maximal degree in co-relation 141. Up to 25 conditions per place. [2020-10-16 01:39:08,556 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 2 selfloop transitions, 3 changer transitions 4/28 dead transitions. [2020-10-16 01:39:08,556 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 28 transitions, 121 flow [2020-10-16 01:39:08,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:39:08,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:39:08,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 803 transitions. [2020-10-16 01:39:08,560 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7966269841269841 [2020-10-16 01:39:08,560 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 803 transitions. [2020-10-16 01:39:08,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 803 transitions. [2020-10-16 01:39:08,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:39:08,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 803 transitions. [2020-10-16 01:39:08,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:39:08,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:39:08,564 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:39:08,565 INFO L185 Difference]: Start difference. First operand has 39 places, 24 transitions, 84 flow. Second operand 6 states and 803 transitions. [2020-10-16 01:39:08,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 28 transitions, 121 flow [2020-10-16 01:39:08,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 28 transitions, 111 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 01:39:08,567 INFO L241 Difference]: Finished difference. Result has 42 places, 24 transitions, 94 flow [2020-10-16 01:39:08,568 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=94, PETRI_PLACES=42, PETRI_TRANSITIONS=24} [2020-10-16 01:39:08,568 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2020-10-16 01:39:08,568 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 24 transitions, 94 flow [2020-10-16 01:39:08,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:39:08,568 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:39:08,568 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:39:08,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:39:08,569 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:39:08,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:39:08,569 INFO L82 PathProgramCache]: Analyzing trace with hash 139642884, now seen corresponding path program 1 times [2020-10-16 01:39:08,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:39:08,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352043691] [2020-10-16 01:39:08,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:39:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:39:08,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:39:08,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352043691] [2020-10-16 01:39:08,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:39:08,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:39:08,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548216863] [2020-10-16 01:39:08,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:39:08,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:39:08,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:39:08,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:39:08,756 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 168 [2020-10-16 01:39:08,756 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 24 transitions, 94 flow. Second operand 6 states. [2020-10-16 01:39:08,756 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:39:08,757 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 168 [2020-10-16 01:39:08,757 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:39:08,976 INFO L129 PetriNetUnfolder]: 113/265 cut-off events. [2020-10-16 01:39:08,976 INFO L130 PetriNetUnfolder]: For 450/455 co-relation queries the response was YES. [2020-10-16 01:39:08,978 INFO L80 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 265 events. 113/265 cut-off events. For 450/455 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1304 event pairs, 61 based on Foata normal form. 19/264 useless extension candidates. Maximal degree in co-relation 652. Up to 155 conditions per place. [2020-10-16 01:39:08,980 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 10 selfloop transitions, 6 changer transitions 8/39 dead transitions. [2020-10-16 01:39:08,980 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 180 flow [2020-10-16 01:39:08,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:39:08,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:39:08,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 728 transitions. [2020-10-16 01:39:08,984 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2020-10-16 01:39:08,984 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 728 transitions. [2020-10-16 01:39:08,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 728 transitions. [2020-10-16 01:39:08,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:39:08,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 728 transitions. [2020-10-16 01:39:08,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:39:08,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:39:08,988 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:39:08,989 INFO L185 Difference]: Start difference. First operand has 42 places, 24 transitions, 94 flow. Second operand 6 states and 728 transitions. [2020-10-16 01:39:08,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 180 flow [2020-10-16 01:39:08,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 160 flow, removed 6 selfloop flow, removed 6 redundant places. [2020-10-16 01:39:08,993 INFO L241 Difference]: Finished difference. Result has 43 places, 29 transitions, 125 flow [2020-10-16 01:39:08,993 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=125, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2020-10-16 01:39:08,993 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2020-10-16 01:39:08,993 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 125 flow [2020-10-16 01:39:08,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:39:08,994 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:39:08,994 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:39:08,994 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:39:08,994 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:39:08,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:39:08,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1830149680, now seen corresponding path program 1 times [2020-10-16 01:39:08,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:39:08,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031591841] [2020-10-16 01:39:08,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:39:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:39:09,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:39:09,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031591841] [2020-10-16 01:39:09,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:39:09,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:39:09,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878125497] [2020-10-16 01:39:09,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:39:09,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:39:09,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:39:09,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:39:09,117 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 168 [2020-10-16 01:39:09,118 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 125 flow. Second operand 6 states. [2020-10-16 01:39:09,118 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:39:09,118 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 168 [2020-10-16 01:39:09,118 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:39:09,332 INFO L129 PetriNetUnfolder]: 141/309 cut-off events. [2020-10-16 01:39:09,333 INFO L130 PetriNetUnfolder]: For 451/501 co-relation queries the response was YES. [2020-10-16 01:39:09,334 INFO L80 FinitePrefix]: Finished finitePrefix Result has 964 conditions, 309 events. 141/309 cut-off events. For 451/501 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1446 event pairs, 43 based on Foata normal form. 14/313 useless extension candidates. Maximal degree in co-relation 947. Up to 182 conditions per place. [2020-10-16 01:39:09,337 INFO L132 encePairwiseOnDemand]: 159/168 looper letters, 12 selfloop transitions, 13 changer transitions 7/47 dead transitions. [2020-10-16 01:39:09,337 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 277 flow [2020-10-16 01:39:09,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:39:09,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:39:09,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 883 transitions. [2020-10-16 01:39:09,341 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7508503401360545 [2020-10-16 01:39:09,341 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 883 transitions. [2020-10-16 01:39:09,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 883 transitions. [2020-10-16 01:39:09,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:39:09,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 883 transitions. [2020-10-16 01:39:09,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:39:09,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:39:09,346 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:39:09,346 INFO L185 Difference]: Start difference. First operand has 43 places, 29 transitions, 125 flow. Second operand 7 states and 883 transitions. [2020-10-16 01:39:09,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 47 transitions, 277 flow [2020-10-16 01:39:09,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 273 flow, removed 2 selfloop flow, removed 1 redundant places. [2020-10-16 01:39:09,350 INFO L241 Difference]: Finished difference. Result has 50 places, 38 transitions, 222 flow [2020-10-16 01:39:09,350 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2020-10-16 01:39:09,350 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2020-10-16 01:39:09,350 INFO L481 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 222 flow [2020-10-16 01:39:09,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:39:09,351 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:39:09,351 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:39:09,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:39:09,351 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:39:09,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:39:09,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1528059354, now seen corresponding path program 2 times [2020-10-16 01:39:09,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:39:09,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226403277] [2020-10-16 01:39:09,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:39:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:39:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:39:09,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226403277] [2020-10-16 01:39:09,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:39:09,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:39:09,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923307157] [2020-10-16 01:39:09,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:39:09,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:39:09,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:39:09,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:39:09,484 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 168 [2020-10-16 01:39:09,485 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 222 flow. Second operand 7 states. [2020-10-16 01:39:09,485 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:39:09,485 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 168 [2020-10-16 01:39:09,486 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:39:09,809 INFO L129 PetriNetUnfolder]: 142/314 cut-off events. [2020-10-16 01:39:09,810 INFO L130 PetriNetUnfolder]: For 1069/1200 co-relation queries the response was YES. [2020-10-16 01:39:09,812 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1284 conditions, 314 events. 142/314 cut-off events. For 1069/1200 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1492 event pairs, 40 based on Foata normal form. 35/335 useless extension candidates. Maximal degree in co-relation 1262. Up to 163 conditions per place. [2020-10-16 01:39:09,815 INFO L132 encePairwiseOnDemand]: 160/168 looper letters, 13 selfloop transitions, 18 changer transitions 12/58 dead transitions. [2020-10-16 01:39:09,815 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 58 transitions, 452 flow [2020-10-16 01:39:09,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:39:09,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:39:09,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 985 transitions. [2020-10-16 01:39:09,820 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7328869047619048 [2020-10-16 01:39:09,820 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 985 transitions. [2020-10-16 01:39:09,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 985 transitions. [2020-10-16 01:39:09,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:39:09,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 985 transitions. [2020-10-16 01:39:09,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:39:09,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:39:09,827 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:39:09,827 INFO L185 Difference]: Start difference. First operand has 50 places, 38 transitions, 222 flow. Second operand 8 states and 985 transitions. [2020-10-16 01:39:09,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 58 transitions, 452 flow [2020-10-16 01:39:09,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 58 transitions, 427 flow, removed 12 selfloop flow, removed 3 redundant places. [2020-10-16 01:39:09,833 INFO L241 Difference]: Finished difference. Result has 57 places, 44 transitions, 311 flow [2020-10-16 01:39:09,834 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=311, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2020-10-16 01:39:09,834 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 23 predicate places. [2020-10-16 01:39:09,834 INFO L481 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 311 flow [2020-10-16 01:39:09,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:39:09,835 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:39:09,835 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:39:09,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:39:09,835 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:39:09,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:39:09,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1542832913, now seen corresponding path program 1 times [2020-10-16 01:39:09,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:39:09,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714286851] [2020-10-16 01:39:09,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:39:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:39:09,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:39:09,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714286851] [2020-10-16 01:39:09,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:39:09,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:39:09,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427324277] [2020-10-16 01:39:09,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:39:09,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:39:09,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:39:09,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:39:09,918 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 168 [2020-10-16 01:39:09,918 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 311 flow. Second operand 4 states. [2020-10-16 01:39:09,919 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:39:09,919 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 168 [2020-10-16 01:39:09,919 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:39:10,052 INFO L129 PetriNetUnfolder]: 145/347 cut-off events. [2020-10-16 01:39:10,052 INFO L130 PetriNetUnfolder]: For 1199/1239 co-relation queries the response was YES. [2020-10-16 01:39:10,055 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 347 events. 145/347 cut-off events. For 1199/1239 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1889 event pairs, 45 based on Foata normal form. 38/355 useless extension candidates. Maximal degree in co-relation 1310. Up to 93 conditions per place. [2020-10-16 01:39:10,059 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 9 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2020-10-16 01:39:10,059 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 314 flow [2020-10-16 01:39:10,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:39:10,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:39:10,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 555 transitions. [2020-10-16 01:39:10,062 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8258928571428571 [2020-10-16 01:39:10,062 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 555 transitions. [2020-10-16 01:39:10,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 555 transitions. [2020-10-16 01:39:10,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:39:10,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 555 transitions. [2020-10-16 01:39:10,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:39:10,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:39:10,066 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:39:10,066 INFO L185 Difference]: Start difference. First operand has 57 places, 44 transitions, 311 flow. Second operand 4 states and 555 transitions. [2020-10-16 01:39:10,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 314 flow [2020-10-16 01:39:10,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 47 transitions, 281 flow, removed 10 selfloop flow, removed 7 redundant places. [2020-10-16 01:39:10,072 INFO L241 Difference]: Finished difference. Result has 52 places, 44 transitions, 281 flow [2020-10-16 01:39:10,072 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=281, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2020-10-16 01:39:10,073 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 18 predicate places. [2020-10-16 01:39:10,073 INFO L481 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 281 flow [2020-10-16 01:39:10,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:39:10,073 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:39:10,073 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:39:10,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:39:10,074 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:39:10,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:39:10,074 INFO L82 PathProgramCache]: Analyzing trace with hash 31885239, now seen corresponding path program 1 times [2020-10-16 01:39:10,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:39:10,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518644214] [2020-10-16 01:39:10,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:39:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:39:10,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:39:10,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518644214] [2020-10-16 01:39:10,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:39:10,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:39:10,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375132777] [2020-10-16 01:39:10,153 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:39:10,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:39:10,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:39:10,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:39:10,154 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 168 [2020-10-16 01:39:10,155 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 281 flow. Second operand 5 states. [2020-10-16 01:39:10,155 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:39:10,155 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 168 [2020-10-16 01:39:10,155 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:39:10,236 INFO L129 PetriNetUnfolder]: 62/199 cut-off events. [2020-10-16 01:39:10,237 INFO L130 PetriNetUnfolder]: For 374/520 co-relation queries the response was YES. [2020-10-16 01:39:10,239 INFO L80 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 199 events. 62/199 cut-off events. For 374/520 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1004 event pairs, 7 based on Foata normal form. 42/215 useless extension candidates. Maximal degree in co-relation 726. Up to 94 conditions per place. [2020-10-16 01:39:10,240 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 10 selfloop transitions, 8 changer transitions 0/49 dead transitions. [2020-10-16 01:39:10,240 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 49 transitions, 328 flow [2020-10-16 01:39:10,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:39:10,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:39:10,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 694 transitions. [2020-10-16 01:39:10,244 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8261904761904761 [2020-10-16 01:39:10,244 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 694 transitions. [2020-10-16 01:39:10,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 694 transitions. [2020-10-16 01:39:10,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:39:10,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 694 transitions. [2020-10-16 01:39:10,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:39:10,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:39:10,249 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:39:10,249 INFO L185 Difference]: Start difference. First operand has 52 places, 44 transitions, 281 flow. Second operand 5 states and 694 transitions. [2020-10-16 01:39:10,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 49 transitions, 328 flow [2020-10-16 01:39:10,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 49 transitions, 325 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:39:10,253 INFO L241 Difference]: Finished difference. Result has 57 places, 46 transitions, 319 flow [2020-10-16 01:39:10,253 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=319, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2020-10-16 01:39:10,253 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 23 predicate places. [2020-10-16 01:39:10,254 INFO L481 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 319 flow [2020-10-16 01:39:10,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:39:10,254 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:39:10,254 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:39:10,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:39:10,254 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:39:10,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:39:10,255 INFO L82 PathProgramCache]: Analyzing trace with hash 978627773, now seen corresponding path program 1 times [2020-10-16 01:39:10,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:39:10,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745135966] [2020-10-16 01:39:10,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:39:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:39:10,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:39:10,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745135966] [2020-10-16 01:39:10,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:39:10,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:39:10,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576542221] [2020-10-16 01:39:10,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:39:10,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:39:10,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:39:10,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:39:10,333 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 168 [2020-10-16 01:39:10,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 319 flow. Second operand 4 states. [2020-10-16 01:39:10,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:39:10,334 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 168 [2020-10-16 01:39:10,334 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:39:10,419 INFO L129 PetriNetUnfolder]: 94/311 cut-off events. [2020-10-16 01:39:10,420 INFO L130 PetriNetUnfolder]: For 925/1054 co-relation queries the response was YES. [2020-10-16 01:39:10,422 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1290 conditions, 311 events. 94/311 cut-off events. For 925/1054 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1902 event pairs, 10 based on Foata normal form. 24/299 useless extension candidates. Maximal degree in co-relation 1263. Up to 158 conditions per place. [2020-10-16 01:39:10,424 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 5 selfloop transitions, 3 changer transitions 3/49 dead transitions. [2020-10-16 01:39:10,424 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 49 transitions, 363 flow [2020-10-16 01:39:10,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:39:10,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:39:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 686 transitions. [2020-10-16 01:39:10,427 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2020-10-16 01:39:10,427 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 686 transitions. [2020-10-16 01:39:10,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 686 transitions. [2020-10-16 01:39:10,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:39:10,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 686 transitions. [2020-10-16 01:39:10,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:39:10,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:39:10,432 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:39:10,432 INFO L185 Difference]: Start difference. First operand has 57 places, 46 transitions, 319 flow. Second operand 5 states and 686 transitions. [2020-10-16 01:39:10,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 49 transitions, 363 flow [2020-10-16 01:39:10,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 49 transitions, 347 flow, removed 5 selfloop flow, removed 2 redundant places. [2020-10-16 01:39:10,437 INFO L241 Difference]: Finished difference. Result has 62 places, 45 transitions, 315 flow [2020-10-16 01:39:10,437 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=315, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2020-10-16 01:39:10,437 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 28 predicate places. [2020-10-16 01:39:10,438 INFO L481 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 315 flow [2020-10-16 01:39:10,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:39:10,438 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:39:10,438 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:39:10,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:39:10,438 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:39:10,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:39:10,439 INFO L82 PathProgramCache]: Analyzing trace with hash -711842734, now seen corresponding path program 1 times [2020-10-16 01:39:10,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:39:10,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166654398] [2020-10-16 01:39:10,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:39:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:39:10,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:39:10,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166654398] [2020-10-16 01:39:10,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:39:10,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:39:10,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846702487] [2020-10-16 01:39:10,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:39:10,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:39:10,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:39:10,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:39:10,544 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 168 [2020-10-16 01:39:10,544 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 315 flow. Second operand 6 states. [2020-10-16 01:39:10,544 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:39:10,544 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 168 [2020-10-16 01:39:10,545 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:39:10,649 INFO L129 PetriNetUnfolder]: 77/246 cut-off events. [2020-10-16 01:39:10,649 INFO L130 PetriNetUnfolder]: For 776/1183 co-relation queries the response was YES. [2020-10-16 01:39:10,651 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1045 conditions, 246 events. 77/246 cut-off events. For 776/1183 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1431 event pairs, 2 based on Foata normal form. 67/278 useless extension candidates. Maximal degree in co-relation 1021. Up to 99 conditions per place. [2020-10-16 01:39:10,652 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 4 selfloop transitions, 11 changer transitions 7/44 dead transitions. [2020-10-16 01:39:10,652 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 44 transitions, 331 flow [2020-10-16 01:39:10,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:39:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:39:10,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 827 transitions. [2020-10-16 01:39:10,656 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8204365079365079 [2020-10-16 01:39:10,656 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 827 transitions. [2020-10-16 01:39:10,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 827 transitions. [2020-10-16 01:39:10,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:39:10,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 827 transitions. [2020-10-16 01:39:10,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:39:10,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:39:10,661 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:39:10,661 INFO L185 Difference]: Start difference. First operand has 62 places, 45 transitions, 315 flow. Second operand 6 states and 827 transitions. [2020-10-16 01:39:10,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 44 transitions, 331 flow [2020-10-16 01:39:10,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 44 transitions, 275 flow, removed 14 selfloop flow, removed 8 redundant places. [2020-10-16 01:39:10,665 INFO L241 Difference]: Finished difference. Result has 59 places, 37 transitions, 246 flow [2020-10-16 01:39:10,665 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=59, PETRI_TRANSITIONS=37} [2020-10-16 01:39:10,665 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2020-10-16 01:39:10,665 INFO L481 AbstractCegarLoop]: Abstraction has has 59 places, 37 transitions, 246 flow [2020-10-16 01:39:10,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:39:10,666 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:39:10,666 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] [2020-10-16 01:39:10,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:39:10,666 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:39:10,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:39:10,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1858972429, now seen corresponding path program 1 times [2020-10-16 01:39:10,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:39:10,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586469706] [2020-10-16 01:39:10,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:39:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:39:10,726 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:39:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:39:10,802 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:39:10,863 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:39:10,863 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:39:10,863 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:39:10,893 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,893 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,899 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,900 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,900 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,900 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,900 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,900 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,901 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,901 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,901 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,901 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,902 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,902 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,902 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,902 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,902 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,902 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,903 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,903 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,903 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,903 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,904 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,904 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,904 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,904 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,905 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,905 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,905 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,905 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,905 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,905 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,905 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,906 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,906 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,907 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,907 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,907 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,911 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,911 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,912 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,912 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,912 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,912 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,912 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,912 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,913 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,913 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,913 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,913 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,913 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,913 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,914 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,914 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,914 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,914 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,914 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,914 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,915 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,915 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,915 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,915 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,915 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,916 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,916 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,916 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,916 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,916 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,917 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,917 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,917 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,917 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,918 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,918 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:10,918 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:39:10,918 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:39:11,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:39:11 BasicIcfg [2020-10-16 01:39:11,013 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:39:11,015 INFO L168 Benchmark]: Toolchain (without parser) took 10317.64 ms. Allocated memory was 253.2 MB in the beginning and 500.7 MB in the end (delta: 247.5 MB). Free memory was 208.6 MB in the beginning and 242.7 MB in the end (delta: -34.2 MB). Peak memory consumption was 213.3 MB. Max. memory is 14.2 GB. [2020-10-16 01:39:11,015 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:39:11,016 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.31 ms. Allocated memory was 253.2 MB in the beginning and 319.8 MB in the end (delta: 66.6 MB). Free memory was 208.6 MB in the beginning and 270.0 MB in the end (delta: -61.4 MB). Peak memory consumption was 33.3 MB. Max. memory is 14.2 GB. [2020-10-16 01:39:11,017 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.85 ms. Allocated memory is still 319.8 MB. Free memory was 270.0 MB in the beginning and 267.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:39:11,017 INFO L168 Benchmark]: Boogie Preprocessor took 77.96 ms. Allocated memory is still 319.8 MB. Free memory was 267.5 MB in the beginning and 265.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:39:11,018 INFO L168 Benchmark]: RCFGBuilder took 2276.27 ms. Allocated memory was 319.8 MB in the beginning and 360.7 MB in the end (delta: 40.9 MB). Free memory was 265.0 MB in the beginning and 183.3 MB in the end (delta: 81.7 MB). Peak memory consumption was 122.6 MB. Max. memory is 14.2 GB. [2020-10-16 01:39:11,019 INFO L168 Benchmark]: TraceAbstraction took 7138.51 ms. Allocated memory was 360.7 MB in the beginning and 500.7 MB in the end (delta: 140.0 MB). Free memory was 183.3 MB in the beginning and 242.7 MB in the end (delta: -59.5 MB). Peak memory consumption was 80.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:39:11,023 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 753.31 ms. Allocated memory was 253.2 MB in the beginning and 319.8 MB in the end (delta: 66.6 MB). Free memory was 208.6 MB in the beginning and 270.0 MB in the end (delta: -61.4 MB). Peak memory consumption was 33.3 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 66.85 ms. Allocated memory is still 319.8 MB. Free memory was 270.0 MB in the beginning and 267.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 77.96 ms. Allocated memory is still 319.8 MB. Free memory was 267.5 MB in the beginning and 265.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2276.27 ms. Allocated memory was 319.8 MB in the beginning and 360.7 MB in the end (delta: 40.9 MB). Free memory was 265.0 MB in the beginning and 183.3 MB in the end (delta: 81.7 MB). Peak memory consumption was 122.6 MB. Max. memory is 14.2 GB. * TraceAbstraction took 7138.51 ms. Allocated memory was 360.7 MB in the beginning and 500.7 MB in the end (delta: 140.0 MB). Free memory was 183.3 MB in the beginning and 242.7 MB in the end (delta: -59.5 MB). Peak memory consumption was 80.5 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1026 VarBasedMoverChecksPositive, 62 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 42 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 116 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.3s, 97 PlacesBefore, 34 PlacesAfterwards, 89 TransitionsBefore, 25 TransitionsAfterwards, 1642 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 4263 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L701] 0 _Bool main$tmp_guard0; [L702] 0 _Bool main$tmp_guard1; [L704] 0 int x = 0; [L705] 0 _Bool x$flush_delayed; [L706] 0 int x$mem_tmp; [L707] 0 _Bool x$r_buff0_thd0; [L708] 0 _Bool x$r_buff0_thd1; [L709] 0 _Bool x$r_buff0_thd2; [L710] 0 _Bool x$r_buff0_thd3; [L711] 0 _Bool x$r_buff1_thd0; [L712] 0 _Bool x$r_buff1_thd1; [L713] 0 _Bool x$r_buff1_thd2; [L714] 0 _Bool x$r_buff1_thd3; [L715] 0 _Bool x$read_delayed; [L716] 0 int *x$read_delayed_var; [L717] 0 int x$w_buff0; [L718] 0 _Bool x$w_buff0_used; [L719] 0 int x$w_buff1; [L720] 0 _Bool x$w_buff1_used; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L807] 0 pthread_t t2028; [L808] FCALL, FORK 0 pthread_create(&t2028, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L809] 0 pthread_t t2029; [L810] FCALL, FORK 0 pthread_create(&t2029, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L750] 2 x$w_buff1 = x$w_buff0 [L751] 2 x$w_buff0 = 2 [L752] 2 x$w_buff1_used = x$w_buff0_used [L753] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L755] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L756] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L757] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L758] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L759] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L762] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L811] 0 pthread_t t2030; [L812] FCALL, FORK 0 pthread_create(&t2030, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L779] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L782] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L730] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L736] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L736] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L737] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L738] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L739] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L739] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L740] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L765] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L765] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L767] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L769] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L785] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L785] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L786] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L786] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L787] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L787] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L788] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L788] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L789] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L789] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L745] 1 return 0; [L772] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L774] 2 return 0; [L792] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 3 return 0; [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L3] COND FALSE 0 !(!cond) [L818] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L818] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L818] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L818] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L819] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L819] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L820] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L820] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L821] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L821] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L822] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L822] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L825] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 0 x$flush_delayed = weak$$choice2 [L828] 0 x$mem_tmp = x [L829] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L829] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L829] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L830] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L830] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L830] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L830] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L831] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L831] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L831] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L832] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L832] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L832] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L832] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L833] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L834] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L835] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L835] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L837] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L837] 0 x = x$flush_delayed ? x$mem_tmp : x [L838] 0 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 6.8s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 54 SDtfs, 48 SDslu, 44 SDs, 0 SdLazy, 256 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=319occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 139 ConstructedInterpolants, 0 QuantifiedInterpolants, 9135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...