/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-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:44:57,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:44:57,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:44:57,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:44:57,371 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:44:57,380 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:44:57,382 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:44:57,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:44:57,387 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:44:57,388 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:44:57,390 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:44:57,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:44:57,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:44:57,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:44:57,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:44:57,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:44:57,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:44:57,400 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:44:57,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:44:57,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:44:57,412 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:44:57,414 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:44:57,415 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:44:57,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:44:57,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:44:57,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:44:57,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:44:57,431 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:44:57,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:44:57,433 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:44:57,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:44:57,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:44:57,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:44:57,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:44:57,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:44:57,439 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:44:57,440 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:44:57,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:44:57,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:44:57,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:44:57,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:44:57,446 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-SemanticLooper.epf [2020-10-16 04:44:57,484 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:44:57,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:44:57,485 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:44:57,486 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:44:57,486 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:44:57,486 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:44:57,486 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:44:57,486 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:44:57,486 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:44:57,487 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:44:57,487 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:44:57,487 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:44:57,487 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:44:57,487 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:44:57,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:44:57,488 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:44:57,488 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:44:57,488 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:44:57,488 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:44:57,489 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:44:57,489 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:44:57,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:44:57,489 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:44:57,489 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:44:57,490 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:44:57,490 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:44:57,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:44:57,490 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:44:57,490 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:44:57,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:44:57,780 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:44:57,783 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:44:57,785 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:44:57,785 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:44:57,786 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc.i [2020-10-16 04:44:57,863 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f6799c09/d1aa57fc39704511bb6b7d220f36dab9/FLAG333e785b5 [2020-10-16 04:44:58,416 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:44:58,417 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.oepc.i [2020-10-16 04:44:58,433 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f6799c09/d1aa57fc39704511bb6b7d220f36dab9/FLAG333e785b5 [2020-10-16 04:44:58,706 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f6799c09/d1aa57fc39704511bb6b7d220f36dab9 [2020-10-16 04:44:58,715 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:44:58,717 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:44:58,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:44:58,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:44:58,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:44:58,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:44:58" (1/1) ... [2020-10-16 04:44:58,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c697518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:44:58, skipping insertion in model container [2020-10-16 04:44:58,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:44:58" (1/1) ... [2020-10-16 04:44:58,735 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:44:58,780 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:44:59,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:44:59,341 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:44:59,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:44:59,498 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:44:59,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:44:59 WrapperNode [2020-10-16 04:44:59,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:44:59,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:44:59,503 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:44:59,503 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:44:59,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:44:59" (1/1) ... [2020-10-16 04:44:59,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:44:59" (1/1) ... [2020-10-16 04:44:59,563 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:44:59,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:44:59,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:44:59,564 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:44:59,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:44:59" (1/1) ... [2020-10-16 04:44:59,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:44:59" (1/1) ... [2020-10-16 04:44:59,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:44:59" (1/1) ... [2020-10-16 04:44:59,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:44:59" (1/1) ... [2020-10-16 04:44:59,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:44:59" (1/1) ... [2020-10-16 04:44:59,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:44:59" (1/1) ... [2020-10-16 04:44:59,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:44:59" (1/1) ... [2020-10-16 04:44:59,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:44:59,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:44:59,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:44:59,607 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:44:59,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:44:59" (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 04:44:59,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:44:59,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:44:59,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:44:59,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:44:59,686 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:44:59,686 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:44:59,686 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:44:59,686 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:44:59,687 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 04:44:59,687 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 04:44:59,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:44:59,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:44:59,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:44:59,690 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 04:45:01,725 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:45:01,726 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:45:01,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:45:01 BoogieIcfgContainer [2020-10-16 04:45:01,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:45:01,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:45:01,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:45:01,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:45:01,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:44:58" (1/3) ... [2020-10-16 04:45:01,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603aa7bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:45:01, skipping insertion in model container [2020-10-16 04:45:01,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:44:59" (2/3) ... [2020-10-16 04:45:01,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603aa7bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:45:01, skipping insertion in model container [2020-10-16 04:45:01,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:45:01" (3/3) ... [2020-10-16 04:45:01,742 INFO L111 eAbstractionObserver]: Analyzing ICFG mix024_power.oepc.i [2020-10-16 04:45:01,754 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:45:01,762 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:45:01,763 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:45:01,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,810 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,810 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,811 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,811 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,815 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,816 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,819 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,819 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,819 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,819 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,822 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,823 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,823 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,824 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,824 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,824 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,844 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,844 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,852 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,855 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,865 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,865 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,865 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,865 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,866 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,866 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,866 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,866 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,866 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,867 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,868 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,868 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:45:01,886 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 04:45:01,912 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:45:01,912 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:45:01,912 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:45:01,912 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:45:01,912 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:45:01,913 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:45:01,913 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:45:01,913 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:45:01,937 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 213 flow [2020-10-16 04:45:02,017 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2020-10-16 04:45:02,017 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:45:02,025 INFO L80 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2020-10-16 04:45:02,025 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 99 transitions, 213 flow [2020-10-16 04:45:02,041 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 96 transitions, 201 flow [2020-10-16 04:45:02,044 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:45:02,050 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 96 transitions, 201 flow [2020-10-16 04:45:02,054 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 96 transitions, 201 flow [2020-10-16 04:45:02,055 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 201 flow [2020-10-16 04:45:02,158 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2020-10-16 04:45:02,158 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:45:02,162 INFO L80 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2020-10-16 04:45:02,168 INFO L117 LiptonReduction]: Number of co-enabled transitions 1928 [2020-10-16 04:45:02,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:02,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:02,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:02,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:02,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:02,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:02,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:02,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:02,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:02,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:02,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:02,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:02,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:02,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:02,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:02,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:02,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:45:02,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:03,114 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 04:45:03,230 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 04:45:03,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:03,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:03,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:03,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:03,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:03,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:03,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:03,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:03,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:03,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:03,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:03,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:03,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:03,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:03,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:03,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:03,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:03,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:03,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:03,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:03,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:03,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:03,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:03,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:03,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:03,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:03,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:03,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:03,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:03,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:03,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:03,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:03,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:03,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:03,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:03,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:03,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:03,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:03,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:03,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:03,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:03,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:03,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:03,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:03,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:03,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:03,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:03,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:03,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:45:03,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:45:03,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:45:03,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:45:04,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:04,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:04,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:45:04,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:45:04,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:45:04,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:45:04,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:45:04,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:45:04,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:45:04,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:45:04,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:45:04,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:45:04,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:45:04,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:45:04,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:04,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:04,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:04,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:04,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:04,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:04,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:04,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:04,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:04,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:04,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:04,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:04,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:04,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:04,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:04,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:04,432 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 04:45:04,538 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 04:45:04,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:04,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:04,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:04,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:04,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:04,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:04,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:04,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:04,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:04,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:04,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:04,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:04,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:04,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:04,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:04,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:04,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:04,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:04,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:45:04,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:45:04,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:45:04,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:45:04,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:45:04,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:45:04,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:45:04,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:45:04,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:45:04,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:45:04,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:45:04,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:45:04,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:45:04,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:45:04,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:45:04,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:45:04,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:04,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:04,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:04,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:04,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:04,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:04,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:04,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:04,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:04,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:04,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:04,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:04,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:04,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:04,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:04,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:04,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:04,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:05,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:05,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:05,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:05,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:05,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:05,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:05,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:05,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:05,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:05,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:05,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:05,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:05,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:05,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:05,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:05,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:05,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:05,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:05,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:05,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:45:05,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:05,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:45:05,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:05,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:05,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:05,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:05,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:05,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:05,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:05,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:05,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:45:05,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:05,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:05,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:05,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:05,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:05,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:05,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:05,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:05,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:45:05,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:05,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:05,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:05,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:45:05,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:45:05,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:45:05,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:45:05,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:45:06,421 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-16 04:45:06,544 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-16 04:45:06,571 INFO L132 LiptonReduction]: Checked pairs total: 6007 [2020-10-16 04:45:06,572 INFO L134 LiptonReduction]: Total number of compositions: 83 [2020-10-16 04:45:06,584 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4543 [2020-10-16 04:45:06,589 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2020-10-16 04:45:06,589 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:45:06,590 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:45:06,590 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2020-10-16 04:45:06,591 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:45:06,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:45:06,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1063883, now seen corresponding path program 1 times [2020-10-16 04:45:06,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:45:06,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721126065] [2020-10-16 04:45:06,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:45:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:45:06,821 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 04:45:06,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721126065] [2020-10-16 04:45:06,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:45:06,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:45:06,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078299368] [2020-10-16 04:45:06,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:45:06,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:45:06,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:45:06,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:45:06,855 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 182 [2020-10-16 04:45:06,858 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states. [2020-10-16 04:45:06,858 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:45:06,858 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 182 [2020-10-16 04:45:06,860 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:45:06,954 INFO L129 PetriNetUnfolder]: 49/144 cut-off events. [2020-10-16 04:45:06,954 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:45:06,955 INFO L80 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 144 events. 49/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 669 event pairs, 9 based on Foata normal form. 17/152 useless extension candidates. Maximal degree in co-relation 230. Up to 65 conditions per place. [2020-10-16 04:45:06,959 INFO L132 encePairwiseOnDemand]: 178/182 looper letters, 9 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2020-10-16 04:45:06,959 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 28 transitions, 87 flow [2020-10-16 04:45:06,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:45:06,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:45:06,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2020-10-16 04:45:06,984 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8553113553113553 [2020-10-16 04:45:06,985 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2020-10-16 04:45:06,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2020-10-16 04:45:06,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:45:06,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2020-10-16 04:45:06,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:45:07,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:45:07,006 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:45:07,009 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 467 transitions. [2020-10-16 04:45:07,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 28 transitions, 87 flow [2020-10-16 04:45:07,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 84 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 04:45:07,015 INFO L241 Difference]: Finished difference. Result has 33 places, 24 transitions, 58 flow [2020-10-16 04:45:07,018 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2020-10-16 04:45:07,019 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2020-10-16 04:45:07,019 INFO L481 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2020-10-16 04:45:07,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:45:07,019 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:45:07,019 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:45:07,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:45:07,020 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:45:07,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:45:07,020 INFO L82 PathProgramCache]: Analyzing trace with hash 186072963, now seen corresponding path program 1 times [2020-10-16 04:45:07,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:45:07,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053284516] [2020-10-16 04:45:07,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:45:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:45:07,098 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 04:45:07,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053284516] [2020-10-16 04:45:07,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:45:07,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:45:07,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845972423] [2020-10-16 04:45:07,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:45:07,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:45:07,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:45:07,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:45:07,103 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 182 [2020-10-16 04:45:07,103 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand 3 states. [2020-10-16 04:45:07,103 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:45:07,103 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 182 [2020-10-16 04:45:07,103 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:45:07,117 INFO L129 PetriNetUnfolder]: 1/26 cut-off events. [2020-10-16 04:45:07,117 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:45:07,118 INFO L80 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 26 events. 1/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 34. Up to 5 conditions per place. [2020-10-16 04:45:07,118 INFO L132 encePairwiseOnDemand]: 179/182 looper letters, 1 selfloop transitions, 2 changer transitions 2/25 dead transitions. [2020-10-16 04:45:07,118 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 25 transitions, 70 flow [2020-10-16 04:45:07,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:45:07,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:45:07,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2020-10-16 04:45:07,120 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8736263736263736 [2020-10-16 04:45:07,120 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 477 transitions. [2020-10-16 04:45:07,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 477 transitions. [2020-10-16 04:45:07,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:45:07,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 477 transitions. [2020-10-16 04:45:07,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:45:07,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:45:07,124 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:45:07,124 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 3 states and 477 transitions. [2020-10-16 04:45:07,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 25 transitions, 70 flow [2020-10-16 04:45:07,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:45:07,126 INFO L241 Difference]: Finished difference. Result has 34 places, 23 transitions, 60 flow [2020-10-16 04:45:07,126 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2020-10-16 04:45:07,127 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2020-10-16 04:45:07,127 INFO L481 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 60 flow [2020-10-16 04:45:07,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:45:07,127 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:45:07,127 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:45:07,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:45:07,128 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:45:07,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:45:07,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1628191181, now seen corresponding path program 1 times [2020-10-16 04:45:07,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:45:07,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950571943] [2020-10-16 04:45:07,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:45:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:45:07,199 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 04:45:07,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950571943] [2020-10-16 04:45:07,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:45:07,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:45:07,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858279650] [2020-10-16 04:45:07,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:45:07,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:45:07,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:45:07,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:45:07,202 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 182 [2020-10-16 04:45:07,202 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 60 flow. Second operand 3 states. [2020-10-16 04:45:07,203 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:45:07,203 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 182 [2020-10-16 04:45:07,203 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:45:07,217 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2020-10-16 04:45:07,217 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-16 04:45:07,217 INFO L80 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 23 events. 0/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2020-10-16 04:45:07,218 INFO L132 encePairwiseOnDemand]: 179/182 looper letters, 1 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2020-10-16 04:45:07,218 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 23 transitions, 66 flow [2020-10-16 04:45:07,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:45:07,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:45:07,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions. [2020-10-16 04:45:07,222 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8754578754578755 [2020-10-16 04:45:07,222 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 478 transitions. [2020-10-16 04:45:07,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 478 transitions. [2020-10-16 04:45:07,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:45:07,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 478 transitions. [2020-10-16 04:45:07,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:45:07,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:45:07,225 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:45:07,226 INFO L185 Difference]: Start difference. First operand has 34 places, 23 transitions, 60 flow. Second operand 3 states and 478 transitions. [2020-10-16 04:45:07,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 23 transitions, 66 flow [2020-10-16 04:45:07,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 23 transitions, 62 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:45:07,227 INFO L241 Difference]: Finished difference. Result has 34 places, 23 transitions, 64 flow [2020-10-16 04:45:07,227 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2020-10-16 04:45:07,227 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2020-10-16 04:45:07,228 INFO L481 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 64 flow [2020-10-16 04:45:07,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:45:07,228 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:45:07,228 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:45:07,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:45:07,228 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:45:07,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:45:07,229 INFO L82 PathProgramCache]: Analyzing trace with hash 658647039, now seen corresponding path program 1 times [2020-10-16 04:45:07,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:45:07,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593718681] [2020-10-16 04:45:07,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:45:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:45:07,311 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 04:45:07,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593718681] [2020-10-16 04:45:07,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:45:07,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:45:07,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181029504] [2020-10-16 04:45:07,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:45:07,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:45:07,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:45:07,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:45:07,315 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 182 [2020-10-16 04:45:07,315 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 64 flow. Second operand 4 states. [2020-10-16 04:45:07,315 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:45:07,315 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 182 [2020-10-16 04:45:07,316 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:45:07,370 INFO L129 PetriNetUnfolder]: 28/81 cut-off events. [2020-10-16 04:45:07,370 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-16 04:45:07,371 INFO L80 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 81 events. 28/81 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 287 event pairs, 12 based on Foata normal form. 8/88 useless extension candidates. Maximal degree in co-relation 157. Up to 45 conditions per place. [2020-10-16 04:45:07,371 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 5 selfloop transitions, 4 changer transitions 7/33 dead transitions. [2020-10-16 04:45:07,372 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 33 transitions, 116 flow [2020-10-16 04:45:07,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:45:07,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:45:07,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 753 transitions. [2020-10-16 04:45:07,375 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8274725274725274 [2020-10-16 04:45:07,375 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 753 transitions. [2020-10-16 04:45:07,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 753 transitions. [2020-10-16 04:45:07,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:45:07,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 753 transitions. [2020-10-16 04:45:07,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:45:07,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:45:07,379 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:45:07,379 INFO L185 Difference]: Start difference. First operand has 34 places, 23 transitions, 64 flow. Second operand 5 states and 753 transitions. [2020-10-16 04:45:07,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 33 transitions, 116 flow [2020-10-16 04:45:07,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 33 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:45:07,381 INFO L241 Difference]: Finished difference. Result has 39 places, 26 transitions, 96 flow [2020-10-16 04:45:07,381 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2020-10-16 04:45:07,381 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2020-10-16 04:45:07,381 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 96 flow [2020-10-16 04:45:07,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:45:07,382 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:45:07,382 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:45:07,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:45:07,382 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:45:07,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:45:07,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1273396643, now seen corresponding path program 1 times [2020-10-16 04:45:07,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:45:07,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120522177] [2020-10-16 04:45:07,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:45:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:45:07,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 04:45:07,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120522177] [2020-10-16 04:45:07,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:45:07,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:45:07,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174984882] [2020-10-16 04:45:07,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:45:07,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:45:07,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:45:07,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:45:07,492 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 182 [2020-10-16 04:45:07,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 96 flow. Second operand 5 states. [2020-10-16 04:45:07,493 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:45:07,493 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 182 [2020-10-16 04:45:07,493 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:45:07,556 INFO L129 PetriNetUnfolder]: 16/59 cut-off events. [2020-10-16 04:45:07,556 INFO L130 PetriNetUnfolder]: For 42/50 co-relation queries the response was YES. [2020-10-16 04:45:07,557 INFO L80 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 59 events. 16/59 cut-off events. For 42/50 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 157 event pairs, 2 based on Foata normal form. 11/69 useless extension candidates. Maximal degree in co-relation 178. Up to 35 conditions per place. [2020-10-16 04:45:07,557 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 5 selfloop transitions, 7 changer transitions 7/36 dead transitions. [2020-10-16 04:45:07,558 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 36 transitions, 192 flow [2020-10-16 04:45:07,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:45:07,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:45:07,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 903 transitions. [2020-10-16 04:45:07,561 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8269230769230769 [2020-10-16 04:45:07,561 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 903 transitions. [2020-10-16 04:45:07,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 903 transitions. [2020-10-16 04:45:07,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:45:07,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 903 transitions. [2020-10-16 04:45:07,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:45:07,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:45:07,566 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:45:07,566 INFO L185 Difference]: Start difference. First operand has 39 places, 26 transitions, 96 flow. Second operand 6 states and 903 transitions. [2020-10-16 04:45:07,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 36 transitions, 192 flow [2020-10-16 04:45:07,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 186 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 04:45:07,569 INFO L241 Difference]: Finished difference. Result has 43 places, 29 transitions, 146 flow [2020-10-16 04:45:07,569 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2020-10-16 04:45:07,570 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2020-10-16 04:45:07,570 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 146 flow [2020-10-16 04:45:07,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:45:07,570 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:45:07,570 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:45:07,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:45:07,570 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:45:07,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:45:07,571 INFO L82 PathProgramCache]: Analyzing trace with hash 420261703, now seen corresponding path program 1 times [2020-10-16 04:45:07,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:45:07,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508168938] [2020-10-16 04:45:07,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:45:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:45:07,770 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 04:45:07,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508168938] [2020-10-16 04:45:07,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:45:07,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:45:07,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458495782] [2020-10-16 04:45:07,772 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:45:07,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:45:07,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:45:07,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:45:07,774 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 182 [2020-10-16 04:45:07,775 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 146 flow. Second operand 6 states. [2020-10-16 04:45:07,775 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:45:07,775 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 182 [2020-10-16 04:45:07,776 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:45:07,850 INFO L129 PetriNetUnfolder]: 7/38 cut-off events. [2020-10-16 04:45:07,851 INFO L130 PetriNetUnfolder]: For 67/83 co-relation queries the response was YES. [2020-10-16 04:45:07,851 INFO L80 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 38 events. 7/38 cut-off events. For 67/83 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 12/49 useless extension candidates. Maximal degree in co-relation 129. Up to 20 conditions per place. [2020-10-16 04:45:07,852 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 2 selfloop transitions, 10 changer transitions 4/33 dead transitions. [2020-10-16 04:45:07,852 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 214 flow [2020-10-16 04:45:07,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:45:07,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:45:07,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1047 transitions. [2020-10-16 04:45:07,856 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8218210361067504 [2020-10-16 04:45:07,856 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1047 transitions. [2020-10-16 04:45:07,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1047 transitions. [2020-10-16 04:45:07,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:45:07,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1047 transitions. [2020-10-16 04:45:07,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:45:07,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:45:07,862 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:45:07,862 INFO L185 Difference]: Start difference. First operand has 43 places, 29 transitions, 146 flow. Second operand 7 states and 1047 transitions. [2020-10-16 04:45:07,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 214 flow [2020-10-16 04:45:07,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 33 transitions, 170 flow, removed 16 selfloop flow, removed 6 redundant places. [2020-10-16 04:45:07,865 INFO L241 Difference]: Finished difference. Result has 44 places, 29 transitions, 140 flow [2020-10-16 04:45:07,865 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2020-10-16 04:45:07,865 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 9 predicate places. [2020-10-16 04:45:07,866 INFO L481 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 140 flow [2020-10-16 04:45:07,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:45:07,866 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:45:07,866 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:45:07,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:45:07,867 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:45:07,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:45:07,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1211045565, now seen corresponding path program 1 times [2020-10-16 04:45:07,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:45:07,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510914545] [2020-10-16 04:45:07,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:45:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:45:07,936 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 04:45:07,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510914545] [2020-10-16 04:45:07,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:45:07,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:45:07,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858138138] [2020-10-16 04:45:07,937 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:45:07,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:45:07,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:45:07,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:45:07,940 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 182 [2020-10-16 04:45:07,941 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 140 flow. Second operand 3 states. [2020-10-16 04:45:07,941 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:45:07,941 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 182 [2020-10-16 04:45:07,941 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:45:07,969 INFO L129 PetriNetUnfolder]: 12/57 cut-off events. [2020-10-16 04:45:07,969 INFO L130 PetriNetUnfolder]: For 70/72 co-relation queries the response was YES. [2020-10-16 04:45:07,971 INFO L80 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 57 events. 12/57 cut-off events. For 70/72 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 149 event pairs, 0 based on Foata normal form. 1/57 useless extension candidates. Maximal degree in co-relation 156. Up to 23 conditions per place. [2020-10-16 04:45:07,972 INFO L132 encePairwiseOnDemand]: 179/182 looper letters, 3 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2020-10-16 04:45:07,972 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 31 transitions, 158 flow [2020-10-16 04:45:07,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:45:07,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:45:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2020-10-16 04:45:07,975 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8608058608058609 [2020-10-16 04:45:07,975 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 470 transitions. [2020-10-16 04:45:07,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 470 transitions. [2020-10-16 04:45:07,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:45:07,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 470 transitions. [2020-10-16 04:45:07,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:45:07,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:45:07,979 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:45:07,979 INFO L185 Difference]: Start difference. First operand has 44 places, 29 transitions, 140 flow. Second operand 3 states and 470 transitions. [2020-10-16 04:45:07,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 31 transitions, 158 flow [2020-10-16 04:45:07,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 120 flow, removed 12 selfloop flow, removed 6 redundant places. [2020-10-16 04:45:07,987 INFO L241 Difference]: Finished difference. Result has 39 places, 29 transitions, 110 flow [2020-10-16 04:45:07,987 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2020-10-16 04:45:07,987 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2020-10-16 04:45:07,987 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 110 flow [2020-10-16 04:45:07,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:45:07,988 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:45:07,988 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:45:07,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:45:07,991 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:45:07,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:45:07,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1078099749, now seen corresponding path program 2 times [2020-10-16 04:45:07,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:45:07,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323593584] [2020-10-16 04:45:07,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:45:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:45:08,086 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 04:45:08,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323593584] [2020-10-16 04:45:08,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:45:08,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:45:08,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929205460] [2020-10-16 04:45:08,088 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:45:08,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:45:08,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:45:08,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:45:08,091 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 182 [2020-10-16 04:45:08,092 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 110 flow. Second operand 4 states. [2020-10-16 04:45:08,092 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:45:08,092 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 182 [2020-10-16 04:45:08,094 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:45:08,125 INFO L129 PetriNetUnfolder]: 10/55 cut-off events. [2020-10-16 04:45:08,125 INFO L130 PetriNetUnfolder]: For 28/29 co-relation queries the response was YES. [2020-10-16 04:45:08,125 INFO L80 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 55 events. 10/55 cut-off events. For 28/29 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 139 event pairs, 0 based on Foata normal form. 1/54 useless extension candidates. Maximal degree in co-relation 117. Up to 15 conditions per place. [2020-10-16 04:45:08,126 INFO L132 encePairwiseOnDemand]: 179/182 looper letters, 3 selfloop transitions, 1 changer transitions 1/30 dead transitions. [2020-10-16 04:45:08,127 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 30 transitions, 122 flow [2020-10-16 04:45:08,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:45:08,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:45:08,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 602 transitions. [2020-10-16 04:45:08,130 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8269230769230769 [2020-10-16 04:45:08,130 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 602 transitions. [2020-10-16 04:45:08,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 602 transitions. [2020-10-16 04:45:08,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:45:08,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 602 transitions. [2020-10-16 04:45:08,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:45:08,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:45:08,135 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:45:08,136 INFO L185 Difference]: Start difference. First operand has 39 places, 29 transitions, 110 flow. Second operand 4 states and 602 transitions. [2020-10-16 04:45:08,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 30 transitions, 122 flow [2020-10-16 04:45:08,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 116 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 04:45:08,141 INFO L241 Difference]: Finished difference. Result has 42 places, 29 transitions, 111 flow [2020-10-16 04:45:08,142 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2020-10-16 04:45:08,142 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2020-10-16 04:45:08,142 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 111 flow [2020-10-16 04:45:08,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:45:08,143 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:45:08,143 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:45:08,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:45:08,145 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:45:08,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:45:08,146 INFO L82 PathProgramCache]: Analyzing trace with hash 289015485, now seen corresponding path program 3 times [2020-10-16 04:45:08,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:45:08,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949405434] [2020-10-16 04:45:08,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:45:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:45:08,313 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 04:45:08,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949405434] [2020-10-16 04:45:08,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:45:08,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:45:08,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386638285] [2020-10-16 04:45:08,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:45:08,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:45:08,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:45:08,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:45:08,318 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 182 [2020-10-16 04:45:08,319 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 111 flow. Second operand 5 states. [2020-10-16 04:45:08,319 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:45:08,319 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 182 [2020-10-16 04:45:08,319 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:45:08,509 INFO L129 PetriNetUnfolder]: 33/122 cut-off events. [2020-10-16 04:45:08,509 INFO L130 PetriNetUnfolder]: For 49/50 co-relation queries the response was YES. [2020-10-16 04:45:08,510 INFO L80 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 122 events. 33/122 cut-off events. For 49/50 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 454 event pairs, 6 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 279. Up to 41 conditions per place. [2020-10-16 04:45:08,511 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 7 selfloop transitions, 5 changer transitions 7/40 dead transitions. [2020-10-16 04:45:08,511 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 171 flow [2020-10-16 04:45:08,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:45:08,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:45:08,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 818 transitions. [2020-10-16 04:45:08,514 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7490842490842491 [2020-10-16 04:45:08,514 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 818 transitions. [2020-10-16 04:45:08,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 818 transitions. [2020-10-16 04:45:08,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:45:08,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 818 transitions. [2020-10-16 04:45:08,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:45:08,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:45:08,520 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:45:08,520 INFO L185 Difference]: Start difference. First operand has 42 places, 29 transitions, 111 flow. Second operand 6 states and 818 transitions. [2020-10-16 04:45:08,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 171 flow [2020-10-16 04:45:08,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 168 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 04:45:08,523 INFO L241 Difference]: Finished difference. Result has 48 places, 33 transitions, 146 flow [2020-10-16 04:45:08,523 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2020-10-16 04:45:08,523 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 13 predicate places. [2020-10-16 04:45:08,523 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 146 flow [2020-10-16 04:45:08,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:45:08,524 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:45:08,524 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:45:08,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:45:08,524 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:45:08,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:45:08,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1965199813, now seen corresponding path program 4 times [2020-10-16 04:45:08,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:45:08,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73037419] [2020-10-16 04:45:08,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:45:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:45:08,728 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 04:45:08,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73037419] [2020-10-16 04:45:08,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:45:08,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:45:08,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886916139] [2020-10-16 04:45:08,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:45:08,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:45:08,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:45:08,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:45:08,733 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 182 [2020-10-16 04:45:08,734 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 146 flow. Second operand 7 states. [2020-10-16 04:45:08,734 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:45:08,734 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 182 [2020-10-16 04:45:08,734 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:45:08,988 INFO L129 PetriNetUnfolder]: 33/135 cut-off events. [2020-10-16 04:45:08,988 INFO L130 PetriNetUnfolder]: For 113/152 co-relation queries the response was YES. [2020-10-16 04:45:08,989 INFO L80 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 135 events. 33/135 cut-off events. For 113/152 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 532 event pairs, 4 based on Foata normal form. 11/140 useless extension candidates. Maximal degree in co-relation 387. Up to 34 conditions per place. [2020-10-16 04:45:08,990 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 11 selfloop transitions, 5 changer transitions 8/45 dead transitions. [2020-10-16 04:45:08,990 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 45 transitions, 250 flow [2020-10-16 04:45:08,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:45:08,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:45:08,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 766 transitions. [2020-10-16 04:45:08,993 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7014652014652014 [2020-10-16 04:45:08,993 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 766 transitions. [2020-10-16 04:45:08,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 766 transitions. [2020-10-16 04:45:08,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:45:08,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 766 transitions. [2020-10-16 04:45:08,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:45:08,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:45:08,999 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:45:08,999 INFO L185 Difference]: Start difference. First operand has 48 places, 33 transitions, 146 flow. Second operand 6 states and 766 transitions. [2020-10-16 04:45:08,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 45 transitions, 250 flow [2020-10-16 04:45:09,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 45 transitions, 236 flow, removed 7 selfloop flow, removed 2 redundant places. [2020-10-16 04:45:09,003 INFO L241 Difference]: Finished difference. Result has 52 places, 33 transitions, 162 flow [2020-10-16 04:45:09,003 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=52, PETRI_TRANSITIONS=33} [2020-10-16 04:45:09,003 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2020-10-16 04:45:09,003 INFO L481 AbstractCegarLoop]: Abstraction has has 52 places, 33 transitions, 162 flow [2020-10-16 04:45:09,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:45:09,004 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:45:09,004 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:45:09,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:45:09,004 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:45:09,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:45:09,004 INFO L82 PathProgramCache]: Analyzing trace with hash 530458397, now seen corresponding path program 5 times [2020-10-16 04:45:09,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:45:09,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300220779] [2020-10-16 04:45:09,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:45:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:45:09,062 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:45:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:45:09,121 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:45:09,189 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:45:09,189 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:45:09,189 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:45:09,191 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 04:45:09,221 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L2-->L853: Formula: (let ((.cse8 (= (mod ~a$w_buff1_used~0_In-1297076343 256) 0)) (.cse9 (= (mod ~a$r_buff1_thd0~0_In-1297076343 256) 0)) (.cse6 (= (mod ~a$w_buff0_used~0_In-1297076343 256) 0)) (.cse7 (= (mod ~a$r_buff0_thd0~0_In-1297076343 256) 0))) (let ((.cse5 (or .cse6 .cse7)) (.cse0 (or .cse8 .cse9)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (= ~a$r_buff1_thd0~0_In-1297076343 ~a$r_buff1_thd0~0_Out-1297076343) (or (and (= ~a$w_buff1_used~0_Out-1297076343 ~a$w_buff1_used~0_In-1297076343) .cse0) (and (= ~a$w_buff1_used~0_Out-1297076343 0) .cse1 .cse2)) (or (and .cse3 (= ~a$w_buff0_used~0_Out-1297076343 0) .cse4) (and (= ~a$w_buff0_used~0_In-1297076343 ~a$w_buff0_used~0_Out-1297076343) .cse5)) (or (and .cse5 (or (and (= ~a~0_Out-1297076343 ~a~0_In-1297076343) .cse0) (and (= ~a$w_buff1~0_In-1297076343 ~a~0_Out-1297076343) .cse1 .cse2))) (and .cse3 .cse4 (= ~a$w_buff0~0_In-1297076343 ~a~0_Out-1297076343))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1297076343 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1297076343| ULTIMATE.start_assume_abort_if_not_~cond_Out-1297076343) (= ~a$r_buff0_thd0~0_Out-1297076343 ~a$r_buff0_thd0~0_In-1297076343)))) InVars {~a~0=~a~0_In-1297076343, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1297076343|, ~a$w_buff1~0=~a$w_buff1~0_In-1297076343, ~a$w_buff0~0=~a$w_buff0~0_In-1297076343, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1297076343, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1297076343, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1297076343, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1297076343} OutVars{ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1297076343|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-1297076343, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1297076343|, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1297076343|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_Out-1297076343, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1297076343|, ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1297076343|, ~a~0=~a~0_Out-1297076343, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1297076343|, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1297076343|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1297076343, ~a$w_buff1~0=~a$w_buff1~0_In-1297076343, ~a$w_buff0~0=~a$w_buff0~0_In-1297076343, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-1297076343, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-1297076343} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite47, ~a$r_buff1_thd0~0, ~a$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite48, ~a$w_buff1_used~0] because there is no mapped edge [2020-10-16 04:45:09,227 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 04:45:09,228 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,237 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 04:45:09,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,238 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 04:45:09,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,239 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 04:45:09,239 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,240 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 04:45:09,240 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,240 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 04:45:09,241 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,242 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 04:45:09,242 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,242 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 04:45:09,242 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,243 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 04:45:09,243 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,243 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 04:45:09,244 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,244 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 04:45:09,244 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,244 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 04:45:09,244 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,244 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 04:45:09,245 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,245 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 04:45:09,245 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,245 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 04:45:09,245 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,245 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 04:45:09,245 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,246 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 04:45:09,246 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,246 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 04:45:09,246 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,246 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 04:45:09,246 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,252 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 04:45:09,253 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,253 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 04:45:09,253 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,254 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 04:45:09,254 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,254 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 04:45:09,254 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,255 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 04:45:09,255 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,255 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 04:45:09,255 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,256 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 04:45:09,256 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,257 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 04:45:09,257 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,258 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 04:45:09,258 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,258 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 04:45:09,258 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,259 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 04:45:09,259 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,259 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 04:45:09,259 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,260 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 04:45:09,260 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:45:09,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:45:09 BasicIcfg [2020-10-16 04:45:09,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:45:09,379 INFO L168 Benchmark]: Toolchain (without parser) took 10661.76 ms. Allocated memory was 251.7 MB in the beginning and 518.0 MB in the end (delta: 266.3 MB). Free memory was 208.3 MB in the beginning and 353.5 MB in the end (delta: -145.2 MB). Peak memory consumption was 121.2 MB. Max. memory is 14.2 GB. [2020-10-16 04:45:09,380 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 251.7 MB. Free memory was 229.7 MB in the beginning and 228.9 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. [2020-10-16 04:45:09,381 INFO L168 Benchmark]: CACSL2BoogieTranslator took 782.70 ms. Allocated memory was 251.7 MB in the beginning and 314.6 MB in the end (delta: 62.9 MB). Free memory was 207.4 MB in the beginning and 266.4 MB in the end (delta: -58.9 MB). Peak memory consumption was 33.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:45:09,381 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.76 ms. Allocated memory is still 314.6 MB. Free memory was 266.4 MB in the beginning and 263.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-16 04:45:09,382 INFO L168 Benchmark]: Boogie Preprocessor took 43.16 ms. Allocated memory is still 314.6 MB. Free memory was 263.0 MB in the beginning and 260.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:45:09,383 INFO L168 Benchmark]: RCFGBuilder took 2121.37 ms. Allocated memory was 314.6 MB in the beginning and 358.6 MB in the end (delta: 44.0 MB). Free memory was 260.5 MB in the beginning and 189.2 MB in the end (delta: 71.3 MB). Peak memory consumption was 115.3 MB. Max. memory is 14.2 GB. [2020-10-16 04:45:09,384 INFO L168 Benchmark]: TraceAbstraction took 7645.12 ms. Allocated memory was 358.6 MB in the beginning and 518.0 MB in the end (delta: 159.4 MB). Free memory was 187.0 MB in the beginning and 353.5 MB in the end (delta: -166.4 MB). There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:45:09,388 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.39 ms. Allocated memory is still 251.7 MB. Free memory was 229.7 MB in the beginning and 228.9 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 782.70 ms. Allocated memory was 251.7 MB in the beginning and 314.6 MB in the end (delta: 62.9 MB). Free memory was 207.4 MB in the beginning and 266.4 MB in the end (delta: -58.9 MB). Peak memory consumption was 33.5 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 60.76 ms. Allocated memory is still 314.6 MB. Free memory was 266.4 MB in the beginning and 263.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 43.16 ms. Allocated memory is still 314.6 MB. Free memory was 263.0 MB in the beginning and 260.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2121.37 ms. Allocated memory was 314.6 MB in the beginning and 358.6 MB in the end (delta: 44.0 MB). Free memory was 260.5 MB in the beginning and 189.2 MB in the end (delta: 71.3 MB). Peak memory consumption was 115.3 MB. Max. memory is 14.2 GB. * TraceAbstraction took 7645.12 ms. Allocated memory was 358.6 MB in the beginning and 518.0 MB in the end (delta: 159.4 MB). Free memory was 187.0 MB in the beginning and 353.5 MB in the end (delta: -166.4 MB). There was no memory consumed. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1430 VarBasedMoverChecksPositive, 100 VarBasedMoverChecksNegative, 25 SemBasedMoverChecksPositive, 75 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 203 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.5s, 104 PlacesBefore, 35 PlacesAfterwards, 96 TransitionsBefore, 26 TransitionsAfterwards, 1928 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 83 TotalNumberOfCompositions, 6007 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p0_EAX = 0; [L702] 0 int __unbuffered_p0_EBX = 0; [L704] 0 int __unbuffered_p2_EAX = 0; [L706] 0 int __unbuffered_p2_EBX = 0; [L708] 0 int a = 0; [L709] 0 _Bool a$flush_delayed; [L710] 0 int a$mem_tmp; [L711] 0 _Bool a$r_buff0_thd0; [L712] 0 _Bool a$r_buff0_thd1; [L713] 0 _Bool a$r_buff0_thd2; [L714] 0 _Bool a$r_buff0_thd3; [L715] 0 _Bool a$r_buff1_thd0; [L716] 0 _Bool a$r_buff1_thd1; [L717] 0 _Bool a$r_buff1_thd2; [L718] 0 _Bool a$r_buff1_thd3; [L719] 0 _Bool a$read_delayed; [L720] 0 int *a$read_delayed_var; [L721] 0 int a$w_buff0; [L722] 0 _Bool a$w_buff0_used; [L723] 0 int a$w_buff1; [L724] 0 _Bool a$w_buff1_used; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L837] 0 pthread_t t633; [L838] FCALL, FORK 0 pthread_create(&t633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L738] 1 a$w_buff1 = a$w_buff0 [L739] 1 a$w_buff0 = 1 [L740] 1 a$w_buff1_used = a$w_buff0_used [L741] 1 a$w_buff0_used = (_Bool)1 [L7] COND FALSE 1 !(!expression) [L743] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L744] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L745] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L746] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L747] 1 a$r_buff0_thd1 = (_Bool)1 [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L839] 0 pthread_t t634; [L840] FCALL, FORK 0 pthread_create(&t634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L756] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=0] [L776] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=1] [L779] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L779] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L780] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L781] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L782] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L782] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L783] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L841] 0 pthread_t t635; [L842] FCALL, FORK 0 pthread_create(&t635, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L793] 3 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L799] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L800] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L801] 3 a$flush_delayed = weak$$choice2 [L802] 3 a$mem_tmp = a [L803] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1 [L803] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L804] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0) [L804] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L805] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L806] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used) [L806] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L807] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L807] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L808] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L809] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L809] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L809] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L809] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L810] 3 __unbuffered_p2_EBX = a [L811] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L811] 3 a = a$flush_delayed ? a$mem_tmp : a [L812] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, y=1, z=2] [L759] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L759] EXPR 1 a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a [L759] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L759] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L760] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L760] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L761] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L761] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L762] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L762] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L763] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L763] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 1 return 0; [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L816] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L817] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L817] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L818] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L818] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L819] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L819] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L855] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 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: 7.2s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 37 SDtfs, 15 SDslu, 24 SDs, 0 SdLazy, 224 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 14237 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...