/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/safe009_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:38:29,991 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:38:29,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:38:30,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:38:30,032 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:38:30,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:38:30,045 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:38:30,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:38:30,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:38:30,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:38:30,055 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:38:30,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:38:30,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:38:30,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:38:30,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:38:30,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:38:30,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:38:30,067 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:38:30,069 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:38:30,076 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:38:30,078 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:38:30,079 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:38:30,080 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:38:30,081 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:38:30,086 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:38:30,086 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:38:30,086 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:38:30,089 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:38:30,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:38:30,090 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:38:30,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:38:30,091 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:38:30,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:38:30,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:38:30,094 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:38:30,094 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:38:30,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:38:30,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:38:30,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:38:30,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:38:30,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:38:30,098 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2020-10-16 01:38:30,143 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:38:30,143 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:38:30,145 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:38:30,145 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:38:30,145 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:38:30,145 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:38:30,145 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:38:30,146 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:38:30,146 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:38:30,146 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:38:30,147 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:38:30,147 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:38:30,148 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:38:30,148 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:38:30,148 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:38:30,149 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:38:30,149 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:38:30,149 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:38:30,149 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:38:30,149 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:38:30,150 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:38:30,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:38:30,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:38:30,150 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:38:30,150 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:38:30,150 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:38:30,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:38:30,151 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:38:30,151 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:38:30,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:38:30,444 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:38:30,448 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:38:30,449 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:38:30,450 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:38:30,450 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i [2020-10-16 01:38:30,502 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99bede587/743f842e9f70457994a19e3522232fc0/FLAGec9d83d38 [2020-10-16 01:38:31,028 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:38:31,028 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i [2020-10-16 01:38:31,049 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99bede587/743f842e9f70457994a19e3522232fc0/FLAGec9d83d38 [2020-10-16 01:38:31,339 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99bede587/743f842e9f70457994a19e3522232fc0 [2020-10-16 01:38:31,350 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:38:31,352 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:38:31,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:38:31,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:38:31,356 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:38:31,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:38:31" (1/1) ... [2020-10-16 01:38:31,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b10973e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:31, skipping insertion in model container [2020-10-16 01:38:31,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:38:31" (1/1) ... [2020-10-16 01:38:31,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:38:31,413 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:38:31,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:38:31,961 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:38:32,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:38:32,127 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:38:32,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:32 WrapperNode [2020-10-16 01:38:32,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:38:32,129 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:38:32,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:38:32,130 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:38:32,138 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:38:32" (1/1) ... [2020-10-16 01:38:32,159 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:38:32" (1/1) ... [2020-10-16 01:38:32,188 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:38:32,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:38:32,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:38:32,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:38:32,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:32" (1/1) ... [2020-10-16 01:38:32,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:32" (1/1) ... [2020-10-16 01:38:32,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:32" (1/1) ... [2020-10-16 01:38:32,204 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:32" (1/1) ... [2020-10-16 01:38:32,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:32" (1/1) ... [2020-10-16 01:38:32,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:32" (1/1) ... [2020-10-16 01:38:32,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:32" (1/1) ... [2020-10-16 01:38:32,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:38:32,231 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:38:32,231 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:38:32,231 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:38:32,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:32" (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:38:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-16 01:38:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:38:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:38:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:38:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:38:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:38:32,300 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:38:32,300 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:38:32,301 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:38:32,301 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:38:32,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:38:32,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-16 01:38:32,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:38:32,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:38:32,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:38:32,306 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:38:34,461 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:38:34,462 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-16 01:38:34,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:38:34 BoogieIcfgContainer [2020-10-16 01:38:34,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:38:34,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:38:34,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:38:34,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:38:34,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:38:31" (1/3) ... [2020-10-16 01:38:34,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a56ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:38:34, skipping insertion in model container [2020-10-16 01:38:34,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:32" (2/3) ... [2020-10-16 01:38:34,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a56ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:38:34, skipping insertion in model container [2020-10-16 01:38:34,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:38:34" (3/3) ... [2020-10-16 01:38:34,475 INFO L111 eAbstractionObserver]: Analyzing ICFG safe009_rmo.opt.i [2020-10-16 01:38:34,490 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:38:34,499 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-16 01:38:34,500 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:38:34,576 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,576 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,576 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,577 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,581 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,581 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,594 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,595 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,604 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,604 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,614 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,617 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,621 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,622 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:34,642 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-10-16 01:38:34,667 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:38:34,667 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:38:34,667 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:38:34,667 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:38:34,667 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:38:34,668 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:38:34,668 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:38:34,668 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:38:34,682 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2020-10-16 01:38:34,732 INFO L129 PetriNetUnfolder]: 2/105 cut-off events. [2020-10-16 01:38:34,733 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:38:34,740 INFO L80 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2020-10-16 01:38:34,741 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2020-10-16 01:38:34,749 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 94 transitions, 197 flow [2020-10-16 01:38:34,753 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:38:34,757 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 94 transitions, 197 flow [2020-10-16 01:38:34,760 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 94 transitions, 197 flow [2020-10-16 01:38:34,760 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 103 places, 94 transitions, 197 flow [2020-10-16 01:38:34,805 INFO L129 PetriNetUnfolder]: 1/94 cut-off events. [2020-10-16 01:38:34,805 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:38:34,807 INFO L80 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 1/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2020-10-16 01:38:34,811 INFO L117 LiptonReduction]: Number of co-enabled transitions 1034 [2020-10-16 01:38:34,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:38:34,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:34,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:34,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:34,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:34,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:34,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:34,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:34,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:34,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:34,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:34,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:34,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:34,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:34,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:34,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:34,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:34,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:34,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:34,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:34,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:34,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:34,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:38:34,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:35,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:35,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:35,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:35,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:35,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:35,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:35,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:35,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:35,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:35,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:35,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:35,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:35,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:35,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:35,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:35,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:35,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:35,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:35,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:35,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:35,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:35,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:35,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:38:35,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:36,448 WARN L193 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 238 DAG size of output: 197 [2020-10-16 01:38:36,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 01:38:36,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,084 WARN L193 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-16 01:38:37,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:38:37,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:37,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:37,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:37,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:37,315 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:38:37,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:37,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:38:37,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:37,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:37,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:37,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:37,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:38:37,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:37,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:38:37,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:37,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:38:37,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:37,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:37,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:37,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:37,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:38:37,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:37,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:37,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:37,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:37,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:37,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:38:37,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:37,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:38:37,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:37,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:37,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:37,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:37,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:38:37,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:37,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:37,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:37,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:37,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:37,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:38:37,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:37,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 01:38:37,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 01:38:37,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:38:37,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:38:37,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:38:37,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:37,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:37,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 2, 1] term [2020-10-16 01:38:37,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:37,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:38:37,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:37,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:37,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:37,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:37,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:37,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:37,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:38,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:38,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 2, 1] term [2020-10-16 01:38:38,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:38,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:38:38,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:38,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:38,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:38,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:38,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:38,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:38,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:38,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:38:38,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:38:38,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:38:38,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:38,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:38:38,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:38:38,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:38:38,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:38,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:38,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:38,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 2, 1] term [2020-10-16 01:38:38,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:38,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:38:38,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:38,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:38,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:38,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:38,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:38,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:38,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:38,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:38,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:38,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 2, 1] term [2020-10-16 01:38:38,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:38,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:38:38,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:38,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:38,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:38,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:38,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:38,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:38,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:38,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:38:38,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:38:38,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:38:38,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:38,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:38:38,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:38:38,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:38:38,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:38,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:38,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:38,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 2, 1] term [2020-10-16 01:38:38,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:38,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:38:38,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:38,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:38,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:38,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:38,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:38,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:38,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:38,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 1] term [2020-10-16 01:38:38,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:38,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 01:38:38,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:38,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 1] term [2020-10-16 01:38:38,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:38,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-16 01:38:38,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:39,001 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2020-10-16 01:38:39,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:38:39,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:39,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:39,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:39,110 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-16 01:38:39,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:39,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:39,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:39,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:39,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 2, 1] term [2020-10-16 01:38:39,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:39,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:38:39,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:39,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:39,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:39,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:39,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:39,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:39,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:39,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:39,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:39,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:39,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:39,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:39,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:39,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:39,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:39,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:39,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:39,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:39,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:38:39,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:38:39,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:38:39,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:39,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 1] term [2020-10-16 01:38:39,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:39,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-16 01:38:39,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:39,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 1] term [2020-10-16 01:38:39,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:39,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 01:38:39,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:39,695 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-10-16 01:38:39,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:38:39,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:39,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:39,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:39,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:38:39,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:39,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:39,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:39,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:38:39,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:39,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:39,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:39,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:40,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:38:40,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:40,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:38:40,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:40,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-10-16 01:38:40,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:40,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-16 01:38:40,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:40,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-10-16 01:38:40,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:40,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 01:38:40,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:40,273 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2020-10-16 01:38:40,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 2, 1] term [2020-10-16 01:38:40,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:40,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:38:40,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:40,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:40,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:40,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:40,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:40,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:40,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:40,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:40,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:40,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:40,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:38:40,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:40,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:38:40,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:40,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:40,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:40,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:40,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:40,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:40,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:40,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:40,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:40,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:40,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:40,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:40,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:38:40,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:40,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 3, 4, 3, 2, 1] term [2020-10-16 01:38:40,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:40,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:40,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:40,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:40,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:40,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:40,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:40,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:40,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:40,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:40,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:40,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:40,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:40,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:40,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 2, 1] term [2020-10-16 01:38:40,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:40,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:38:40,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:40,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:40,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:40,879 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:40,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:40,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:38:40,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:40,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:40,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:40,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:40,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-10-16 01:38:40,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:40,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 01:38:40,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:41,225 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-16 01:38:41,409 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-10-16 01:38:41,950 WARN L193 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 130 [2020-10-16 01:38:42,191 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-10-16 01:38:42,198 INFO L132 LiptonReduction]: Checked pairs total: 3219 [2020-10-16 01:38:42,199 INFO L134 LiptonReduction]: Total number of compositions: 80 [2020-10-16 01:38:42,206 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7456 [2020-10-16 01:38:42,219 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2020-10-16 01:38:42,219 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:38:42,220 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:42,221 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:42,221 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:42,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:42,229 INFO L82 PathProgramCache]: Analyzing trace with hash 954786927, now seen corresponding path program 1 times [2020-10-16 01:38:42,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:42,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747686433] [2020-10-16 01:38:42,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:42,570 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:38:42,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747686433] [2020-10-16 01:38:42,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:42,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:38:42,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281216060] [2020-10-16 01:38:42,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-16 01:38:42,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:42,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-16 01:38:42,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-16 01:38:42,607 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 188 [2020-10-16 01:38:42,611 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 51 flow. Second operand 2 states. [2020-10-16 01:38:42,611 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:42,611 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 188 [2020-10-16 01:38:42,613 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:42,630 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2020-10-16 01:38:42,630 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:38:42,630 INFO L80 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 1/21 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2020-10-16 01:38:42,631 INFO L132 encePairwiseOnDemand]: 187/188 looper letters, 0 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2020-10-16 01:38:42,632 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 20 transitions, 49 flow [2020-10-16 01:38:42,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-16 01:38:42,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-10-16 01:38:42,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 363 transitions. [2020-10-16 01:38:42,655 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.9654255319148937 [2020-10-16 01:38:42,656 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 363 transitions. [2020-10-16 01:38:42,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 363 transitions. [2020-10-16 01:38:42,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:42,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 363 transitions. [2020-10-16 01:38:42,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. [2020-10-16 01:38:42,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 3 states. [2020-10-16 01:38:42,683 INFO L81 ComplementDD]: Finished complementDD. Result 3 states. [2020-10-16 01:38:42,685 INFO L185 Difference]: Start difference. First operand has 30 places, 21 transitions, 51 flow. Second operand 2 states and 363 transitions. [2020-10-16 01:38:42,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 20 transitions, 49 flow [2020-10-16 01:38:42,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 20 transitions, 46 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 01:38:42,696 INFO L241 Difference]: Finished difference. Result has 28 places, 20 transitions, 46 flow [2020-10-16 01:38:42,699 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2020-10-16 01:38:42,700 INFO L342 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2020-10-16 01:38:42,700 INFO L481 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 46 flow [2020-10-16 01:38:42,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-16 01:38:42,701 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:42,701 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:42,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:38:42,701 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:42,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:42,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1572740972, now seen corresponding path program 1 times [2020-10-16 01:38:42,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:42,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657941582] [2020-10-16 01:38:42,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:42,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:38:42,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657941582] [2020-10-16 01:38:42,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:42,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:38:42,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224018669] [2020-10-16 01:38:42,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:38:42,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:42,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:38:42,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:38:42,827 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 188 [2020-10-16 01:38:42,827 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 20 transitions, 46 flow. Second operand 3 states. [2020-10-16 01:38:42,827 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:42,827 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 188 [2020-10-16 01:38:42,827 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:42,843 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2020-10-16 01:38:42,843 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:38:42,844 INFO L80 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 1/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2020-10-16 01:38:42,844 INFO L132 encePairwiseOnDemand]: 185/188 looper letters, 1 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2020-10-16 01:38:42,844 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 20 transitions, 52 flow [2020-10-16 01:38:42,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:38:42,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:38:42,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2020-10-16 01:38:42,847 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.900709219858156 [2020-10-16 01:38:42,847 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 508 transitions. [2020-10-16 01:38:42,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 508 transitions. [2020-10-16 01:38:42,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:42,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 508 transitions. [2020-10-16 01:38:42,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:38:42,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:38:42,852 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:38:42,852 INFO L185 Difference]: Start difference. First operand has 28 places, 20 transitions, 46 flow. Second operand 3 states and 508 transitions. [2020-10-16 01:38:42,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 20 transitions, 52 flow [2020-10-16 01:38:42,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 20 transitions, 52 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-16 01:38:42,854 INFO L241 Difference]: Finished difference. Result has 31 places, 20 transitions, 54 flow [2020-10-16 01:38:42,854 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2020-10-16 01:38:42,855 INFO L342 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2020-10-16 01:38:42,855 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 54 flow [2020-10-16 01:38:42,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:38:42,855 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:42,855 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:42,855 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:38:42,856 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:42,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:42,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1510330624, now seen corresponding path program 1 times [2020-10-16 01:38:42,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:42,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039003453] [2020-10-16 01:38:42,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:42,917 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:38:42,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039003453] [2020-10-16 01:38:42,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:42,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:38:42,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124264114] [2020-10-16 01:38:42,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:38:42,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:42,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:38:42,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:38:42,921 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 188 [2020-10-16 01:38:42,921 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 54 flow. Second operand 4 states. [2020-10-16 01:38:42,922 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:42,922 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 188 [2020-10-16 01:38:42,922 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:42,965 INFO L129 PetriNetUnfolder]: 6/52 cut-off events. [2020-10-16 01:38:42,966 INFO L130 PetriNetUnfolder]: For 9/19 co-relation queries the response was YES. [2020-10-16 01:38:42,966 INFO L80 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 52 events. 6/52 cut-off events. For 9/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 198 event pairs, 0 based on Foata normal form. 3/53 useless extension candidates. Maximal degree in co-relation 90. Up to 11 conditions per place. [2020-10-16 01:38:42,967 INFO L132 encePairwiseOnDemand]: 183/188 looper letters, 5 selfloop transitions, 4 changer transitions 1/25 dead transitions. [2020-10-16 01:38:42,967 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 25 transitions, 87 flow [2020-10-16 01:38:42,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:38:42,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:38:42,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 644 transitions. [2020-10-16 01:38:42,970 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8563829787234043 [2020-10-16 01:38:42,970 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 644 transitions. [2020-10-16 01:38:42,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 644 transitions. [2020-10-16 01:38:42,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:42,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 644 transitions. [2020-10-16 01:38:42,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:38:42,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:38:42,974 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:38:42,975 INFO L185 Difference]: Start difference. First operand has 31 places, 20 transitions, 54 flow. Second operand 4 states and 644 transitions. [2020-10-16 01:38:42,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 25 transitions, 87 flow [2020-10-16 01:38:42,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 25 transitions, 81 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:38:42,976 INFO L241 Difference]: Finished difference. Result has 34 places, 22 transitions, 76 flow [2020-10-16 01:38:42,977 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=76, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2020-10-16 01:38:42,977 INFO L342 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2020-10-16 01:38:42,977 INFO L481 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 76 flow [2020-10-16 01:38:42,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:38:42,977 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:42,977 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:42,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:38:42,978 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:42,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:42,978 INFO L82 PathProgramCache]: Analyzing trace with hash 380682334, now seen corresponding path program 1 times [2020-10-16 01:38:42,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:42,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245161637] [2020-10-16 01:38:42,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:43,082 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:38:43,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245161637] [2020-10-16 01:38:43,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:43,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:38:43,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908332610] [2020-10-16 01:38:43,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:38:43,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:43,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:38:43,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:38:43,086 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 188 [2020-10-16 01:38:43,087 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 76 flow. Second operand 3 states. [2020-10-16 01:38:43,087 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:43,087 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 188 [2020-10-16 01:38:43,087 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:43,103 INFO L129 PetriNetUnfolder]: 3/34 cut-off events. [2020-10-16 01:38:43,104 INFO L130 PetriNetUnfolder]: For 22/25 co-relation queries the response was YES. [2020-10-16 01:38:43,104 INFO L80 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 34 events. 3/34 cut-off events. For 22/25 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 86 event pairs, 1 based on Foata normal form. 2/36 useless extension candidates. Maximal degree in co-relation 69. Up to 10 conditions per place. [2020-10-16 01:38:43,104 INFO L132 encePairwiseOnDemand]: 185/188 looper letters, 1 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2020-10-16 01:38:43,105 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 22 transitions, 82 flow [2020-10-16 01:38:43,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:38:43,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:38:43,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2020-10-16 01:38:43,107 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8634751773049646 [2020-10-16 01:38:43,107 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 487 transitions. [2020-10-16 01:38:43,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 487 transitions. [2020-10-16 01:38:43,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:43,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 487 transitions. [2020-10-16 01:38:43,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:38:43,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:38:43,110 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:38:43,110 INFO L185 Difference]: Start difference. First operand has 34 places, 22 transitions, 76 flow. Second operand 3 states and 487 transitions. [2020-10-16 01:38:43,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 22 transitions, 82 flow [2020-10-16 01:38:43,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 22 transitions, 73 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-16 01:38:43,112 INFO L241 Difference]: Finished difference. Result has 34 places, 22 transitions, 75 flow [2020-10-16 01:38:43,112 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2020-10-16 01:38:43,112 INFO L342 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2020-10-16 01:38:43,112 INFO L481 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 75 flow [2020-10-16 01:38:43,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:38:43,113 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:43,113 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:43,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:38:43,113 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:43,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:43,113 INFO L82 PathProgramCache]: Analyzing trace with hash 892696081, now seen corresponding path program 1 times [2020-10-16 01:38:43,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:43,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144081085] [2020-10-16 01:38:43,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:43,158 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:38:43,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144081085] [2020-10-16 01:38:43,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:43,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:38:43,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911107064] [2020-10-16 01:38:43,159 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:38:43,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:43,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:38:43,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:38:43,161 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 188 [2020-10-16 01:38:43,162 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 75 flow. Second operand 4 states. [2020-10-16 01:38:43,162 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:43,162 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 188 [2020-10-16 01:38:43,162 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:43,194 INFO L129 PetriNetUnfolder]: 0/48 cut-off events. [2020-10-16 01:38:43,194 INFO L130 PetriNetUnfolder]: For 26/32 co-relation queries the response was YES. [2020-10-16 01:38:43,194 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 48 events. 0/48 cut-off events. For 26/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 8/56 useless extension candidates. Maximal degree in co-relation 0. Up to 10 conditions per place. [2020-10-16 01:38:43,195 INFO L132 encePairwiseOnDemand]: 184/188 looper letters, 4 selfloop transitions, 3 changer transitions 2/24 dead transitions. [2020-10-16 01:38:43,195 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 24 transitions, 100 flow [2020-10-16 01:38:43,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:38:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:38:43,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 801 transitions. [2020-10-16 01:38:43,198 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8521276595744681 [2020-10-16 01:38:43,198 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 801 transitions. [2020-10-16 01:38:43,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 801 transitions. [2020-10-16 01:38:43,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:43,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 801 transitions. [2020-10-16 01:38:43,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:38:43,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:38:43,202 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:38:43,203 INFO L185 Difference]: Start difference. First operand has 34 places, 22 transitions, 75 flow. Second operand 5 states and 801 transitions. [2020-10-16 01:38:43,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 24 transitions, 100 flow [2020-10-16 01:38:43,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:38:43,204 INFO L241 Difference]: Finished difference. Result has 39 places, 22 transitions, 88 flow [2020-10-16 01:38:43,205 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=39, PETRI_TRANSITIONS=22} [2020-10-16 01:38:43,205 INFO L342 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2020-10-16 01:38:43,205 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 22 transitions, 88 flow [2020-10-16 01:38:43,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:38:43,205 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:43,205 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:43,205 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:38:43,206 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:43,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:43,206 INFO L82 PathProgramCache]: Analyzing trace with hash -335258886, now seen corresponding path program 1 times [2020-10-16 01:38:43,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:43,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017397075] [2020-10-16 01:38:43,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:43,691 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:38:43,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017397075] [2020-10-16 01:38:43,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:43,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:38:43,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223237195] [2020-10-16 01:38:43,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:38:43,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:43,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:38:43,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:38:43,695 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 188 [2020-10-16 01:38:43,696 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 22 transitions, 88 flow. Second operand 8 states. [2020-10-16 01:38:43,696 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:43,696 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 188 [2020-10-16 01:38:43,697 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:44,187 INFO L129 PetriNetUnfolder]: 615/1004 cut-off events. [2020-10-16 01:38:44,187 INFO L130 PetriNetUnfolder]: For 1152/1199 co-relation queries the response was YES. [2020-10-16 01:38:44,193 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2325 conditions, 1004 events. 615/1004 cut-off events. For 1152/1199 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4718 event pairs, 118 based on Foata normal form. 15/993 useless extension candidates. Maximal degree in co-relation 2315. Up to 826 conditions per place. [2020-10-16 01:38:44,202 INFO L132 encePairwiseOnDemand]: 180/188 looper letters, 26 selfloop transitions, 10 changer transitions 0/44 dead transitions. [2020-10-16 01:38:44,202 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 205 flow [2020-10-16 01:38:44,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:38:44,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:38:44,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2020-10-16 01:38:44,205 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5723404255319149 [2020-10-16 01:38:44,205 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 538 transitions. [2020-10-16 01:38:44,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 538 transitions. [2020-10-16 01:38:44,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:44,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 538 transitions. [2020-10-16 01:38:44,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:38:44,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:38:44,209 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:38:44,209 INFO L185 Difference]: Start difference. First operand has 39 places, 22 transitions, 88 flow. Second operand 5 states and 538 transitions. [2020-10-16 01:38:44,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 205 flow [2020-10-16 01:38:44,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 196 flow, removed 3 selfloop flow, removed 3 redundant places. [2020-10-16 01:38:44,217 INFO L241 Difference]: Finished difference. Result has 41 places, 31 transitions, 149 flow [2020-10-16 01:38:44,217 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2020-10-16 01:38:44,218 INFO L342 CegarLoopForPetriNet]: 30 programPoint places, 11 predicate places. [2020-10-16 01:38:44,218 INFO L481 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 149 flow [2020-10-16 01:38:44,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:38:44,218 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:44,218 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:44,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:38:44,218 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:44,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:44,219 INFO L82 PathProgramCache]: Analyzing trace with hash 714036358, now seen corresponding path program 1 times [2020-10-16 01:38:44,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:44,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688754809] [2020-10-16 01:38:44,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:44,380 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:38:44,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688754809] [2020-10-16 01:38:44,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:44,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:38:44,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808948198] [2020-10-16 01:38:44,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:38:44,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:44,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:38:44,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:38:44,383 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 188 [2020-10-16 01:38:44,383 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 149 flow. Second operand 4 states. [2020-10-16 01:38:44,383 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:44,383 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 188 [2020-10-16 01:38:44,383 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:44,490 INFO L129 PetriNetUnfolder]: 166/410 cut-off events. [2020-10-16 01:38:44,490 INFO L130 PetriNetUnfolder]: For 627/649 co-relation queries the response was YES. [2020-10-16 01:38:44,493 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 410 events. 166/410 cut-off events. For 627/649 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 2628 event pairs, 68 based on Foata normal form. 36/396 useless extension candidates. Maximal degree in co-relation 1211. Up to 208 conditions per place. [2020-10-16 01:38:44,495 INFO L132 encePairwiseOnDemand]: 182/188 looper letters, 7 selfloop transitions, 11 changer transitions 4/44 dead transitions. [2020-10-16 01:38:44,495 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 44 transitions, 248 flow [2020-10-16 01:38:44,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:38:44,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:38:44,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 788 transitions. [2020-10-16 01:38:44,498 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8382978723404255 [2020-10-16 01:38:44,498 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 788 transitions. [2020-10-16 01:38:44,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 788 transitions. [2020-10-16 01:38:44,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:44,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 788 transitions. [2020-10-16 01:38:44,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:38:44,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:38:44,502 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:38:44,502 INFO L185 Difference]: Start difference. First operand has 41 places, 31 transitions, 149 flow. Second operand 5 states and 788 transitions. [2020-10-16 01:38:44,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 44 transitions, 248 flow [2020-10-16 01:38:44,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 248 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-16 01:38:44,507 INFO L241 Difference]: Finished difference. Result has 48 places, 38 transitions, 228 flow [2020-10-16 01:38:44,507 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=228, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2020-10-16 01:38:44,507 INFO L342 CegarLoopForPetriNet]: 30 programPoint places, 18 predicate places. [2020-10-16 01:38:44,508 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 228 flow [2020-10-16 01:38:44,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:38:44,508 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:44,508 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:44,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:38:44,508 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:44,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:44,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1249886253, now seen corresponding path program 1 times [2020-10-16 01:38:44,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:44,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055728047] [2020-10-16 01:38:44,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:45,017 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 32 [2020-10-16 01:38:45,052 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:38:45,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055728047] [2020-10-16 01:38:45,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:45,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:38:45,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841907174] [2020-10-16 01:38:45,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:38:45,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:45,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:38:45,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:38:45,055 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 188 [2020-10-16 01:38:45,056 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 228 flow. Second operand 8 states. [2020-10-16 01:38:45,056 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:45,056 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 188 [2020-10-16 01:38:45,056 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:45,465 INFO L129 PetriNetUnfolder]: 210/515 cut-off events. [2020-10-16 01:38:45,465 INFO L130 PetriNetUnfolder]: For 1292/1352 co-relation queries the response was YES. [2020-10-16 01:38:45,468 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1921 conditions, 515 events. 210/515 cut-off events. For 1292/1352 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3132 event pairs, 42 based on Foata normal form. 44/532 useless extension candidates. Maximal degree in co-relation 1906. Up to 212 conditions per place. [2020-10-16 01:38:45,471 INFO L132 encePairwiseOnDemand]: 184/188 looper letters, 16 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2020-10-16 01:38:45,471 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 311 flow [2020-10-16 01:38:45,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:38:45,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:38:45,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions. [2020-10-16 01:38:45,474 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.636968085106383 [2020-10-16 01:38:45,474 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 479 transitions. [2020-10-16 01:38:45,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 479 transitions. [2020-10-16 01:38:45,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:45,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 479 transitions. [2020-10-16 01:38:45,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:38:45,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:38:45,477 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:38:45,478 INFO L185 Difference]: Start difference. First operand has 48 places, 38 transitions, 228 flow. Second operand 4 states and 479 transitions. [2020-10-16 01:38:45,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 311 flow [2020-10-16 01:38:45,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 311 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-16 01:38:45,483 INFO L241 Difference]: Finished difference. Result has 53 places, 40 transitions, 267 flow [2020-10-16 01:38:45,484 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=267, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2020-10-16 01:38:45,484 INFO L342 CegarLoopForPetriNet]: 30 programPoint places, 23 predicate places. [2020-10-16 01:38:45,484 INFO L481 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 267 flow [2020-10-16 01:38:45,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:38:45,484 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:45,485 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:45,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:38:45,485 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:45,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:45,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1106022429, now seen corresponding path program 1 times [2020-10-16 01:38:45,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:45,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039374563] [2020-10-16 01:38:45,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:45,569 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:38:45,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039374563] [2020-10-16 01:38:45,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:45,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:38:45,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373192648] [2020-10-16 01:38:45,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:38:45,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:45,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:38:45,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:38:45,572 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 188 [2020-10-16 01:38:45,573 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 267 flow. Second operand 5 states. [2020-10-16 01:38:45,573 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:45,573 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 188 [2020-10-16 01:38:45,573 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:45,677 INFO L129 PetriNetUnfolder]: 79/263 cut-off events. [2020-10-16 01:38:45,678 INFO L130 PetriNetUnfolder]: For 872/936 co-relation queries the response was YES. [2020-10-16 01:38:45,680 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1118 conditions, 263 events. 79/263 cut-off events. For 872/936 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1605 event pairs, 13 based on Foata normal form. 80/330 useless extension candidates. Maximal degree in co-relation 1100. Up to 130 conditions per place. [2020-10-16 01:38:45,681 INFO L132 encePairwiseOnDemand]: 182/188 looper letters, 5 selfloop transitions, 17 changer transitions 4/50 dead transitions. [2020-10-16 01:38:45,681 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 389 flow [2020-10-16 01:38:45,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:38:45,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:38:45,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1103 transitions. [2020-10-16 01:38:45,686 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8381458966565349 [2020-10-16 01:38:45,686 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1103 transitions. [2020-10-16 01:38:45,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1103 transitions. [2020-10-16 01:38:45,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:45,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1103 transitions. [2020-10-16 01:38:45,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:38:45,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:38:45,691 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:38:45,691 INFO L185 Difference]: Start difference. First operand has 53 places, 40 transitions, 267 flow. Second operand 7 states and 1103 transitions. [2020-10-16 01:38:45,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 389 flow [2020-10-16 01:38:45,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 383 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:38:45,697 INFO L241 Difference]: Finished difference. Result has 61 places, 46 transitions, 364 flow [2020-10-16 01:38:45,697 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=364, PETRI_PLACES=61, PETRI_TRANSITIONS=46} [2020-10-16 01:38:45,697 INFO L342 CegarLoopForPetriNet]: 30 programPoint places, 31 predicate places. [2020-10-16 01:38:45,697 INFO L481 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 364 flow [2020-10-16 01:38:45,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:38:45,698 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:45,698 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:38:45,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:38:45,698 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:45,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:45,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1373178234, now seen corresponding path program 1 times [2020-10-16 01:38:45,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:45,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806939354] [2020-10-16 01:38:45,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:45,809 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:38:45,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806939354] [2020-10-16 01:38:45,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:45,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:38:45,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452551119] [2020-10-16 01:38:45,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:38:45,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:45,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:38:45,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:38:45,813 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 188 [2020-10-16 01:38:45,814 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 46 transitions, 364 flow. Second operand 6 states. [2020-10-16 01:38:45,814 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:45,814 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 188 [2020-10-16 01:38:45,815 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:45,938 INFO L129 PetriNetUnfolder]: 58/212 cut-off events. [2020-10-16 01:38:45,938 INFO L130 PetriNetUnfolder]: For 1192/1280 co-relation queries the response was YES. [2020-10-16 01:38:45,940 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 212 events. 58/212 cut-off events. For 1192/1280 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1278 event pairs, 7 based on Foata normal form. 81/281 useless extension candidates. Maximal degree in co-relation 1057. Up to 113 conditions per place. [2020-10-16 01:38:45,941 INFO L132 encePairwiseOnDemand]: 182/188 looper letters, 2 selfloop transitions, 20 changer transitions 10/50 dead transitions. [2020-10-16 01:38:45,941 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 50 transitions, 450 flow [2020-10-16 01:38:45,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:38:45,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:38:45,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1411 transitions. [2020-10-16 01:38:45,947 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8339243498817966 [2020-10-16 01:38:45,947 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1411 transitions. [2020-10-16 01:38:45,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1411 transitions. [2020-10-16 01:38:45,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:45,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1411 transitions. [2020-10-16 01:38:45,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:38:45,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:38:45,955 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:38:45,955 INFO L185 Difference]: Start difference. First operand has 61 places, 46 transitions, 364 flow. Second operand 9 states and 1411 transitions. [2020-10-16 01:38:45,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 50 transitions, 450 flow [2020-10-16 01:38:45,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 50 transitions, 384 flow, removed 22 selfloop flow, removed 5 redundant places. [2020-10-16 01:38:45,964 INFO L241 Difference]: Finished difference. Result has 67 places, 40 transitions, 316 flow [2020-10-16 01:38:45,964 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=316, PETRI_PLACES=67, PETRI_TRANSITIONS=40} [2020-10-16 01:38:45,965 INFO L342 CegarLoopForPetriNet]: 30 programPoint places, 37 predicate places. [2020-10-16 01:38:45,965 INFO L481 AbstractCegarLoop]: Abstraction has has 67 places, 40 transitions, 316 flow [2020-10-16 01:38:45,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:38:45,965 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:45,965 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:38:45,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:38:45,965 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:45,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:45,966 INFO L82 PathProgramCache]: Analyzing trace with hash 986791128, now seen corresponding path program 1 times [2020-10-16 01:38:45,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:45,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948655015] [2020-10-16 01:38:45,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:38:46,045 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:38:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:38:46,127 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:38:46,187 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:38:46,187 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:38:46,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:38:46,223 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:38:46,223 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,223 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:38:46,223 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,224 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:38:46,224 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,224 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:38:46,224 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,224 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:38:46,224 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,224 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:38:46,225 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,225 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:38:46,225 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,226 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:38:46,226 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,226 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:38:46,226 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,226 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:38:46,226 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,228 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:38:46,229 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,229 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:38:46,229 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,229 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:38:46,229 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,229 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:38:46,230 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,230 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:38:46,230 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,234 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:38:46,235 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,235 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:38:46,235 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,235 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:38:46,235 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,235 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:38:46,236 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,236 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:38:46,236 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,238 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:46,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,238 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:46,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,238 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:46,239 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,239 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:46,239 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,239 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:46,239 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,240 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:46,240 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,240 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:46,240 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,240 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:46,240 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,241 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:38:46,241 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,241 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:38:46,241 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,241 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:38:46,241 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,242 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:46,242 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,242 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:46,242 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:46,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:38:46 BasicIcfg [2020-10-16 01:38:46,334 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:38:46,336 INFO L168 Benchmark]: Toolchain (without parser) took 14984.94 ms. Allocated memory was 253.2 MB in the beginning and 558.9 MB in the end (delta: 305.7 MB). Free memory was 208.2 MB in the beginning and 331.5 MB in the end (delta: -123.3 MB). Peak memory consumption was 182.4 MB. Max. memory is 14.2 GB. [2020-10-16 01:38:46,337 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:38:46,338 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.96 ms. Allocated memory was 253.2 MB in the beginning and 319.8 MB in the end (delta: 66.6 MB). Free memory was 208.2 MB in the beginning and 267.9 MB in the end (delta: -59.6 MB). Peak memory consumption was 32.2 MB. Max. memory is 14.2 GB. [2020-10-16 01:38:46,338 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.65 ms. Allocated memory is still 319.8 MB. Free memory was 267.9 MB in the beginning and 265.4 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:38:46,339 INFO L168 Benchmark]: Boogie Preprocessor took 42.64 ms. Allocated memory is still 319.8 MB. Free memory was 265.4 MB in the beginning and 262.9 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:38:46,340 INFO L168 Benchmark]: RCFGBuilder took 2233.86 ms. Allocated memory was 319.8 MB in the beginning and 361.2 MB in the end (delta: 41.4 MB). Free memory was 262.9 MB in the beginning and 165.4 MB in the end (delta: 97.4 MB). Peak memory consumption was 138.9 MB. Max. memory is 14.2 GB. [2020-10-16 01:38:46,341 INFO L168 Benchmark]: TraceAbstraction took 11867.62 ms. Allocated memory was 361.2 MB in the beginning and 558.9 MB in the end (delta: 197.7 MB). Free memory was 165.4 MB in the beginning and 331.5 MB in the end (delta: -166.1 MB). Peak memory consumption was 31.6 MB. Max. memory is 14.2 GB. [2020-10-16 01:38:46,345 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.22 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 775.96 ms. Allocated memory was 253.2 MB in the beginning and 319.8 MB in the end (delta: 66.6 MB). Free memory was 208.2 MB in the beginning and 267.9 MB in the end (delta: -59.6 MB). Peak memory consumption was 32.2 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 58.65 ms. Allocated memory is still 319.8 MB. Free memory was 267.9 MB in the beginning and 265.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 42.64 ms. Allocated memory is still 319.8 MB. Free memory was 265.4 MB in the beginning and 262.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2233.86 ms. Allocated memory was 319.8 MB in the beginning and 361.2 MB in the end (delta: 41.4 MB). Free memory was 262.9 MB in the beginning and 165.4 MB in the end (delta: 97.4 MB). Peak memory consumption was 138.9 MB. Max. memory is 14.2 GB. * TraceAbstraction took 11867.62 ms. Allocated memory was 361.2 MB in the beginning and 558.9 MB in the end (delta: 197.7 MB). Free memory was 165.4 MB in the beginning and 331.5 MB in the end (delta: -166.1 MB). Peak memory consumption was 31.6 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 654 VarBasedMoverChecksPositive, 80 VarBasedMoverChecksNegative, 33 SemBasedMoverChecksPositive, 47 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 87 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.4s, 103 PlacesBefore, 30 PlacesAfterwards, 94 TransitionsBefore, 21 TransitionsAfterwards, 1034 CoEnabledTransitionPairs, 7 FixpointIterations, 49 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 80 TotalNumberOfCompositions, 3219 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p0_EAX = 0; [L702] 0 int __unbuffered_p1_EAX = 0; [L703] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L704] 0 int __unbuffered_p1_EAX$mem_tmp; [L705] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L706] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L707] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L708] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L709] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L710] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L711] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L712] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L713] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L714] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L715] 0 int __unbuffered_p1_EAX$w_buff0; [L716] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L717] 0 int __unbuffered_p1_EAX$w_buff1; [L718] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff1_thd0; [L730] 0 _Bool x$r_buff1_thd1; [L731] 0 _Bool x$r_buff1_thd2; [L732] 0 _Bool x$r_buff1_thd3; [L733] 0 _Bool x$read_delayed; [L734] 0 int *x$read_delayed_var; [L735] 0 int x$w_buff0; [L736] 0 _Bool x$w_buff0_used; [L737] 0 int x$w_buff1; [L738] 0 _Bool x$w_buff1_used; [L740] 0 int y = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice1; [L743] 0 _Bool weak$$choice2; [L827] 0 pthread_t t2000; [L828] FCALL, FORK 0 pthread_create(&t2000, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L829] 0 pthread_t t2001; [L830] FCALL, FORK 0 pthread_create(&t2001, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 x$flush_delayed = weak$$choice2 [L770] EXPR 2 \read(x) [L770] 2 x$mem_tmp = x [L771] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L771] EXPR 2 \read(x) [L771] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L771] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L772] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L772] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L773] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L773] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L773] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L773] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L774] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L774] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L774] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L774] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L775] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L776] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L777] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L779] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L780] EXPR 2 \read(x) [L780] 2 __unbuffered_p1_EAX = x [L781] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L781] EXPR 2 \read(x) [L781] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L781] 2 x = x$flush_delayed ? x$mem_tmp : x [L782] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L831] 0 pthread_t t2002; [L832] FCALL, FORK 0 pthread_create(&t2002, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L802] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=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=8, weak$$choice1=0, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L805] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L806] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L807] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L808] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L809] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L812] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L814] 3 return 0; [L747] 1 __unbuffered_p0_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, 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=8, weak$$choice1=0, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L750] 1 x = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, 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=8, weak$$choice1=0, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L753] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L754] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L755] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L756] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L757] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L838] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L838] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L838] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L838] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L839] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L839] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L840] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L840] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L841] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L841] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L842] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L845] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L846] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L846] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L846] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L846] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L846] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L846] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, 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=8, weak$$choice1=255, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 107 locations, 1 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: 11.5s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.5s, HoareTripleCheckerStatistics: 28 SDtfs, 24 SDslu, 17 SDs, 0 SdLazy, 265 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=364occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 14355 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...