/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-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix049_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 22:00:32,083 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 22:00:32,086 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 22:00:32,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 22:00:32,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 22:00:32,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 22:00:32,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 22:00:32,117 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 22:00:32,118 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 22:00:32,119 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 22:00:32,120 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 22:00:32,122 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 22:00:32,122 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 22:00:32,123 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 22:00:32,124 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 22:00:32,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 22:00:32,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 22:00:32,127 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 22:00:32,129 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 22:00:32,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 22:00:32,133 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 22:00:32,134 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 22:00:32,135 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 22:00:32,136 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 22:00:32,138 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 22:00:32,139 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 22:00:32,139 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 22:00:32,140 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 22:00:32,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 22:00:32,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 22:00:32,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 22:00:32,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 22:00:32,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 22:00:32,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 22:00:32,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 22:00:32,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 22:00:32,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 22:00:32,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 22:00:32,146 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 22:00:32,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 22:00:32,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 22:00:32,148 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-FA-SemanticLbe.epf [2020-10-15 22:00:32,171 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 22:00:32,171 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 22:00:32,173 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 22:00:32,173 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 22:00:32,173 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 22:00:32,173 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 22:00:32,174 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 22:00:32,174 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 22:00:32,174 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 22:00:32,174 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 22:00:32,174 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 22:00:32,175 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 22:00:32,175 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 22:00:32,175 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 22:00:32,175 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 22:00:32,175 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 22:00:32,175 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 22:00:32,176 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 22:00:32,176 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 22:00:32,176 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 22:00:32,176 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 22:00:32,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 22:00:32,177 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 22:00:32,177 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 22:00:32,177 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 22:00:32,177 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 22:00:32,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 22:00:32,178 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 22:00:32,178 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 22:00:32,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 22:00:32,491 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 22:00:32,495 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 22:00:32,496 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 22:00:32,497 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 22:00:32,498 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix049_tso.oepc.i [2020-10-15 22:00:32,571 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32fd6fe9a/7ff31c9e6703452abbbd77124f7564a6/FLAG846e11653 [2020-10-15 22:00:33,098 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 22:00:33,099 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix049_tso.oepc.i [2020-10-15 22:00:33,119 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32fd6fe9a/7ff31c9e6703452abbbd77124f7564a6/FLAG846e11653 [2020-10-15 22:00:33,381 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32fd6fe9a/7ff31c9e6703452abbbd77124f7564a6 [2020-10-15 22:00:33,389 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 22:00:33,391 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 22:00:33,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 22:00:33,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 22:00:33,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 22:00:33,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 10:00:33" (1/1) ... [2020-10-15 22:00:33,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50d9b52f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:00:33, skipping insertion in model container [2020-10-15 22:00:33,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 10:00:33" (1/1) ... [2020-10-15 22:00:33,409 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 22:00:33,468 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 22:00:33,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 22:00:33,989 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 22:00:34,056 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 22:00:34,142 INFO L208 MainTranslator]: Completed translation [2020-10-15 22:00:34,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:00:34 WrapperNode [2020-10-15 22:00:34,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 22:00:34,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 22:00:34,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 22:00:34,144 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 22:00:34,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:00:34" (1/1) ... [2020-10-15 22:00:34,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:00:34" (1/1) ... [2020-10-15 22:00:34,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 22:00:34,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 22:00:34,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 22:00:34,230 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 22:00:34,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:00:34" (1/1) ... [2020-10-15 22:00:34,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:00:34" (1/1) ... [2020-10-15 22:00:34,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:00:34" (1/1) ... [2020-10-15 22:00:34,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:00:34" (1/1) ... [2020-10-15 22:00:34,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:00:34" (1/1) ... [2020-10-15 22:00:34,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:00:34" (1/1) ... [2020-10-15 22:00:34,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:00:34" (1/1) ... [2020-10-15 22:00:34,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 22:00:34,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 22:00:34,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 22:00:34,268 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 22:00:34,269 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:00:34" (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-15 22:00:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 22:00:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 22:00:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 22:00:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 22:00:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 22:00:34,347 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 22:00:34,347 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 22:00:34,347 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 22:00:34,347 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-15 22:00:34,347 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-15 22:00:34,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 22:00:34,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 22:00:34,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 22:00:34,350 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 22:00:36,409 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 22:00:36,409 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 22:00:36,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 10:00:36 BoogieIcfgContainer [2020-10-15 22:00:36,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 22:00:36,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 22:00:36,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 22:00:36,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 22:00:36,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 10:00:33" (1/3) ... [2020-10-15 22:00:36,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b8b18d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 10:00:36, skipping insertion in model container [2020-10-15 22:00:36,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:00:34" (2/3) ... [2020-10-15 22:00:36,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b8b18d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 10:00:36, skipping insertion in model container [2020-10-15 22:00:36,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 10:00:36" (3/3) ... [2020-10-15 22:00:36,426 INFO L111 eAbstractionObserver]: Analyzing ICFG mix049_tso.oepc.i [2020-10-15 22:00:36,437 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 22:00:36,437 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 22:00:36,444 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 22:00:36,444 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 22:00:36,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,475 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,475 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,476 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,476 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,480 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,480 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,484 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,485 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,491 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,491 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,491 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,491 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,491 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,501 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,501 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,501 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,501 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,502 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,502 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,502 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,502 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,503 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,503 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,508 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,509 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,516 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,518 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:00:36,539 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-15 22:00:36,561 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 22:00:36,561 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 22:00:36,561 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 22:00:36,562 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 22:00:36,562 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 22:00:36,562 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 22:00:36,562 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 22:00:36,562 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 22:00:36,577 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 22:00:36,579 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 203 flow [2020-10-15 22:00:36,582 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 203 flow [2020-10-15 22:00:36,585 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 203 flow [2020-10-15 22:00:36,634 INFO L129 PetriNetUnfolder]: 2/91 cut-off events. [2020-10-15 22:00:36,634 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 22:00:36,640 INFO L80 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-15 22:00:36,643 INFO L117 LiptonReduction]: Number of co-enabled transitions 1650 [2020-10-15 22:00:36,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:36,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:36,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:36,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:36,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:36,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:36,882 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:36,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:36,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:36,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:36,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:36,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:36,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:36,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:36,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:36,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:36,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:36,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:36,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:36,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:36,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:36,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:36,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:36,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:36,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:36,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:36,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:37,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:37,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:37,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:37,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:37,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:37,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:37,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:37,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:37,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:37,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:37,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:37,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:37,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:37,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:37,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:37,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:37,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:37,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:37,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:37,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:37,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:37,529 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-15 22:00:37,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:37,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:37,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:37,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:37,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:37,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:37,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:37,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:37,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:37,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:37,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:37,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:37,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:37,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:37,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:37,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:38,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:38,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:38,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:00:38,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:00:38,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:00:38,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:00:38,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:00:38,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:00:38,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:00:38,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:00:38,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:00:38,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:00:38,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:00:38,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:00:38,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:00:38,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 22:00:38,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 22:00:38,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:00:38,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:00:38,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 22:00:38,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 22:00:38,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:00:38,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:38,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:38,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:00:38,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:00:38,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:00:38,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:00:38,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:00:38,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:00:38,315 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:00:38,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:00:38,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:00:38,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:00:38,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:00:38,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:00:38,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:38,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:38,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:38,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:38,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:38,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:38,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:38,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:38,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:38,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:38,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:38,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:38,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:38,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:38,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:38,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:38,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 22:00:38,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:38,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:38,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:38,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:38,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:38,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:38,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:38,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:38,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:38,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:38,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:38,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:38,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:38,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:38,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:38,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:38,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:38,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 22:00:38,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:38,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:38,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:38,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:38,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:38,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:38,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:00:38,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:38,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:00:38,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:38,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:38,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:38,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:38,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:38,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:38,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:38,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:39,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:39,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:39,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:39,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:39,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:39,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:39,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:39,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:39,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:39,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:39,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:39,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:39,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:39,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:39,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:39,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:39,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:39,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:39,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:39,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:39,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:39,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:39,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:39,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:00:39,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:00:39,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:00:39,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:00:39,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:00:39,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:00:39,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:00:39,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:00:39,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:00:39,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:00:39,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:00:39,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:00:39,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:00:39,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 22:00:39,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 22:00:39,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:00:39,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:39,346 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:39,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:39,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:39,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:39,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:39,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:39,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:39,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,429 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:39,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:39,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:39,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:00:39,449 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:39,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:00:39,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:00:39,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 22:00:39,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 22:00:39,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:00:39,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:00:39,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:00:39,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:00:39,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:00:39,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:00:39,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:00:39,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:00:39,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:00:39,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:00:39,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:00:39,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:00:39,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:00:39,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:39,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:39,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:39,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:39,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:00:39,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:39,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:00:39,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:00:39,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:39,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:00:39,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:00:39,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:00:39,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:39,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:00:39,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:00:40,468 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2020-10-15 22:00:40,751 INFO L132 LiptonReduction]: Checked pairs total: 5350 [2020-10-15 22:00:40,751 INFO L134 LiptonReduction]: Total number of compositions: 82 [2020-10-15 22:00:40,761 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2020-10-15 22:00:40,830 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 824 states. [2020-10-15 22:00:40,833 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states. [2020-10-15 22:00:40,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-15 22:00:40,840 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:00:40,841 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-15 22:00:40,842 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:00:40,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:00:40,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1047971, now seen corresponding path program 1 times [2020-10-15 22:00:40,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:00:40,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770066248] [2020-10-15 22:00:40,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:00:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:00:41,067 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-15 22:00:41,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770066248] [2020-10-15 22:00:41,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:00:41,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 22:00:41,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058794248] [2020-10-15 22:00:41,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 22:00:41,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:00:41,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 22:00:41,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:00:41,095 INFO L87 Difference]: Start difference. First operand 824 states. Second operand 3 states. [2020-10-15 22:00:41,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:00:41,224 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-10-15 22:00:41,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 22:00:41,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-15 22:00:41,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:00:41,264 INFO L225 Difference]: With dead ends: 687 [2020-10-15 22:00:41,264 INFO L226 Difference]: Without dead ends: 562 [2020-10-15 22:00:41,265 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:00:41,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-10-15 22:00:41,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-10-15 22:00:41,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-15 22:00:41,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-10-15 22:00:41,366 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 3 [2020-10-15 22:00:41,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:00:41,369 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-10-15 22:00:41,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 22:00:41,369 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-10-15 22:00:41,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 22:00:41,370 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:00:41,371 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:00:41,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 22:00:41,371 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:00:41,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:00:41,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1804480994, now seen corresponding path program 1 times [2020-10-15 22:00:41,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:00:41,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684549616] [2020-10-15 22:00:41,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:00:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:00:41,509 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-15 22:00:41,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684549616] [2020-10-15 22:00:41,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:00:41,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:00:41,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265527621] [2020-10-15 22:00:41,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:00:41,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:00:41,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:00:41,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:00:41,513 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 4 states. [2020-10-15 22:00:41,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:00:41,558 INFO L93 Difference]: Finished difference Result 495 states and 1321 transitions. [2020-10-15 22:00:41,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:00:41,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-10-15 22:00:41,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:00:41,562 INFO L225 Difference]: With dead ends: 495 [2020-10-15 22:00:41,562 INFO L226 Difference]: Without dead ends: 370 [2020-10-15 22:00:41,563 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:00:41,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2020-10-15 22:00:41,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2020-10-15 22:00:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-10-15 22:00:41,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 957 transitions. [2020-10-15 22:00:41,581 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 957 transitions. Word has length 9 [2020-10-15 22:00:41,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:00:41,582 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 957 transitions. [2020-10-15 22:00:41,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:00:41,582 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 957 transitions. [2020-10-15 22:00:41,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 22:00:41,584 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:00:41,584 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:00:41,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 22:00:41,585 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:00:41,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:00:41,585 INFO L82 PathProgramCache]: Analyzing trace with hash -490874007, now seen corresponding path program 1 times [2020-10-15 22:00:41,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:00:41,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328764744] [2020-10-15 22:00:41,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:00:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:00:41,711 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-15 22:00:41,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328764744] [2020-10-15 22:00:41,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:00:41,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 22:00:41,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993693841] [2020-10-15 22:00:41,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 22:00:41,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:00:41,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 22:00:41,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:00:41,713 INFO L87 Difference]: Start difference. First operand 370 states and 957 transitions. Second operand 5 states. [2020-10-15 22:00:41,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:00:41,767 INFO L93 Difference]: Finished difference Result 287 states and 681 transitions. [2020-10-15 22:00:41,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 22:00:41,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-15 22:00:41,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:00:41,769 INFO L225 Difference]: With dead ends: 287 [2020-10-15 22:00:41,769 INFO L226 Difference]: Without dead ends: 226 [2020-10-15 22:00:41,770 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:00:41,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2020-10-15 22:00:41,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2020-10-15 22:00:41,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-10-15 22:00:41,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 525 transitions. [2020-10-15 22:00:41,777 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 525 transitions. Word has length 13 [2020-10-15 22:00:41,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:00:41,778 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 525 transitions. [2020-10-15 22:00:41,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 22:00:41,778 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 525 transitions. [2020-10-15 22:00:41,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 22:00:41,780 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:00:41,780 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:00:41,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 22:00:41,781 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:00:41,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:00:41,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1266340314, now seen corresponding path program 1 times [2020-10-15 22:00:41,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:00:41,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399979934] [2020-10-15 22:00:41,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:00:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:00:41,914 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-15 22:00:41,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399979934] [2020-10-15 22:00:41,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:00:41,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 22:00:41,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625541518] [2020-10-15 22:00:41,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 22:00:41,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:00:41,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 22:00:41,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:00:41,917 INFO L87 Difference]: Start difference. First operand 226 states and 525 transitions. Second operand 6 states. [2020-10-15 22:00:41,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:00:41,975 INFO L93 Difference]: Finished difference Result 203 states and 477 transitions. [2020-10-15 22:00:41,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 22:00:41,976 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-15 22:00:41,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:00:41,977 INFO L225 Difference]: With dead ends: 203 [2020-10-15 22:00:41,978 INFO L226 Difference]: Without dead ends: 190 [2020-10-15 22:00:41,978 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:00:41,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-10-15 22:00:41,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2020-10-15 22:00:41,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-10-15 22:00:41,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 453 transitions. [2020-10-15 22:00:41,984 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 453 transitions. Word has length 17 [2020-10-15 22:00:41,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:00:41,984 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 453 transitions. [2020-10-15 22:00:41,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 22:00:41,984 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 453 transitions. [2020-10-15 22:00:41,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-15 22:00:41,986 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:00:41,986 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:00:41,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 22:00:41,986 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:00:41,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:00:41,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1617002823, now seen corresponding path program 1 times [2020-10-15 22:00:41,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:00:41,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739549747] [2020-10-15 22:00:41,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:00:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:00:42,277 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-15 22:00:42,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739549747] [2020-10-15 22:00:42,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:00:42,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 22:00:42,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190316911] [2020-10-15 22:00:42,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 22:00:42,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:00:42,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 22:00:42,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:00:42,281 INFO L87 Difference]: Start difference. First operand 190 states and 453 transitions. Second operand 7 states. [2020-10-15 22:00:42,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:00:42,443 INFO L93 Difference]: Finished difference Result 222 states and 514 transitions. [2020-10-15 22:00:42,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 22:00:42,444 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-15 22:00:42,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:00:42,445 INFO L225 Difference]: With dead ends: 222 [2020-10-15 22:00:42,445 INFO L226 Difference]: Without dead ends: 146 [2020-10-15 22:00:42,446 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-10-15 22:00:42,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-10-15 22:00:42,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2020-10-15 22:00:42,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-10-15 22:00:42,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 333 transitions. [2020-10-15 22:00:42,451 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 333 transitions. Word has length 21 [2020-10-15 22:00:42,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:00:42,451 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 333 transitions. [2020-10-15 22:00:42,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 22:00:42,451 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 333 transitions. [2020-10-15 22:00:42,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-15 22:00:42,452 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:00:42,452 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:00:42,453 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 22:00:42,454 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:00:42,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:00:42,454 INFO L82 PathProgramCache]: Analyzing trace with hash -100404701, now seen corresponding path program 2 times [2020-10-15 22:00:42,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:00:42,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533701753] [2020-10-15 22:00:42,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:00:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 22:00:42,558 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 22:00:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 22:00:42,606 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 22:00:42,648 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 22:00:42,648 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 22:00:42,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 22:00:42,649 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-15 22:00:42,675 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L2-->L840: Formula: (let ((.cse6 (= (mod ~z$w_buff0_used~0_In1162893969 256) 0)) (.cse7 (= (mod ~z$r_buff0_thd0~0_In1162893969 256) 0)) (.cse9 (= (mod ~z$w_buff1_used~0_In1162893969 256) 0)) (.cse8 (= (mod ~z$r_buff1_thd0~0_In1162893969 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse5 (or .cse6 .cse7)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (or (and .cse0 (= ~z$w_buff1_used~0_Out1162893969 0) .cse1) (and .cse2 (= ~z$w_buff1_used~0_Out1162893969 ~z$w_buff1_used~0_In1162893969))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1162893969 0)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1162893969 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1162893969|) (or (and (= ~z~0_Out1162893969 ~z$w_buff0~0_In1162893969) .cse3 .cse4) (and (or (and .cse0 (= ~z$w_buff1~0_In1162893969 ~z~0_Out1162893969) .cse1) (and (= ~z~0_In1162893969 ~z~0_Out1162893969) .cse2)) .cse5)) (= ~z$r_buff0_thd0~0_In1162893969 ~z$r_buff0_thd0~0_Out1162893969) (or (and .cse5 (= ~z$w_buff0_used~0_In1162893969 ~z$w_buff0_used~0_Out1162893969)) (and .cse3 (= ~z$w_buff0_used~0_Out1162893969 0) .cse4)) (= ~z$r_buff1_thd0~0_Out1162893969 ~z$r_buff1_thd0~0_In1162893969)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1162893969|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1162893969, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1162893969, ~z$w_buff0~0=~z$w_buff0~0_In1162893969, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1162893969, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1162893969, ~z$w_buff1~0=~z$w_buff1~0_In1162893969, ~z~0=~z~0_In1162893969} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out1162893969, ~z$w_buff0~0=~z$w_buff0~0_In1162893969, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1162893969, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1162893969|, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1162893969|, ~z$w_buff1~0=~z$w_buff1~0_In1162893969, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1162893969|, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1162893969|, ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1162893969|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1162893969|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out1162893969, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1162893969|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1162893969, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1162893969, ~z~0=~z~0_Out1162893969} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2020-10-15 22:00:42,685 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:00:42,686 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,696 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-15 22:00:42,697 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,697 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-15 22:00:42,697 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,697 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-15 22:00:42,698 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,699 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-15 22:00:42,699 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,700 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-15 22:00:42,700 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,701 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-15 22:00:42,701 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,701 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-15 22:00:42,701 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,702 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-15 22:00:42,702 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,702 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-15 22:00:42,703 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,703 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-15 22:00:42,703 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,703 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-15 22:00:42,703 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,703 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-15 22:00:42,704 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,704 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-15 22:00:42,704 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,705 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-15 22:00:42,705 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,705 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-15 22:00:42,705 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,705 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-15 22:00:42,705 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,705 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-15 22:00:42,706 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,710 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-15 22:00:42,710 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,710 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-15 22:00:42,710 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,711 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-15 22:00:42,711 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,711 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-15 22:00:42,711 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,711 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-15 22:00:42,711 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,711 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-15 22:00:42,712 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,712 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-15 22:00:42,712 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,712 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-15 22:00:42,712 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,713 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-15 22:00:42,713 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,713 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-15 22:00:42,713 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,713 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-15 22:00:42,713 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,713 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-15 22:00:42,714 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:00:42,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 10:00:42 BasicIcfg [2020-10-15 22:00:42,805 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 22:00:42,807 INFO L168 Benchmark]: Toolchain (without parser) took 9415.63 ms. Allocated memory was 248.5 MB in the beginning and 513.8 MB in the end (delta: 265.3 MB). Free memory was 203.9 MB in the beginning and 210.5 MB in the end (delta: -6.7 MB). Peak memory consumption was 258.6 MB. Max. memory is 14.2 GB. [2020-10-15 22:00:42,807 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 248.5 MB. Free memory is still 224.9 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 22:00:42,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 750.57 ms. Allocated memory was 248.5 MB in the beginning and 307.8 MB in the end (delta: 59.2 MB). Free memory was 203.9 MB in the beginning and 258.0 MB in the end (delta: -54.1 MB). Peak memory consumption was 33.2 MB. Max. memory is 14.2 GB. [2020-10-15 22:00:42,809 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.54 ms. Allocated memory is still 307.8 MB. Free memory was 258.0 MB in the beginning and 255.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.2 GB. [2020-10-15 22:00:42,809 INFO L168 Benchmark]: Boogie Preprocessor took 38.13 ms. Allocated memory is still 307.8 MB. Free memory was 255.3 MB in the beginning and 252.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 22:00:42,810 INFO L168 Benchmark]: RCFGBuilder took 2144.95 ms. Allocated memory was 307.8 MB in the beginning and 354.4 MB in the end (delta: 46.7 MB). Free memory was 252.8 MB in the beginning and 184.2 MB in the end (delta: 68.6 MB). Peak memory consumption was 115.3 MB. Max. memory is 14.2 GB. [2020-10-15 22:00:42,811 INFO L168 Benchmark]: TraceAbstraction took 6390.13 ms. Allocated memory was 354.4 MB in the beginning and 513.8 MB in the end (delta: 159.4 MB). Free memory was 184.2 MB in the beginning and 210.5 MB in the end (delta: -26.3 MB). Peak memory consumption was 133.1 MB. Max. memory is 14.2 GB. [2020-10-15 22:00:42,816 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.25 ms. Allocated memory is still 248.5 MB. Free memory is still 224.9 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 750.57 ms. Allocated memory was 248.5 MB in the beginning and 307.8 MB in the end (delta: 59.2 MB). Free memory was 203.9 MB in the beginning and 258.0 MB in the end (delta: -54.1 MB). Peak memory consumption was 33.2 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 85.54 ms. Allocated memory is still 307.8 MB. Free memory was 258.0 MB in the beginning and 255.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 38.13 ms. Allocated memory is still 307.8 MB. Free memory was 255.3 MB in the beginning and 252.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2144.95 ms. Allocated memory was 307.8 MB in the beginning and 354.4 MB in the end (delta: 46.7 MB). Free memory was 252.8 MB in the beginning and 184.2 MB in the end (delta: 68.6 MB). Peak memory consumption was 115.3 MB. Max. memory is 14.2 GB. * TraceAbstraction took 6390.13 ms. Allocated memory was 354.4 MB in the beginning and 513.8 MB in the end (delta: 159.4 MB). Free memory was 184.2 MB in the beginning and 210.5 MB in the end (delta: -26.3 MB). Peak memory consumption was 133.1 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1094 VarBasedMoverChecksPositive, 82 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 53 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 136 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.1s, 102 PlacesBefore, 36 PlacesAfterwards, 94 TransitionsBefore, 27 TransitionsAfterwards, 1650 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, 5350 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; [L704] 0 int __unbuffered_p2_EAX = 0; [L705] 0 _Bool main$tmp_guard0; [L706] 0 _Bool main$tmp_guard1; [L708] 0 int x = 0; [L710] 0 int y = 0; [L712] 0 int z = 0; [L713] 0 _Bool z$flush_delayed; [L714] 0 int z$mem_tmp; [L715] 0 _Bool z$r_buff0_thd0; [L716] 0 _Bool z$r_buff0_thd1; [L717] 0 _Bool z$r_buff0_thd2; [L718] 0 _Bool z$r_buff0_thd3; [L719] 0 _Bool z$r_buff1_thd0; [L720] 0 _Bool z$r_buff1_thd1; [L721] 0 _Bool z$r_buff1_thd2; [L722] 0 _Bool z$r_buff1_thd3; [L723] 0 _Bool z$read_delayed; [L724] 0 int *z$read_delayed_var; [L725] 0 int z$w_buff0; [L726] 0 _Bool z$w_buff0_used; [L727] 0 int z$w_buff1; [L728] 0 _Bool z$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L824] 0 pthread_t t1315; [L825] FCALL, FORK 0 pthread_create(&t1315, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$w_buff1 = z$w_buff0 [L735] 1 z$w_buff0 = 1 [L736] 1 z$w_buff1_used = z$w_buff0_used [L737] 1 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L739] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L740] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L741] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L742] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L743] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 0 pthread_t t1316; [L827] FCALL, FORK 0 pthread_create(&t1316, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 pthread_t t1317; [L829] FCALL, FORK 0 pthread_create(&t1317, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L769] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L770] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L770] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L771] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L771] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L772] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L772] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L773] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L773] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 2 return 0; [L783] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L794] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L794] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L795] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L795] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L795] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EAX = z [L798] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L798] 3 z = z$flush_delayed ? z$mem_tmp : z [L799] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L806] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L806] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L749] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L749] EXPR 1 z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z [L749] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L749] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L750] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L751] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L751] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L752] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L752] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L753] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L753] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L809] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L811] 3 return 0; [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 93 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.0s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 132 SDtfs, 177 SDslu, 279 SDs, 0 SdLazy, 143 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=824occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 6756 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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...