/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix020_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:19:10,732 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:19:10,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:19:10,758 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:19:10,759 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:19:10,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:19:10,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:19:10,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:19:10,764 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:19:10,767 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:19:10,768 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:19:10,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:19:10,770 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:19:10,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:19:10,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:19:10,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:19:10,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:19:10,783 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:19:10,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:19:10,788 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:19:10,790 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:19:10,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:19:10,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:19:10,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:19:10,798 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:19:10,798 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:19:10,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:19:10,801 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:19:10,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:19:10,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:19:10,803 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:19:10,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:19:10,804 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:19:10,805 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:19:10,815 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:19:10,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:19:10,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:19:10,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:19:10,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:19:10,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:19:10,820 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:19:10,823 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2020-10-16 01:19:10,868 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:19:10,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:19:10,870 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:19:10,870 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:19:10,870 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:19:10,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:19:10,870 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:19:10,871 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:19:10,871 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:19:10,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:19:10,871 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:19:10,871 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:19:10,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:19:10,872 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:19:10,873 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:19:10,874 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:19:10,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:19:10,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:19:10,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:19:10,875 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:19:10,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:19:10,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:19:10,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:19:10,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:19:10,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:19:10,876 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:19:10,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:19:10,876 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:19:10,876 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:19:11,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:19:11,179 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:19:11,183 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:19:11,184 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:19:11,185 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:19:11,186 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix020_pso.opt.i [2020-10-16 01:19:11,263 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cedcf6d21/7268e7d440e24c1895caa4d97778ae7e/FLAG27ad13361 [2020-10-16 01:19:11,837 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:19:11,838 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix020_pso.opt.i [2020-10-16 01:19:11,854 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cedcf6d21/7268e7d440e24c1895caa4d97778ae7e/FLAG27ad13361 [2020-10-16 01:19:12,094 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cedcf6d21/7268e7d440e24c1895caa4d97778ae7e [2020-10-16 01:19:12,107 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:19:12,109 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:19:12,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:19:12,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:19:12,117 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:19:12,118 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:19:12" (1/1) ... [2020-10-16 01:19:12,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@129921e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:19:12, skipping insertion in model container [2020-10-16 01:19:12,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:19:12" (1/1) ... [2020-10-16 01:19:12,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:19:12,202 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:19:12,736 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:19:12,754 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:19:12,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:19:12,960 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:19:12,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:19:12 WrapperNode [2020-10-16 01:19:12,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:19:12,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:19:12,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:19:12,961 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:19:12,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:19:12" (1/1) ... [2020-10-16 01:19:12,993 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:19:12" (1/1) ... [2020-10-16 01:19:13,047 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:19:13,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:19:13,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:19:13,050 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:19:13,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:19:12" (1/1) ... [2020-10-16 01:19:13,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:19:12" (1/1) ... [2020-10-16 01:19:13,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:19:12" (1/1) ... [2020-10-16 01:19:13,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:19:12" (1/1) ... [2020-10-16 01:19:13,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:19:12" (1/1) ... [2020-10-16 01:19:13,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:19:12" (1/1) ... [2020-10-16 01:19:13,087 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:19:12" (1/1) ... [2020-10-16 01:19:13,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:19:13,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:19:13,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:19:13,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:19:13,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:19:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:19:13,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:19:13,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:19:13,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:19:13,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:19:13,161 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:19:13,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:19:13,163 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:19:13,163 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:19:13,164 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:19:13,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:19:13,166 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 01:19:13,166 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 01:19:13,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:19:13,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:19:13,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:19:13,169 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 01:19:15,617 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:19:15,617 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:19:15,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:19:15 BoogieIcfgContainer [2020-10-16 01:19:15,620 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:19:15,621 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:19:15,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:19:15,625 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:19:15,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:19:12" (1/3) ... [2020-10-16 01:19:15,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2943e4c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:19:15, skipping insertion in model container [2020-10-16 01:19:15,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:19:12" (2/3) ... [2020-10-16 01:19:15,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2943e4c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:19:15, skipping insertion in model container [2020-10-16 01:19:15,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:19:15" (3/3) ... [2020-10-16 01:19:15,629 INFO L111 eAbstractionObserver]: Analyzing ICFG mix020_pso.opt.i [2020-10-16 01:19:15,641 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:19:15,650 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:19:15,651 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:19:15,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,687 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,687 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,689 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,689 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,690 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,690 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,690 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,690 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,690 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,690 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,691 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,691 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,691 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,691 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,691 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,691 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,691 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,699 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,699 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,699 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,700 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,700 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,700 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,701 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,701 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,701 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,701 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,701 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,702 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,702 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,702 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,702 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,702 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,702 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,703 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,703 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,703 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,703 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,703 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,703 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,705 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,705 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,705 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,705 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,705 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,705 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,707 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,707 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,707 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,710 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,710 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,710 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,710 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,711 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,716 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,718 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,724 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,724 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,724 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,724 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,725 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,725 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,725 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,725 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,725 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,725 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,726 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,726 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,726 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,726 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,726 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,728 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,732 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,733 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,734 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,734 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:19:15,752 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 01:19:15,775 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:19:15,775 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:19:15,775 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:19:15,775 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:19:15,775 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:19:15,776 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:19:15,776 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:19:15,776 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:19:15,791 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 121 places, 110 transitions, 240 flow [2020-10-16 01:19:15,846 INFO L129 PetriNetUnfolder]: 2/106 cut-off events. [2020-10-16 01:19:15,846 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:19:15,852 INFO L80 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-16 01:19:15,852 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 110 transitions, 240 flow [2020-10-16 01:19:15,859 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 106 transitions, 224 flow [2020-10-16 01:19:15,863 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:19:15,866 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 106 transitions, 224 flow [2020-10-16 01:19:15,869 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 106 transitions, 224 flow [2020-10-16 01:19:15,870 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 117 places, 106 transitions, 224 flow [2020-10-16 01:19:15,898 INFO L129 PetriNetUnfolder]: 2/106 cut-off events. [2020-10-16 01:19:15,898 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:19:15,899 INFO L80 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-16 01:19:15,902 INFO L117 LiptonReduction]: Number of co-enabled transitions 2340 [2020-10-16 01:19:16,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:19:16,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:16,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:19:16,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:16,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:19:16,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:19:16,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:19:16,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:19:16,068 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:19:16,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:16,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:19:16,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:16,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:19:16,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:19:16,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:19:16,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:19:16,434 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2020-10-16 01:19:16,547 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 01:19:16,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:19:16,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:16,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:19:16,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:19:16,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:16,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:19:16,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:19:16,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:19:16,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:19:16,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:16,798 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 01:19:16,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:16,858 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 01:19:16,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:16,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:16,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:19:16,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:19:16,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:16,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:19:16,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:16,992 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:19:16,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:16,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:19:16,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:19:16,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:19:16,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:19:17,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:19:17,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:17,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:19:17,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:17,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:19:17,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:19:17,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:19:17,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:19:17,363 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-10-16 01:19:17,937 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 01:19:18,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:19:18,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:19:18,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:19:18,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:19:18,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:19:18,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:18,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:18,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:18,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:19:18,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:19:18,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:19:18,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:19:18,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:19:18,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:18,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:18,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:18,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:19:18,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:18,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:19:18,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:19:18,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:19:18,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:19:18,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,375 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 01:19:18,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,377 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 01:19:18,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:19:18,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:19:18,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:19:18,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:19:18,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:19:18,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:19:18,591 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:19:18,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:19:18,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:18,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:18,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:18,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:19:18,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,677 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:19:18,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:19:18,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:19:18,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:19:18,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:18,707 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:18,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:18,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:19:18,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:19:18,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:18,882 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:19:18,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:18,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:19:18,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:19:18,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:19:18,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:19:18,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:19:18,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:18,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:19:18,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:18,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:19:18,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:19:18,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:19:18,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:18,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:19:18,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:19,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:19:19,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:19,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:19:19,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:19:19,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:19,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:19:19,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:19:19,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:19:19,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:19:19,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:19,150 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 01:19:19,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:19,152 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 01:19:19,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:19,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:19,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:19:19,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:19:19,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:19,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:19:19,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:19,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:19:19,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:19,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:19:19,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:19,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:19:19,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:19,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:19:19,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:19,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:19:19,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:19,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:19:19,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:19:19,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:19:19,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:19:19,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:19,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:19:19,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:19:19,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:19,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:19:19,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:19:19,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:19:19,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:19:19,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:19:19,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:19:19,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:19:19,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:19:19,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:19:19,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:19,306 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 01:19:19,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:19,308 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 01:19:19,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:19:20,180 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-16 01:19:20,320 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-16 01:19:20,461 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-16 01:19:20,627 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-16 01:19:20,638 INFO L132 LiptonReduction]: Checked pairs total: 5958 [2020-10-16 01:19:20,638 INFO L134 LiptonReduction]: Total number of compositions: 89 [2020-10-16 01:19:20,641 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4781 [2020-10-16 01:19:20,650 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2020-10-16 01:19:20,650 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:19:20,650 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:19:20,651 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:19:20,652 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:19:20,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:19:20,658 INFO L82 PathProgramCache]: Analyzing trace with hash -2017444172, now seen corresponding path program 1 times [2020-10-16 01:19:20,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:19:20,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117526051] [2020-10-16 01:19:20,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:19:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:19:20,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:19:20,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117526051] [2020-10-16 01:19:20,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:19:20,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:19:20,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36875485] [2020-10-16 01:19:20,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:19:20,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:19:20,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:19:20,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:19:21,001 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 199 [2020-10-16 01:19:21,008 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states. [2020-10-16 01:19:21,008 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:19:21,008 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 199 [2020-10-16 01:19:21,010 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:19:21,121 INFO L129 PetriNetUnfolder]: 13/57 cut-off events. [2020-10-16 01:19:21,121 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:19:21,122 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 57 events. 13/57 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 147 event pairs, 1 based on Foata normal form. 8/63 useless extension candidates. Maximal degree in co-relation 89. Up to 25 conditions per place. [2020-10-16 01:19:21,124 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 6 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2020-10-16 01:19:21,124 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 29 transitions, 86 flow [2020-10-16 01:19:21,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:19:21,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:19:21,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2020-10-16 01:19:21,144 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8777219430485762 [2020-10-16 01:19:21,145 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2020-10-16 01:19:21,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2020-10-16 01:19:21,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:19:21,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2020-10-16 01:19:21,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:19:21,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:19:21,165 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:19:21,167 INFO L185 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 524 transitions. [2020-10-16 01:19:21,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 29 transitions, 86 flow [2020-10-16 01:19:21,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 82 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 01:19:21,173 INFO L241 Difference]: Finished difference. Result has 38 places, 27 transitions, 66 flow [2020-10-16 01:19:21,176 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2020-10-16 01:19:21,177 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2020-10-16 01:19:21,177 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2020-10-16 01:19:21,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:19:21,177 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:19:21,177 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:19:21,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:19:21,178 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:19:21,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:19:21,178 INFO L82 PathProgramCache]: Analyzing trace with hash 2095083106, now seen corresponding path program 1 times [2020-10-16 01:19:21,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:19:21,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132024665] [2020-10-16 01:19:21,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:19:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:19:21,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:19:21,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132024665] [2020-10-16 01:19:21,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:19:21,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:19:21,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506171162] [2020-10-16 01:19:21,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:19:21,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:19:21,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:19:21,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:19:21,310 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 199 [2020-10-16 01:19:21,310 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 flow. Second operand 4 states. [2020-10-16 01:19:21,310 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:19:21,311 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 199 [2020-10-16 01:19:21,311 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:19:21,353 INFO L129 PetriNetUnfolder]: 13/61 cut-off events. [2020-10-16 01:19:21,353 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:19:21,354 INFO L80 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 61 events. 13/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 171 event pairs, 2 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 96. Up to 15 conditions per place. [2020-10-16 01:19:21,355 INFO L132 encePairwiseOnDemand]: 193/199 looper letters, 4 selfloop transitions, 3 changer transitions 8/36 dead transitions. [2020-10-16 01:19:21,355 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 36 transitions, 114 flow [2020-10-16 01:19:21,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:19:21,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:19:21,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 847 transitions. [2020-10-16 01:19:21,359 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8512562814070351 [2020-10-16 01:19:21,359 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 847 transitions. [2020-10-16 01:19:21,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 847 transitions. [2020-10-16 01:19:21,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:19:21,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 847 transitions. [2020-10-16 01:19:21,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:19:21,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:19:21,366 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:19:21,366 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 5 states and 847 transitions. [2020-10-16 01:19:21,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 36 transitions, 114 flow [2020-10-16 01:19:21,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:19:21,368 INFO L241 Difference]: Finished difference. Result has 43 places, 28 transitions, 87 flow [2020-10-16 01:19:21,368 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=87, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2020-10-16 01:19:21,369 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2020-10-16 01:19:21,369 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 87 flow [2020-10-16 01:19:21,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:19:21,369 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:19:21,369 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:19:21,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:19:21,370 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:19:21,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:19:21,370 INFO L82 PathProgramCache]: Analyzing trace with hash 523029997, now seen corresponding path program 1 times [2020-10-16 01:19:21,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:19:21,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324015612] [2020-10-16 01:19:21,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:19:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:19:21,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:19:21,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324015612] [2020-10-16 01:19:21,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:19:21,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:19:21,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665557669] [2020-10-16 01:19:21,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:19:21,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:19:21,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:19:21,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:19:21,445 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2020-10-16 01:19:21,446 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 87 flow. Second operand 4 states. [2020-10-16 01:19:21,446 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:19:21,446 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2020-10-16 01:19:21,446 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:19:21,484 INFO L129 PetriNetUnfolder]: 7/55 cut-off events. [2020-10-16 01:19:21,484 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2020-10-16 01:19:21,485 INFO L80 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 55 events. 7/55 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 148 event pairs, 3 based on Foata normal form. 5/56 useless extension candidates. Maximal degree in co-relation 103. Up to 17 conditions per place. [2020-10-16 01:19:21,485 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 2 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2020-10-16 01:19:21,485 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 105 flow [2020-10-16 01:19:21,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:19:21,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:19:21,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 848 transitions. [2020-10-16 01:19:21,489 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8522613065326633 [2020-10-16 01:19:21,489 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 848 transitions. [2020-10-16 01:19:21,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 848 transitions. [2020-10-16 01:19:21,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:19:21,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 848 transitions. [2020-10-16 01:19:21,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:19:21,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:19:21,494 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:19:21,494 INFO L185 Difference]: Start difference. First operand has 43 places, 28 transitions, 87 flow. Second operand 5 states and 848 transitions. [2020-10-16 01:19:21,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 105 flow [2020-10-16 01:19:21,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 30 transitions, 100 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:19:21,496 INFO L241 Difference]: Finished difference. Result has 45 places, 28 transitions, 94 flow [2020-10-16 01:19:21,496 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=45, PETRI_TRANSITIONS=28} [2020-10-16 01:19:21,497 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2020-10-16 01:19:21,497 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 94 flow [2020-10-16 01:19:21,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:19:21,497 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:19:21,497 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:19:21,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:19:21,497 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:19:21,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:19:21,498 INFO L82 PathProgramCache]: Analyzing trace with hash 804733182, now seen corresponding path program 1 times [2020-10-16 01:19:21,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:19:21,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367921026] [2020-10-16 01:19:21,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:19:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:19:21,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:19:21,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367921026] [2020-10-16 01:19:21,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:19:21,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:19:21,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84803892] [2020-10-16 01:19:21,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:19:21,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:19:21,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:19:21,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:19:21,666 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 199 [2020-10-16 01:19:21,667 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 28 transitions, 94 flow. Second operand 4 states. [2020-10-16 01:19:21,667 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:19:21,667 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 199 [2020-10-16 01:19:21,667 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:19:21,749 INFO L129 PetriNetUnfolder]: 154/316 cut-off events. [2020-10-16 01:19:21,749 INFO L130 PetriNetUnfolder]: For 128/128 co-relation queries the response was YES. [2020-10-16 01:19:21,752 INFO L80 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 316 events. 154/316 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1662 event pairs, 82 based on Foata normal form. 20/301 useless extension candidates. Maximal degree in co-relation 719. Up to 168 conditions per place. [2020-10-16 01:19:21,755 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 9 selfloop transitions, 9 changer transitions 2/41 dead transitions. [2020-10-16 01:19:21,755 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 160 flow [2020-10-16 01:19:21,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:19:21,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:19:21,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 832 transitions. [2020-10-16 01:19:21,758 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8361809045226131 [2020-10-16 01:19:21,758 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 832 transitions. [2020-10-16 01:19:21,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 832 transitions. [2020-10-16 01:19:21,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:19:21,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 832 transitions. [2020-10-16 01:19:21,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:19:21,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:19:21,763 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:19:21,763 INFO L185 Difference]: Start difference. First operand has 45 places, 28 transitions, 94 flow. Second operand 5 states and 832 transitions. [2020-10-16 01:19:21,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 160 flow [2020-10-16 01:19:21,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 152 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 01:19:21,766 INFO L241 Difference]: Finished difference. Result has 46 places, 36 transitions, 155 flow [2020-10-16 01:19:21,767 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2020-10-16 01:19:21,767 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2020-10-16 01:19:21,767 INFO L481 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 155 flow [2020-10-16 01:19:21,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:19:21,767 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:19:21,767 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:19:21,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:19:21,768 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:19:21,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:19:21,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1009352506, now seen corresponding path program 1 times [2020-10-16 01:19:21,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:19:21,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136964321] [2020-10-16 01:19:21,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:19:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:19:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:19:21,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136964321] [2020-10-16 01:19:21,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:19:21,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:19:21,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364956998] [2020-10-16 01:19:21,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:19:21,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:19:21,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:19:21,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:19:21,866 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 199 [2020-10-16 01:19:21,866 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 155 flow. Second operand 4 states. [2020-10-16 01:19:21,866 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:19:21,867 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 199 [2020-10-16 01:19:21,867 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:19:21,950 INFO L129 PetriNetUnfolder]: 202/445 cut-off events. [2020-10-16 01:19:21,950 INFO L130 PetriNetUnfolder]: For 359/505 co-relation queries the response was YES. [2020-10-16 01:19:21,952 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 445 events. 202/445 cut-off events. For 359/505 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 2761 event pairs, 105 based on Foata normal form. 29/430 useless extension candidates. Maximal degree in co-relation 1332. Up to 293 conditions per place. [2020-10-16 01:19:21,955 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 5 selfloop transitions, 5 changer transitions 4/39 dead transitions. [2020-10-16 01:19:21,955 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 191 flow [2020-10-16 01:19:21,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:19:21,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:19:21,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 841 transitions. [2020-10-16 01:19:21,958 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8452261306532663 [2020-10-16 01:19:21,958 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 841 transitions. [2020-10-16 01:19:21,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 841 transitions. [2020-10-16 01:19:21,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:19:21,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 841 transitions. [2020-10-16 01:19:21,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:19:21,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:19:21,963 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:19:21,964 INFO L185 Difference]: Start difference. First operand has 46 places, 36 transitions, 155 flow. Second operand 5 states and 841 transitions. [2020-10-16 01:19:21,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 191 flow [2020-10-16 01:19:21,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 182 flow, removed 2 selfloop flow, removed 1 redundant places. [2020-10-16 01:19:21,967 INFO L241 Difference]: Finished difference. Result has 52 places, 34 transitions, 157 flow [2020-10-16 01:19:21,967 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2020-10-16 01:19:21,968 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2020-10-16 01:19:21,968 INFO L481 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 157 flow [2020-10-16 01:19:21,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:19:21,968 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:19:21,968 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:19:21,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:19:21,969 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:19:21,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:19:21,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1891259843, now seen corresponding path program 1 times [2020-10-16 01:19:21,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:19:21,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255224958] [2020-10-16 01:19:21,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:19:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:19:22,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:19:22,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255224958] [2020-10-16 01:19:22,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:19:22,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:19:22,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076104850] [2020-10-16 01:19:22,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:19:22,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:19:22,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:19:22,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:19:22,097 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 199 [2020-10-16 01:19:22,098 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 157 flow. Second operand 5 states. [2020-10-16 01:19:22,098 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:19:22,098 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 199 [2020-10-16 01:19:22,098 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:19:22,212 INFO L129 PetriNetUnfolder]: 140/326 cut-off events. [2020-10-16 01:19:22,212 INFO L130 PetriNetUnfolder]: For 497/755 co-relation queries the response was YES. [2020-10-16 01:19:22,214 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 326 events. 140/326 cut-off events. For 497/755 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1753 event pairs, 34 based on Foata normal form. 41/340 useless extension candidates. Maximal degree in co-relation 1225. Up to 220 conditions per place. [2020-10-16 01:19:22,218 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 6 selfloop transitions, 9 changer transitions 9/47 dead transitions. [2020-10-16 01:19:22,218 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 47 transitions, 281 flow [2020-10-16 01:19:22,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:19:22,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:19:22,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 998 transitions. [2020-10-16 01:19:22,222 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8358458961474037 [2020-10-16 01:19:22,222 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 998 transitions. [2020-10-16 01:19:22,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 998 transitions. [2020-10-16 01:19:22,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:19:22,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 998 transitions. [2020-10-16 01:19:22,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:19:22,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:19:22,229 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:19:22,229 INFO L185 Difference]: Start difference. First operand has 52 places, 34 transitions, 157 flow. Second operand 6 states and 998 transitions. [2020-10-16 01:19:22,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 47 transitions, 281 flow [2020-10-16 01:19:22,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 47 transitions, 270 flow, removed 4 selfloop flow, removed 2 redundant places. [2020-10-16 01:19:22,236 INFO L241 Difference]: Finished difference. Result has 56 places, 38 transitions, 218 flow [2020-10-16 01:19:22,236 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2020-10-16 01:19:22,236 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places. [2020-10-16 01:19:22,236 INFO L481 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 218 flow [2020-10-16 01:19:22,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:19:22,237 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:19:22,237 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] [2020-10-16 01:19:22,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:19:22,237 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:19:22,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:19:22,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1520778940, now seen corresponding path program 1 times [2020-10-16 01:19:22,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:19:22,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778680496] [2020-10-16 01:19:22,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:19:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:19:22,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:19:22,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778680496] [2020-10-16 01:19:22,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:19:22,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:19:22,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024389832] [2020-10-16 01:19:22,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:19:22,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:19:22,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:19:22,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:19:22,431 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 199 [2020-10-16 01:19:22,432 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 38 transitions, 218 flow. Second operand 6 states. [2020-10-16 01:19:22,432 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:19:22,432 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 199 [2020-10-16 01:19:22,432 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:19:22,521 INFO L129 PetriNetUnfolder]: 72/185 cut-off events. [2020-10-16 01:19:22,521 INFO L130 PetriNetUnfolder]: For 543/937 co-relation queries the response was YES. [2020-10-16 01:19:22,522 INFO L80 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 185 events. 72/185 cut-off events. For 543/937 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 793 event pairs, 5 based on Foata normal form. 47/218 useless extension candidates. Maximal degree in co-relation 903. Up to 132 conditions per place. [2020-10-16 01:19:22,523 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 6 selfloop transitions, 13 changer transitions 11/51 dead transitions. [2020-10-16 01:19:22,523 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 51 transitions, 400 flow [2020-10-16 01:19:22,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:19:22,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:19:22,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1164 transitions. [2020-10-16 01:19:22,527 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8356066044508256 [2020-10-16 01:19:22,527 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1164 transitions. [2020-10-16 01:19:22,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1164 transitions. [2020-10-16 01:19:22,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:19:22,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1164 transitions. [2020-10-16 01:19:22,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:19:22,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:19:22,534 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:19:22,534 INFO L185 Difference]: Start difference. First operand has 56 places, 38 transitions, 218 flow. Second operand 7 states and 1164 transitions. [2020-10-16 01:19:22,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 51 transitions, 400 flow [2020-10-16 01:19:22,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 51 transitions, 338 flow, removed 26 selfloop flow, removed 4 redundant places. [2020-10-16 01:19:22,538 INFO L241 Difference]: Finished difference. Result has 59 places, 40 transitions, 254 flow [2020-10-16 01:19:22,538 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=254, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2020-10-16 01:19:22,539 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2020-10-16 01:19:22,539 INFO L481 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 254 flow [2020-10-16 01:19:22,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:19:22,539 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:19:22,539 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 01:19:22,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:19:22,540 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:19:22,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:19:22,540 INFO L82 PathProgramCache]: Analyzing trace with hash -182554297, now seen corresponding path program 1 times [2020-10-16 01:19:22,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:19:22,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505984772] [2020-10-16 01:19:22,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:19:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:19:22,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:19:22,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505984772] [2020-10-16 01:19:22,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:19:22,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:19:22,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448154951] [2020-10-16 01:19:22,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:19:22,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:19:22,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:19:22,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:19:22,713 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 199 [2020-10-16 01:19:22,714 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 40 transitions, 254 flow. Second operand 5 states. [2020-10-16 01:19:22,714 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:19:22,714 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 199 [2020-10-16 01:19:22,714 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:19:22,781 INFO L129 PetriNetUnfolder]: 101/250 cut-off events. [2020-10-16 01:19:22,781 INFO L130 PetriNetUnfolder]: For 1046/1249 co-relation queries the response was YES. [2020-10-16 01:19:22,782 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 250 events. 101/250 cut-off events. For 1046/1249 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1163 event pairs, 9 based on Foata normal form. 15/235 useless extension candidates. Maximal degree in co-relation 1115. Up to 163 conditions per place. [2020-10-16 01:19:22,784 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 7 selfloop transitions, 2 changer transitions 1/45 dead transitions. [2020-10-16 01:19:22,784 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 45 transitions, 308 flow [2020-10-16 01:19:22,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:19:22,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:19:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 821 transitions. [2020-10-16 01:19:22,787 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8251256281407036 [2020-10-16 01:19:22,787 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 821 transitions. [2020-10-16 01:19:22,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 821 transitions. [2020-10-16 01:19:22,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:19:22,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 821 transitions. [2020-10-16 01:19:22,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:19:22,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:19:22,791 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:19:22,792 INFO L185 Difference]: Start difference. First operand has 59 places, 40 transitions, 254 flow. Second operand 5 states and 821 transitions. [2020-10-16 01:19:22,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 45 transitions, 308 flow [2020-10-16 01:19:22,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 45 transitions, 242 flow, removed 24 selfloop flow, removed 7 redundant places. [2020-10-16 01:19:22,799 INFO L241 Difference]: Finished difference. Result has 55 places, 41 transitions, 211 flow [2020-10-16 01:19:22,799 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=211, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2020-10-16 01:19:22,799 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2020-10-16 01:19:22,799 INFO L481 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 211 flow [2020-10-16 01:19:22,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:19:22,800 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:19:22,800 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 01:19:22,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:19:22,801 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:19:22,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:19:22,801 INFO L82 PathProgramCache]: Analyzing trace with hash 2136431459, now seen corresponding path program 2 times [2020-10-16 01:19:22,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:19:22,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739890149] [2020-10-16 01:19:22,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:19:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:19:22,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:19:22,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739890149] [2020-10-16 01:19:22,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:19:22,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:19:22,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669227908] [2020-10-16 01:19:22,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:19:22,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:19:22,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:19:22,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:19:22,994 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 199 [2020-10-16 01:19:22,995 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 211 flow. Second operand 7 states. [2020-10-16 01:19:22,995 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:19:22,995 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 199 [2020-10-16 01:19:22,995 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:19:23,102 INFO L129 PetriNetUnfolder]: 77/185 cut-off events. [2020-10-16 01:19:23,103 INFO L130 PetriNetUnfolder]: For 446/801 co-relation queries the response was YES. [2020-10-16 01:19:23,104 INFO L80 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 185 events. 77/185 cut-off events. For 446/801 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 747 event pairs, 0 based on Foata normal form. 65/220 useless extension candidates. Maximal degree in co-relation 718. Up to 101 conditions per place. [2020-10-16 01:19:23,104 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 2 selfloop transitions, 17 changer transitions 6/46 dead transitions. [2020-10-16 01:19:23,105 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 46 transitions, 307 flow [2020-10-16 01:19:23,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:19:23,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:19:23,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1322 transitions. [2020-10-16 01:19:23,109 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8304020100502513 [2020-10-16 01:19:23,109 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1322 transitions. [2020-10-16 01:19:23,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1322 transitions. [2020-10-16 01:19:23,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:19:23,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1322 transitions. [2020-10-16 01:19:23,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:19:23,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:19:23,117 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:19:23,117 INFO L185 Difference]: Start difference. First operand has 55 places, 41 transitions, 211 flow. Second operand 8 states and 1322 transitions. [2020-10-16 01:19:23,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 46 transitions, 307 flow [2020-10-16 01:19:23,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 46 transitions, 278 flow, removed 13 selfloop flow, removed 4 redundant places. [2020-10-16 01:19:23,121 INFO L241 Difference]: Finished difference. Result has 60 places, 40 transitions, 232 flow [2020-10-16 01:19:23,122 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=232, PETRI_PLACES=60, PETRI_TRANSITIONS=40} [2020-10-16 01:19:23,122 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2020-10-16 01:19:23,122 INFO L481 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 232 flow [2020-10-16 01:19:23,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:19:23,122 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:19:23,122 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:19:23,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:19:23,123 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:19:23,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:19:23,123 INFO L82 PathProgramCache]: Analyzing trace with hash 2113753004, now seen corresponding path program 1 times [2020-10-16 01:19:23,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:19:23,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137359169] [2020-10-16 01:19:23,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:19:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:19:23,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:19:23,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137359169] [2020-10-16 01:19:23,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:19:23,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:19:23,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539206402] [2020-10-16 01:19:23,243 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:19:23,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:19:23,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:19:23,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:19:23,247 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 199 [2020-10-16 01:19:23,247 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 40 transitions, 232 flow. Second operand 5 states. [2020-10-16 01:19:23,247 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:19:23,247 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 199 [2020-10-16 01:19:23,248 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:19:23,317 INFO L129 PetriNetUnfolder]: 82/196 cut-off events. [2020-10-16 01:19:23,317 INFO L130 PetriNetUnfolder]: For 320/443 co-relation queries the response was YES. [2020-10-16 01:19:23,318 INFO L80 FinitePrefix]: Finished finitePrefix Result has 704 conditions, 196 events. 82/196 cut-off events. For 320/443 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 840 event pairs, 0 based on Foata normal form. 2/162 useless extension candidates. Maximal degree in co-relation 682. Up to 81 conditions per place. [2020-10-16 01:19:23,319 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 4 selfloop transitions, 1 changer transitions 2/42 dead transitions. [2020-10-16 01:19:23,319 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 42 transitions, 254 flow [2020-10-16 01:19:23,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:19:23,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:19:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 833 transitions. [2020-10-16 01:19:23,331 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8371859296482412 [2020-10-16 01:19:23,331 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 833 transitions. [2020-10-16 01:19:23,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 833 transitions. [2020-10-16 01:19:23,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:19:23,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 833 transitions. [2020-10-16 01:19:23,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:19:23,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:19:23,335 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:19:23,335 INFO L185 Difference]: Start difference. First operand has 60 places, 40 transitions, 232 flow. Second operand 5 states and 833 transitions. [2020-10-16 01:19:23,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 42 transitions, 254 flow [2020-10-16 01:19:23,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 42 transitions, 194 flow, removed 17 selfloop flow, removed 8 redundant places. [2020-10-16 01:19:23,339 INFO L241 Difference]: Finished difference. Result has 56 places, 40 transitions, 183 flow [2020-10-16 01:19:23,342 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2020-10-16 01:19:23,342 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places. [2020-10-16 01:19:23,342 INFO L481 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 183 flow [2020-10-16 01:19:23,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:19:23,342 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:19:23,343 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:19:23,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:19:23,343 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:19:23,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:19:23,343 INFO L82 PathProgramCache]: Analyzing trace with hash -524184262, now seen corresponding path program 2 times [2020-10-16 01:19:23,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:19:23,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248875384] [2020-10-16 01:19:23,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:19:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:19:23,433 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:19:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:19:23,503 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:19:23,562 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:19:23,562 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:19:23,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:19:23,599 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,599 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,600 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,600 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,600 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,600 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,601 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,601 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,601 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,601 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,601 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,601 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,601 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,602 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,602 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,602 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,603 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,603 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,603 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,603 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,603 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,603 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,603 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,604 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,604 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,604 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,604 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,604 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,606 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,606 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,611 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,611 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,611 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,611 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,611 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,612 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,612 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,612 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,612 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,612 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,612 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,612 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,613 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,613 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,613 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,613 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,614 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,614 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,614 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,614 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,615 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,615 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,615 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,615 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,616 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,616 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,616 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,616 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,616 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,616 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,616 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,616 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,618 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,618 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,618 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,618 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,618 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,618 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,618 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,619 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,619 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,619 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,619 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:19:23,619 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:19:23,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:19:23 BasicIcfg [2020-10-16 01:19:23,731 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:19:23,733 INFO L168 Benchmark]: Toolchain (without parser) took 11623.79 ms. Allocated memory was 252.7 MB in the beginning and 575.7 MB in the end (delta: 323.0 MB). Free memory was 207.4 MB in the beginning and 336.7 MB in the end (delta: -129.3 MB). Peak memory consumption was 193.7 MB. Max. memory is 14.2 GB. [2020-10-16 01:19:23,733 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:19:23,734 INFO L168 Benchmark]: CACSL2BoogieTranslator took 848.22 ms. Allocated memory was 252.7 MB in the beginning and 317.7 MB in the end (delta: 65.0 MB). Free memory was 207.4 MB in the beginning and 265.7 MB in the end (delta: -58.3 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB. [2020-10-16 01:19:23,735 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.94 ms. Allocated memory is still 317.7 MB. Free memory was 265.7 MB in the beginning and 263.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:19:23,736 INFO L168 Benchmark]: Boogie Preprocessor took 44.88 ms. Allocated memory is still 317.7 MB. Free memory was 263.2 MB in the beginning and 260.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:19:23,736 INFO L168 Benchmark]: RCFGBuilder took 2525.53 ms. Allocated memory was 317.7 MB in the beginning and 373.8 MB in the end (delta: 56.1 MB). Free memory was 260.7 MB in the beginning and 307.8 MB in the end (delta: -47.1 MB). Peak memory consumption was 142.3 MB. Max. memory is 14.2 GB. [2020-10-16 01:19:23,737 INFO L168 Benchmark]: TraceAbstraction took 8109.66 ms. Allocated memory was 373.8 MB in the beginning and 575.7 MB in the end (delta: 201.9 MB). Free memory was 307.8 MB in the beginning and 336.7 MB in the end (delta: -28.9 MB). Peak memory consumption was 172.9 MB. Max. memory is 14.2 GB. [2020-10-16 01:19:23,741 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.26 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 848.22 ms. Allocated memory was 252.7 MB in the beginning and 317.7 MB in the end (delta: 65.0 MB). Free memory was 207.4 MB in the beginning and 265.7 MB in the end (delta: -58.3 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 87.94 ms. Allocated memory is still 317.7 MB. Free memory was 265.7 MB in the beginning and 263.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 44.88 ms. Allocated memory is still 317.7 MB. Free memory was 263.2 MB in the beginning and 260.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2525.53 ms. Allocated memory was 317.7 MB in the beginning and 373.8 MB in the end (delta: 56.1 MB). Free memory was 260.7 MB in the beginning and 307.8 MB in the end (delta: -47.1 MB). Peak memory consumption was 142.3 MB. Max. memory is 14.2 GB. * TraceAbstraction took 8109.66 ms. Allocated memory was 373.8 MB in the beginning and 575.7 MB in the end (delta: 201.9 MB). Free memory was 307.8 MB in the beginning and 336.7 MB in the end (delta: -28.9 MB). Peak memory consumption was 172.9 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1569 VarBasedMoverChecksPositive, 81 VarBasedMoverChecksNegative, 27 SemBasedMoverChecksPositive, 54 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 216 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.7s, 117 PlacesBefore, 41 PlacesAfterwards, 106 TransitionsBefore, 29 TransitionsAfterwards, 2340 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 89 TotalNumberOfCompositions, 5958 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p2_EAX = 0; [L705] 0 int __unbuffered_p3_EAX = 0; [L707] 0 int __unbuffered_p3_EBX = 0; [L709] 0 int a = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff0_thd4; [L725] 0 _Bool z$r_buff1_thd0; [L726] 0 _Bool z$r_buff1_thd1; [L727] 0 _Bool z$r_buff1_thd2; [L728] 0 _Bool z$r_buff1_thd3; [L729] 0 _Bool z$r_buff1_thd4; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L853] 0 pthread_t t533; [L854] FCALL, FORK 0 pthread_create(&t533, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 pthread_t t534; [L856] FCALL, FORK 0 pthread_create(&t534, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 pthread_t t535; [L858] FCALL, FORK 0 pthread_create(&t535, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 pthread_t t536; [L860] FCALL, FORK 0 pthread_create(&t536, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 4 z$w_buff1 = z$w_buff0 [L800] 4 z$w_buff0 = 1 [L801] 4 z$w_buff1_used = z$w_buff0_used [L802] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L804] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L805] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L806] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L807] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L808] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L809] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 4 z$flush_delayed = weak$$choice2 [L815] 4 z$mem_tmp = z [L816] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L816] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L817] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L817] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0) [L817] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L817] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L818] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L818] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1) [L818] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L818] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L819] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L819] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L820] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L820] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L821] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4) [L821] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L821] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L822] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0 [L822] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L822] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L822] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L823] 4 __unbuffered_p3_EAX = z [L824] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L824] 4 z = z$flush_delayed ? z$mem_tmp : z [L825] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 3 z$flush_delayed = weak$$choice2 [L777] 3 z$mem_tmp = z [L778] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L779] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L779] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L780] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L781] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L782] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L782] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L783] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L784] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L784] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] 3 __unbuffered_p2_EAX = z [L786] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L786] 3 z = z$flush_delayed ? z$mem_tmp : z [L787] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 2 return 0; [L792] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 3 return 0; [L831] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L831] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L831] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L831] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L832] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L832] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L833] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L833] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L834] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L834] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L835] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L835] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L838] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 4 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L866] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L866] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L866] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L866] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L867] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L867] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L868] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L868] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L869] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L869] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L870] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L870] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 109 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.7s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 45 SDtfs, 37 SDslu, 40 SDs, 0 SdLazy, 208 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=254occurred in iteration=7, 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.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 7899 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...