/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/rfi001_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:32:26,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:32:26,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:32:26,271 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:32:26,272 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:32:26,273 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:32:26,274 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:32:26,276 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:32:26,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:32:26,278 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:32:26,279 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:32:26,280 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:32:26,280 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:32:26,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:32:26,282 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:32:26,283 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:32:26,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:32:26,284 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:32:26,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:32:26,288 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:32:26,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:32:26,290 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:32:26,291 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:32:26,292 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:32:26,294 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:32:26,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:32:26,295 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:32:26,295 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:32:26,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:32:26,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:32:26,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:32:26,297 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:32:26,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:32:26,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:32:26,303 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:32:26,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:32:26,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:32:26,304 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:32:26,304 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:32:26,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:32:26,306 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:32:26,307 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:32:26,354 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:32:26,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:32:26,355 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:32:26,355 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:32:26,356 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:32:26,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:32:26,358 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:32:26,358 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:32:26,358 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:32:26,358 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:32:26,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:32:26,359 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:32:26,360 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:32:26,360 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:32:26,360 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:32:26,360 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:32:26,361 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:32:26,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:32:26,362 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:32:26,362 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:32:26,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:32:26,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:32:26,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:32:26,363 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:32:26,363 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:32:26,363 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:32:26,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:32:26,364 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:32:26,364 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:32:26,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:32:26,659 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:32:26,662 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:32:26,663 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:32:26,664 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:32:26,664 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_tso.oepc.i [2020-10-16 01:32:26,737 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b27254745/7c85f4fdfdfb420880da1430f523c3cc/FLAG824462938 [2020-10-16 01:32:27,232 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:32:27,233 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_tso.oepc.i [2020-10-16 01:32:27,248 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b27254745/7c85f4fdfdfb420880da1430f523c3cc/FLAG824462938 [2020-10-16 01:32:27,603 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b27254745/7c85f4fdfdfb420880da1430f523c3cc [2020-10-16 01:32:27,611 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:32:27,613 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:32:27,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:32:27,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:32:27,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:32:27,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:32:27" (1/1) ... [2020-10-16 01:32:27,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b6f427d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:27, skipping insertion in model container [2020-10-16 01:32:27,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:32:27" (1/1) ... [2020-10-16 01:32:27,631 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:32:27,696 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:32:28,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:32:28,240 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:32:28,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:32:28,388 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:32:28,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:28 WrapperNode [2020-10-16 01:32:28,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:32:28,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:32:28,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:32:28,390 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:32:28,398 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:32:28" (1/1) ... [2020-10-16 01:32:28,417 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:32:28" (1/1) ... [2020-10-16 01:32:28,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:32:28,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:32:28,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:32:28,474 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:32:28,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:28" (1/1) ... [2020-10-16 01:32:28,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:28" (1/1) ... [2020-10-16 01:32:28,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:28" (1/1) ... [2020-10-16 01:32:28,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:28" (1/1) ... [2020-10-16 01:32:28,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:28" (1/1) ... [2020-10-16 01:32:28,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:28" (1/1) ... [2020-10-16 01:32:28,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:28" (1/1) ... [2020-10-16 01:32:28,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:32:28,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:32:28,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:32:28,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:32:28,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:28" (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:32:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:32:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:32:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:32:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:32:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:32:28,566 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:32:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:32:28,567 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:32:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:32:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:32:28,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:32:28,569 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:32:30,361 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:32:30,362 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:32:30,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:32:30 BoogieIcfgContainer [2020-10-16 01:32:30,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:32:30,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:32:30,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:32:30,369 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:32:30,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:32:27" (1/3) ... [2020-10-16 01:32:30,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a098cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:32:30, skipping insertion in model container [2020-10-16 01:32:30,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:28" (2/3) ... [2020-10-16 01:32:30,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a098cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:32:30, skipping insertion in model container [2020-10-16 01:32:30,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:32:30" (3/3) ... [2020-10-16 01:32:30,372 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi001_tso.oepc.i [2020-10-16 01:32:30,383 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:32:30,390 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:32:30,391 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:32:30,417 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,417 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,417 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,418 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,418 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,418 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,418 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,421 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,421 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,421 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,421 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,422 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,422 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,423 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,423 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,423 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,423 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,423 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,430 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,430 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,435 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,435 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,435 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:30,454 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 01:32:30,476 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:32:30,476 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:32:30,476 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:32:30,477 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:32:30,477 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:32:30,477 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:32:30,477 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:32:30,477 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:32:30,490 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 84 places, 79 transitions, 168 flow [2020-10-16 01:32:30,530 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2020-10-16 01:32:30,531 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:32:30,536 INFO L80 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2020-10-16 01:32:30,536 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 79 transitions, 168 flow [2020-10-16 01:32:30,542 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 77 transitions, 160 flow [2020-10-16 01:32:30,545 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:32:30,547 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 77 transitions, 160 flow [2020-10-16 01:32:30,550 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 77 transitions, 160 flow [2020-10-16 01:32:30,550 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 82 places, 77 transitions, 160 flow [2020-10-16 01:32:30,574 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2020-10-16 01:32:30,574 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:32:30,575 INFO L80 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2020-10-16 01:32:30,577 INFO L117 LiptonReduction]: Number of co-enabled transitions 1012 [2020-10-16 01:32:30,671 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:30,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:30,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:30,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:30,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:30,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:30,682 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:30,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:30,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:30,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:30,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:30,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:30,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:30,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:30,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:30,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:30,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:30,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:30,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:30,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:30,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:30,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:30,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:30,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:30,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:30,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:30,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:30,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:30,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:30,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:30,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:30,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:31,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:31,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:31,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-16 01:32:31,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:31,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:32:31,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:31,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:32:31,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:32,186 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-16 01:32:32,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 01:32:32,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:32,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:32:32,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:33,350 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-16 01:32:33,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:33,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:33,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:33,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:33,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:33,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:33,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:33,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:33,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:33,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:33,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:33,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:33,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:33,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:33,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:33,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:33,901 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:32:33,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:33,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-10-16 01:32:33,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:33,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:33,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:33,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:33,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:33,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:32:33,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:33,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:32:33,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:33,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:32:33,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:33,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:32:33,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:33,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:32:33,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:33,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:32:33,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:33,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:32:33,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:34,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:32:34,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:34,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:32:34,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:34,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:32:34,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:34,429 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-10-16 01:32:34,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:34,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:34,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:34,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:34,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:34,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:32:34,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:34,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:32:34,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:34,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:32:34,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:34,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:32:34,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:34,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:32:34,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:34,962 WARN L193 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-10-16 01:32:35,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:35,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:35,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:35,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:35,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:35,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:35,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:35,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:35,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:35,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:35,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:35,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:35,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:35,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:35,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:35,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:35,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:35,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:35,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:35,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:35,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:35,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:35,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:35,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:35,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:35,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:35,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:35,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:35,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:35,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:35,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:35,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:35,714 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-16 01:32:35,852 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-16 01:32:35,860 INFO L132 LiptonReduction]: Checked pairs total: 2464 [2020-10-16 01:32:35,861 INFO L134 LiptonReduction]: Total number of compositions: 69 [2020-10-16 01:32:35,876 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5331 [2020-10-16 01:32:35,883 INFO L129 PetriNetUnfolder]: 0/7 cut-off events. [2020-10-16 01:32:35,884 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:32:35,884 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:35,885 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 01:32:35,886 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:35,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:35,893 INFO L82 PathProgramCache]: Analyzing trace with hash 874871657, now seen corresponding path program 1 times [2020-10-16 01:32:35,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:35,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242722444] [2020-10-16 01:32:35,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:36,265 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:32:36,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242722444] [2020-10-16 01:32:36,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:36,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:32:36,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804926234] [2020-10-16 01:32:36,280 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:32:36,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:36,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:32:36,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:32:36,306 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 148 [2020-10-16 01:32:36,308 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states. [2020-10-16 01:32:36,308 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:36,308 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 148 [2020-10-16 01:32:36,310 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:36,381 INFO L129 PetriNetUnfolder]: 16/60 cut-off events. [2020-10-16 01:32:36,381 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:32:36,382 INFO L80 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 60 events. 16/60 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 207 event pairs, 6 based on Foata normal form. 6/58 useless extension candidates. Maximal degree in co-relation 93. Up to 27 conditions per place. [2020-10-16 01:32:36,384 INFO L132 encePairwiseOnDemand]: 144/148 looper letters, 7 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2020-10-16 01:32:36,384 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 21 transitions, 66 flow [2020-10-16 01:32:36,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:32:36,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:32:36,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2020-10-16 01:32:36,408 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8513513513513513 [2020-10-16 01:32:36,409 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2020-10-16 01:32:36,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2020-10-16 01:32:36,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:36,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2020-10-16 01:32:36,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:32:36,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:32:36,428 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:32:36,430 INFO L185 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 378 transitions. [2020-10-16 01:32:36,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 21 transitions, 66 flow [2020-10-16 01:32:36,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 64 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:32:36,436 INFO L241 Difference]: Finished difference. Result has 25 places, 18 transitions, 44 flow [2020-10-16 01:32:36,441 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2020-10-16 01:32:36,442 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2020-10-16 01:32:36,442 INFO L481 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 44 flow [2020-10-16 01:32:36,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:32:36,443 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:36,443 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:36,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:32:36,444 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:36,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:36,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1440942465, now seen corresponding path program 1 times [2020-10-16 01:32:36,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:36,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421003661] [2020-10-16 01:32:36,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:36,573 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:32:36,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421003661] [2020-10-16 01:32:36,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:36,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:32:36,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206083234] [2020-10-16 01:32:36,577 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:32:36,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:36,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:32:36,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:32:36,580 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 148 [2020-10-16 01:32:36,580 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 44 flow. Second operand 4 states. [2020-10-16 01:32:36,580 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:36,580 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 148 [2020-10-16 01:32:36,581 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:36,700 INFO L129 PetriNetUnfolder]: 47/107 cut-off events. [2020-10-16 01:32:36,701 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2020-10-16 01:32:36,701 INFO L80 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 107 events. 47/107 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 424 event pairs, 13 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 205. Up to 51 conditions per place. [2020-10-16 01:32:36,702 INFO L132 encePairwiseOnDemand]: 143/148 looper letters, 8 selfloop transitions, 2 changer transitions 9/28 dead transitions. [2020-10-16 01:32:36,703 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 28 transitions, 104 flow [2020-10-16 01:32:36,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:32:36,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:32:36,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 546 transitions. [2020-10-16 01:32:36,707 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7378378378378379 [2020-10-16 01:32:36,707 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 546 transitions. [2020-10-16 01:32:36,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 546 transitions. [2020-10-16 01:32:36,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:36,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 546 transitions. [2020-10-16 01:32:36,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:32:36,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:32:36,712 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:32:36,712 INFO L185 Difference]: Start difference. First operand has 25 places, 18 transitions, 44 flow. Second operand 5 states and 546 transitions. [2020-10-16 01:32:36,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 28 transitions, 104 flow [2020-10-16 01:32:36,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 28 transitions, 98 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:32:36,715 INFO L241 Difference]: Finished difference. Result has 30 places, 17 transitions, 50 flow [2020-10-16 01:32:36,715 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=17} [2020-10-16 01:32:36,716 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2020-10-16 01:32:36,716 INFO L481 AbstractCegarLoop]: Abstraction has has 30 places, 17 transitions, 50 flow [2020-10-16 01:32:36,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:32:36,716 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:36,717 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:36,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:32:36,717 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:36,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:36,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1716902564, now seen corresponding path program 1 times [2020-10-16 01:32:36,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:36,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007116199] [2020-10-16 01:32:36,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:36,871 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:32:36,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007116199] [2020-10-16 01:32:36,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:36,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:32:36,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635159434] [2020-10-16 01:32:36,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:32:36,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:36,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:32:36,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:32:36,876 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 148 [2020-10-16 01:32:36,877 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 17 transitions, 50 flow. Second operand 6 states. [2020-10-16 01:32:36,877 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:36,878 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 148 [2020-10-16 01:32:36,878 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:37,105 INFO L129 PetriNetUnfolder]: 88/181 cut-off events. [2020-10-16 01:32:37,105 INFO L130 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2020-10-16 01:32:37,106 INFO L80 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 181 events. 88/181 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 747 event pairs, 28 based on Foata normal form. 12/193 useless extension candidates. Maximal degree in co-relation 399. Up to 118 conditions per place. [2020-10-16 01:32:37,107 INFO L132 encePairwiseOnDemand]: 142/148 looper letters, 17 selfloop transitions, 7 changer transitions 10/40 dead transitions. [2020-10-16 01:32:37,107 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 171 flow [2020-10-16 01:32:37,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:32:37,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:32:37,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 789 transitions. [2020-10-16 01:32:37,111 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6663851351351351 [2020-10-16 01:32:37,111 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 789 transitions. [2020-10-16 01:32:37,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 789 transitions. [2020-10-16 01:32:37,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:37,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 789 transitions. [2020-10-16 01:32:37,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:32:37,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:32:37,116 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:32:37,116 INFO L185 Difference]: Start difference. First operand has 30 places, 17 transitions, 50 flow. Second operand 8 states and 789 transitions. [2020-10-16 01:32:37,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 171 flow [2020-10-16 01:32:37,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 40 transitions, 161 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 01:32:37,118 INFO L241 Difference]: Finished difference. Result has 35 places, 22 transitions, 88 flow [2020-10-16 01:32:37,118 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=88, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2020-10-16 01:32:37,119 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2020-10-16 01:32:37,119 INFO L481 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 88 flow [2020-10-16 01:32:37,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:32:37,119 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:37,119 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:37,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:32:37,120 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:37,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:37,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1766602717, now seen corresponding path program 1 times [2020-10-16 01:32:37,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:37,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876643242] [2020-10-16 01:32:37,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:37,247 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:32:37,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876643242] [2020-10-16 01:32:37,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:37,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:32:37,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526424421] [2020-10-16 01:32:37,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:32:37,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:37,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:32:37,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:32:37,251 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 148 [2020-10-16 01:32:37,251 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 88 flow. Second operand 6 states. [2020-10-16 01:32:37,252 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:37,252 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 148 [2020-10-16 01:32:37,252 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:37,364 INFO L129 PetriNetUnfolder]: 33/97 cut-off events. [2020-10-16 01:32:37,364 INFO L130 PetriNetUnfolder]: For 109/109 co-relation queries the response was YES. [2020-10-16 01:32:37,365 INFO L80 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 97 events. 33/97 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 397 event pairs, 18 based on Foata normal form. 6/99 useless extension candidates. Maximal degree in co-relation 245. Up to 55 conditions per place. [2020-10-16 01:32:37,365 INFO L132 encePairwiseOnDemand]: 142/148 looper letters, 10 selfloop transitions, 5 changer transitions 6/34 dead transitions. [2020-10-16 01:32:37,366 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 34 transitions, 164 flow [2020-10-16 01:32:37,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:32:37,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:32:37,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 604 transitions. [2020-10-16 01:32:37,369 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6801801801801802 [2020-10-16 01:32:37,369 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 604 transitions. [2020-10-16 01:32:37,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 604 transitions. [2020-10-16 01:32:37,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:37,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 604 transitions. [2020-10-16 01:32:37,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:32:37,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:32:37,372 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:32:37,373 INFO L185 Difference]: Start difference. First operand has 35 places, 22 transitions, 88 flow. Second operand 6 states and 604 transitions. [2020-10-16 01:32:37,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 34 transitions, 164 flow [2020-10-16 01:32:37,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 34 transitions, 158 flow, removed 3 selfloop flow, removed 3 redundant places. [2020-10-16 01:32:37,376 INFO L241 Difference]: Finished difference. Result has 38 places, 26 transitions, 124 flow [2020-10-16 01:32:37,376 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=124, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2020-10-16 01:32:37,376 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 12 predicate places. [2020-10-16 01:32:37,376 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 124 flow [2020-10-16 01:32:37,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:32:37,376 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:37,377 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:37,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:32:37,377 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:37,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:37,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1539726513, now seen corresponding path program 1 times [2020-10-16 01:32:37,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:37,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111289415] [2020-10-16 01:32:37,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:37,488 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:32:37,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111289415] [2020-10-16 01:32:37,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:37,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:32:37,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311159071] [2020-10-16 01:32:37,492 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:32:37,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:37,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:32:37,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:32:37,494 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 148 [2020-10-16 01:32:37,495 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 124 flow. Second operand 7 states. [2020-10-16 01:32:37,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:37,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 148 [2020-10-16 01:32:37,496 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:37,689 INFO L129 PetriNetUnfolder]: 35/101 cut-off events. [2020-10-16 01:32:37,689 INFO L130 PetriNetUnfolder]: For 137/141 co-relation queries the response was YES. [2020-10-16 01:32:37,690 INFO L80 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 101 events. 35/101 cut-off events. For 137/141 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 401 event pairs, 3 based on Foata normal form. 4/105 useless extension candidates. Maximal degree in co-relation 299. Up to 54 conditions per place. [2020-10-16 01:32:37,691 INFO L132 encePairwiseOnDemand]: 141/148 looper letters, 11 selfloop transitions, 9 changer transitions 5/38 dead transitions. [2020-10-16 01:32:37,691 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 224 flow [2020-10-16 01:32:37,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:32:37,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:32:37,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 723 transitions. [2020-10-16 01:32:37,694 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6978764478764479 [2020-10-16 01:32:37,694 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 723 transitions. [2020-10-16 01:32:37,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 723 transitions. [2020-10-16 01:32:37,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:37,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 723 transitions. [2020-10-16 01:32:37,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:32:37,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:32:37,698 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:32:37,698 INFO L185 Difference]: Start difference. First operand has 38 places, 26 transitions, 124 flow. Second operand 7 states and 723 transitions. [2020-10-16 01:32:37,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 224 flow [2020-10-16 01:32:37,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 38 transitions, 222 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 01:32:37,702 INFO L241 Difference]: Finished difference. Result has 44 places, 30 transitions, 173 flow [2020-10-16 01:32:37,702 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=173, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2020-10-16 01:32:37,702 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 18 predicate places. [2020-10-16 01:32:37,702 INFO L481 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 173 flow [2020-10-16 01:32:37,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:32:37,702 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:37,703 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:37,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:32:37,703 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:37,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:37,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1193361585, now seen corresponding path program 2 times [2020-10-16 01:32:37,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:37,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289259103] [2020-10-16 01:32:37,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:37,834 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:32:37,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289259103] [2020-10-16 01:32:37,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:37,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:32:37,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080366845] [2020-10-16 01:32:37,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:32:37,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:37,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:32:37,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:32:37,838 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 148 [2020-10-16 01:32:37,838 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 173 flow. Second operand 6 states. [2020-10-16 01:32:37,839 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:37,839 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 148 [2020-10-16 01:32:37,839 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:37,978 INFO L129 PetriNetUnfolder]: 34/107 cut-off events. [2020-10-16 01:32:37,978 INFO L130 PetriNetUnfolder]: For 255/259 co-relation queries the response was YES. [2020-10-16 01:32:37,979 INFO L80 FinitePrefix]: Finished finitePrefix Result has 390 conditions, 107 events. 34/107 cut-off events. For 255/259 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 441 event pairs, 9 based on Foata normal form. 9/115 useless extension candidates. Maximal degree in co-relation 368. Up to 49 conditions per place. [2020-10-16 01:32:37,980 INFO L132 encePairwiseOnDemand]: 142/148 looper letters, 12 selfloop transitions, 9 changer transitions 5/39 dead transitions. [2020-10-16 01:32:37,980 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 289 flow [2020-10-16 01:32:37,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:32:37,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:32:37,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 632 transitions. [2020-10-16 01:32:37,983 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7117117117117117 [2020-10-16 01:32:37,983 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 632 transitions. [2020-10-16 01:32:37,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 632 transitions. [2020-10-16 01:32:37,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:37,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 632 transitions. [2020-10-16 01:32:37,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:32:37,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:32:37,987 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:32:37,987 INFO L185 Difference]: Start difference. First operand has 44 places, 30 transitions, 173 flow. Second operand 6 states and 632 transitions. [2020-10-16 01:32:37,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 289 flow [2020-10-16 01:32:37,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 267 flow, removed 11 selfloop flow, removed 2 redundant places. [2020-10-16 01:32:37,991 INFO L241 Difference]: Finished difference. Result has 48 places, 32 transitions, 213 flow [2020-10-16 01:32:37,992 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=213, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2020-10-16 01:32:37,992 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 22 predicate places. [2020-10-16 01:32:37,992 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 32 transitions, 213 flow [2020-10-16 01:32:37,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:32:37,992 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:37,992 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:37,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:32:37,993 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:37,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:37,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1192359262, now seen corresponding path program 1 times [2020-10-16 01:32:37,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:37,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602187121] [2020-10-16 01:32:37,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:38,065 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:32:38,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602187121] [2020-10-16 01:32:38,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:38,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:32:38,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767560786] [2020-10-16 01:32:38,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:32:38,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:38,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:32:38,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:32:38,071 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 148 [2020-10-16 01:32:38,072 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 32 transitions, 213 flow. Second operand 4 states. [2020-10-16 01:32:38,072 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:38,072 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 148 [2020-10-16 01:32:38,072 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:38,119 INFO L129 PetriNetUnfolder]: 21/88 cut-off events. [2020-10-16 01:32:38,119 INFO L130 PetriNetUnfolder]: For 222/227 co-relation queries the response was YES. [2020-10-16 01:32:38,120 INFO L80 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 88 events. 21/88 cut-off events. For 222/227 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 351 event pairs, 2 based on Foata normal form. 9/89 useless extension candidates. Maximal degree in co-relation 293. Up to 21 conditions per place. [2020-10-16 01:32:38,121 INFO L132 encePairwiseOnDemand]: 143/148 looper letters, 6 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2020-10-16 01:32:38,122 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 37 transitions, 251 flow [2020-10-16 01:32:38,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:32:38,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:32:38,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 476 transitions. [2020-10-16 01:32:38,124 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8040540540540541 [2020-10-16 01:32:38,125 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 476 transitions. [2020-10-16 01:32:38,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 476 transitions. [2020-10-16 01:32:38,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:38,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 476 transitions. [2020-10-16 01:32:38,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:32:38,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:32:38,128 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:32:38,128 INFO L185 Difference]: Start difference. First operand has 48 places, 32 transitions, 213 flow. Second operand 4 states and 476 transitions. [2020-10-16 01:32:38,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 37 transitions, 251 flow [2020-10-16 01:32:38,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 37 transitions, 226 flow, removed 5 selfloop flow, removed 4 redundant places. [2020-10-16 01:32:38,137 INFO L241 Difference]: Finished difference. Result has 47 places, 35 transitions, 228 flow [2020-10-16 01:32:38,137 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2020-10-16 01:32:38,138 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 21 predicate places. [2020-10-16 01:32:38,138 INFO L481 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 228 flow [2020-10-16 01:32:38,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:32:38,138 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:38,138 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:38,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:32:38,141 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:38,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:38,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1558973165, now seen corresponding path program 1 times [2020-10-16 01:32:38,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:38,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551927829] [2020-10-16 01:32:38,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:38,189 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:32:38,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551927829] [2020-10-16 01:32:38,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:38,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:32:38,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041526505] [2020-10-16 01:32:38,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:32:38,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:38,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:32:38,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:32:38,192 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 148 [2020-10-16 01:32:38,193 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 228 flow. Second operand 4 states. [2020-10-16 01:32:38,193 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:38,193 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 148 [2020-10-16 01:32:38,193 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:38,231 INFO L129 PetriNetUnfolder]: 18/86 cut-off events. [2020-10-16 01:32:38,231 INFO L130 PetriNetUnfolder]: For 169/172 co-relation queries the response was YES. [2020-10-16 01:32:38,232 INFO L80 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 86 events. 18/86 cut-off events. For 169/172 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 349 event pairs, 3 based on Foata normal form. 4/82 useless extension candidates. Maximal degree in co-relation 292. Up to 28 conditions per place. [2020-10-16 01:32:38,232 INFO L132 encePairwiseOnDemand]: 144/148 looper letters, 2 selfloop transitions, 4 changer transitions 2/37 dead transitions. [2020-10-16 01:32:38,233 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 37 transitions, 258 flow [2020-10-16 01:32:38,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:32:38,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:32:38,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 598 transitions. [2020-10-16 01:32:38,235 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8081081081081081 [2020-10-16 01:32:38,235 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 598 transitions. [2020-10-16 01:32:38,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 598 transitions. [2020-10-16 01:32:38,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:38,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 598 transitions. [2020-10-16 01:32:38,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:32:38,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:32:38,239 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:32:38,239 INFO L185 Difference]: Start difference. First operand has 47 places, 35 transitions, 228 flow. Second operand 5 states and 598 transitions. [2020-10-16 01:32:38,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 37 transitions, 258 flow [2020-10-16 01:32:38,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 37 transitions, 256 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:32:38,242 INFO L241 Difference]: Finished difference. Result has 53 places, 35 transitions, 244 flow [2020-10-16 01:32:38,242 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=53, PETRI_TRANSITIONS=35} [2020-10-16 01:32:38,243 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 27 predicate places. [2020-10-16 01:32:38,243 INFO L481 AbstractCegarLoop]: Abstraction has has 53 places, 35 transitions, 244 flow [2020-10-16 01:32:38,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:32:38,243 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:38,243 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:38,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:32:38,244 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:38,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:38,244 INFO L82 PathProgramCache]: Analyzing trace with hash -850783059, now seen corresponding path program 1 times [2020-10-16 01:32:38,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:38,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974249127] [2020-10-16 01:32:38,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:38,319 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:32:38,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974249127] [2020-10-16 01:32:38,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:38,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:32:38,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861172246] [2020-10-16 01:32:38,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:32:38,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:38,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:32:38,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:32:38,322 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 148 [2020-10-16 01:32:38,322 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 35 transitions, 244 flow. Second operand 5 states. [2020-10-16 01:32:38,323 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:38,323 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 148 [2020-10-16 01:32:38,323 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:38,368 INFO L129 PetriNetUnfolder]: 12/61 cut-off events. [2020-10-16 01:32:38,368 INFO L130 PetriNetUnfolder]: For 133/156 co-relation queries the response was YES. [2020-10-16 01:32:38,368 INFO L80 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 61 events. 12/61 cut-off events. For 133/156 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 203 event pairs, 0 based on Foata normal form. 10/64 useless extension candidates. Maximal degree in co-relation 227. Up to 20 conditions per place. [2020-10-16 01:32:38,369 INFO L132 encePairwiseOnDemand]: 143/148 looper letters, 3 selfloop transitions, 8 changer transitions 0/36 dead transitions. [2020-10-16 01:32:38,369 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 36 transitions, 270 flow [2020-10-16 01:32:38,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:32:38,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:32:38,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2020-10-16 01:32:38,371 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7986486486486486 [2020-10-16 01:32:38,371 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 591 transitions. [2020-10-16 01:32:38,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 591 transitions. [2020-10-16 01:32:38,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:38,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 591 transitions. [2020-10-16 01:32:38,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:32:38,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:32:38,375 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:32:38,375 INFO L185 Difference]: Start difference. First operand has 53 places, 35 transitions, 244 flow. Second operand 5 states and 591 transitions. [2020-10-16 01:32:38,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 36 transitions, 270 flow [2020-10-16 01:32:38,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 36 transitions, 223 flow, removed 13 selfloop flow, removed 9 redundant places. [2020-10-16 01:32:38,378 INFO L241 Difference]: Finished difference. Result has 48 places, 36 transitions, 232 flow [2020-10-16 01:32:38,378 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=232, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2020-10-16 01:32:38,378 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 22 predicate places. [2020-10-16 01:32:38,379 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 232 flow [2020-10-16 01:32:38,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:32:38,379 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:38,379 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:38,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:32:38,379 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:38,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:38,380 INFO L82 PathProgramCache]: Analyzing trace with hash 583540080, now seen corresponding path program 1 times [2020-10-16 01:32:38,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:38,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866242646] [2020-10-16 01:32:38,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:38,459 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:32:38,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866242646] [2020-10-16 01:32:38,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:38,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:32:38,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730841064] [2020-10-16 01:32:38,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:32:38,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:38,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:32:38,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:32:38,462 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 148 [2020-10-16 01:32:38,462 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 232 flow. Second operand 6 states. [2020-10-16 01:32:38,463 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:38,463 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 148 [2020-10-16 01:32:38,463 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:38,523 INFO L129 PetriNetUnfolder]: 18/94 cut-off events. [2020-10-16 01:32:38,524 INFO L130 PetriNetUnfolder]: For 261/264 co-relation queries the response was YES. [2020-10-16 01:32:38,524 INFO L80 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 94 events. 18/94 cut-off events. For 261/264 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 423 event pairs, 0 based on Foata normal form. 2/85 useless extension candidates. Maximal degree in co-relation 327. Up to 35 conditions per place. [2020-10-16 01:32:38,525 INFO L132 encePairwiseOnDemand]: 143/148 looper letters, 5 selfloop transitions, 2 changer transitions 15/40 dead transitions. [2020-10-16 01:32:38,525 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 40 transitions, 284 flow [2020-10-16 01:32:38,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:32:38,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:32:38,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 648 transitions. [2020-10-16 01:32:38,528 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7297297297297297 [2020-10-16 01:32:38,528 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 648 transitions. [2020-10-16 01:32:38,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 648 transitions. [2020-10-16 01:32:38,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:38,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 648 transitions. [2020-10-16 01:32:38,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:32:38,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:32:38,533 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:32:38,533 INFO L185 Difference]: Start difference. First operand has 48 places, 36 transitions, 232 flow. Second operand 6 states and 648 transitions. [2020-10-16 01:32:38,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 40 transitions, 284 flow [2020-10-16 01:32:38,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 40 transitions, 273 flow, removed 2 selfloop flow, removed 2 redundant places. [2020-10-16 01:32:38,537 INFO L241 Difference]: Finished difference. Result has 54 places, 25 transitions, 154 flow [2020-10-16 01:32:38,537 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=54, PETRI_TRANSITIONS=25} [2020-10-16 01:32:38,537 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 28 predicate places. [2020-10-16 01:32:38,537 INFO L481 AbstractCegarLoop]: Abstraction has has 54 places, 25 transitions, 154 flow [2020-10-16 01:32:38,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:32:38,538 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:38,538 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:38,538 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:32:38,538 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:38,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:38,539 INFO L82 PathProgramCache]: Analyzing trace with hash 166507602, now seen corresponding path program 2 times [2020-10-16 01:32:38,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:38,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010430787] [2020-10-16 01:32:38,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:32:38,576 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:32:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:32:38,606 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:32:38,641 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:32:38,641 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:32:38,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:32:38,661 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:32:38,661 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,666 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:32:38,666 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,666 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:32:38,667 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,667 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:32:38,667 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,667 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:32:38,667 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,668 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:32:38,669 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,669 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:32:38,669 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,670 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:32:38,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,670 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:32:38,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,670 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:32:38,671 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,671 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:32:38,671 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,673 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:32:38,673 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,673 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:32:38,673 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,673 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:32:38,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,674 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:32:38,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,674 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:32:38,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,675 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:32:38,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,677 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:32:38,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,677 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:32:38,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,682 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:32:38,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,682 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:32:38,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,683 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:32:38,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,683 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:32:38,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,683 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:32:38,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,684 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:32:38,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,684 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:32:38,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,685 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:32:38,685 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,685 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:32:38,685 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,686 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:32:38,686 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:32:38,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:32:38 BasicIcfg [2020-10-16 01:32:38,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:32:38,748 INFO L168 Benchmark]: Toolchain (without parser) took 11135.92 ms. Allocated memory was 244.8 MB in the beginning and 533.2 MB in the end (delta: 288.4 MB). Free memory was 200.0 MB in the beginning and 190.1 MB in the end (delta: 9.9 MB). Peak memory consumption was 298.2 MB. Max. memory is 14.2 GB. [2020-10-16 01:32:38,749 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 244.8 MB. Free memory is still 221.2 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:32:38,750 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.98 ms. Allocated memory was 244.8 MB in the beginning and 295.7 MB in the end (delta: 50.9 MB). Free memory was 200.0 MB in the beginning and 246.3 MB in the end (delta: -46.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 14.2 GB. [2020-10-16 01:32:38,751 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.40 ms. Allocated memory is still 295.7 MB. Free memory was 246.3 MB in the beginning and 243.8 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:32:38,751 INFO L168 Benchmark]: Boogie Preprocessor took 34.95 ms. Allocated memory is still 295.7 MB. Free memory was 243.8 MB in the beginning and 241.3 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:32:38,752 INFO L168 Benchmark]: RCFGBuilder took 1854.82 ms. Allocated memory was 295.7 MB in the beginning and 350.2 MB in the end (delta: 54.5 MB). Free memory was 241.3 MB in the beginning and 206.2 MB in the end (delta: 35.1 MB). Peak memory consumption was 99.8 MB. Max. memory is 14.2 GB. [2020-10-16 01:32:38,753 INFO L168 Benchmark]: TraceAbstraction took 8381.42 ms. Allocated memory was 350.2 MB in the beginning and 533.2 MB in the end (delta: 183.0 MB). Free memory was 206.2 MB in the beginning and 190.1 MB in the end (delta: 16.0 MB). Peak memory consumption was 199.0 MB. Max. memory is 14.2 GB. [2020-10-16 01:32:38,757 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.21 ms. Allocated memory is still 244.8 MB. Free memory is still 221.2 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 774.98 ms. Allocated memory was 244.8 MB in the beginning and 295.7 MB in the end (delta: 50.9 MB). Free memory was 200.0 MB in the beginning and 246.3 MB in the end (delta: -46.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 80.40 ms. Allocated memory is still 295.7 MB. Free memory was 246.3 MB in the beginning and 243.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 34.95 ms. Allocated memory is still 295.7 MB. Free memory was 243.8 MB in the beginning and 241.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1854.82 ms. Allocated memory was 295.7 MB in the beginning and 350.2 MB in the end (delta: 54.5 MB). Free memory was 241.3 MB in the beginning and 206.2 MB in the end (delta: 35.1 MB). Peak memory consumption was 99.8 MB. Max. memory is 14.2 GB. * TraceAbstraction took 8381.42 ms. Allocated memory was 350.2 MB in the beginning and 533.2 MB in the end (delta: 183.0 MB). Free memory was 206.2 MB in the beginning and 190.1 MB in the end (delta: 16.0 MB). Peak memory consumption was 199.0 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 625 VarBasedMoverChecksPositive, 42 VarBasedMoverChecksNegative, 12 SemBasedMoverChecksPositive, 30 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 51 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.3s, 82 PlacesBefore, 26 PlacesAfterwards, 77 TransitionsBefore, 20 TransitionsAfterwards, 1012 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 69 TotalNumberOfCompositions, 2464 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L699] 0 int __unbuffered_p1_EAX = 0; [L701] 0 int __unbuffered_p1_EBX = 0; [L702] 0 _Bool main$tmp_guard0; [L703] 0 _Bool main$tmp_guard1; [L705] 0 int x = 0; [L707] 0 int y = 0; [L708] 0 _Bool y$flush_delayed; [L709] 0 int y$mem_tmp; [L710] 0 _Bool y$r_buff0_thd0; [L711] 0 _Bool y$r_buff0_thd1; [L712] 0 _Bool y$r_buff0_thd2; [L713] 0 _Bool y$r_buff1_thd0; [L714] 0 _Bool y$r_buff1_thd1; [L715] 0 _Bool y$r_buff1_thd2; [L716] 0 _Bool y$read_delayed; [L717] 0 int *y$read_delayed_var; [L718] 0 int y$w_buff0; [L719] 0 _Bool y$w_buff0_used; [L720] 0 int y$w_buff1; [L721] 0 _Bool y$w_buff1_used; [L723] 0 int z = 0; [L724] 0 _Bool weak$$choice0; [L725] 0 _Bool weak$$choice2; [L791] 0 pthread_t t1613; [L792] FCALL, FORK 0 pthread_create(&t1613, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] 0 pthread_t t1614; [L794] FCALL, FORK 0 pthread_create(&t1614, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L749] 2 y$w_buff1 = y$w_buff0 [L750] 2 y$w_buff0 = 2 [L751] 2 y$w_buff1_used = y$w_buff0_used [L752] 2 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L754] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L755] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L756] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L757] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L760] 2 z = 1 [L763] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L735] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L736] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L737] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L738] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L739] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 2 return 0; [L742] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L744] 1 return 0; [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L804] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L807] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 0 y$flush_delayed = weak$$choice2 [L810] 0 y$mem_tmp = y [L811] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L812] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L813] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L813] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L813] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L814] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L814] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L815] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L815] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L817] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L819] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L819] 0 y = y$flush_delayed ? y$mem_tmp : y [L820] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 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: 8.1s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 48 SDtfs, 47 SDslu, 48 SDs, 0 SdLazy, 247 SolverSat, 74 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=8, 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.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 6797 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...