/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:46:15,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:46:15,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:46:15,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:46:15,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:46:15,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:46:15,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:46:15,281 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:46:15,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:46:15,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:46:15,288 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:46:15,289 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:46:15,290 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:46:15,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:46:15,293 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:46:15,294 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:46:15,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:46:15,298 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:46:15,302 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:46:15,305 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:46:15,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:46:15,311 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:46:15,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:46:15,314 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:46:15,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:46:15,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:46:15,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:46:15,327 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:46:15,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:46:15,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:46:15,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:46:15,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:46:15,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:46:15,335 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:46:15,336 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:46:15,336 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:46:15,337 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:46:15,337 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:46:15,338 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:46:15,339 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:46:15,340 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:46:15,341 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf [2020-10-16 04:46:15,384 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:46:15,385 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:46:15,386 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:46:15,386 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:46:15,387 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:46:15,387 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:46:15,387 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:46:15,388 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:46:15,388 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:46:15,388 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:46:15,389 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:46:15,389 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:46:15,390 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:46:15,390 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:46:15,391 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:46:15,391 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:46:15,391 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:46:15,391 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:46:15,391 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:46:15,391 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:46:15,392 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:46:15,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:46:15,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:46:15,392 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:46:15,392 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:46:15,393 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:46:15,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:46:15,393 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:46:15,393 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:46:15,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:46:15,706 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:46:15,710 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:46:15,712 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:46:15,712 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:46:15,713 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_pso.oepc.i [2020-10-16 04:46:15,790 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4cf9be2c/8c9023d55d1d4c92b60e9289dd3e9964/FLAG92bd94554 [2020-10-16 04:46:16,332 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:46:16,333 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_pso.oepc.i [2020-10-16 04:46:16,348 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4cf9be2c/8c9023d55d1d4c92b60e9289dd3e9964/FLAG92bd94554 [2020-10-16 04:46:16,624 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4cf9be2c/8c9023d55d1d4c92b60e9289dd3e9964 [2020-10-16 04:46:16,632 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:46:16,634 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:46:16,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:46:16,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:46:16,639 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:46:16,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:46:16" (1/1) ... [2020-10-16 04:46:16,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a9f05d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:46:16, skipping insertion in model container [2020-10-16 04:46:16,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:46:16" (1/1) ... [2020-10-16 04:46:16,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:46:16,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:46:17,185 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:46:17,198 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:46:17,266 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:46:17,366 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:46:17,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:46:17 WrapperNode [2020-10-16 04:46:17,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:46:17,369 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:46:17,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:46:17,370 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:46:17,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:46:17" (1/1) ... [2020-10-16 04:46:17,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:46:17" (1/1) ... [2020-10-16 04:46:17,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:46:17,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:46:17,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:46:17,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:46:17,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:46:17" (1/1) ... [2020-10-16 04:46:17,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:46:17" (1/1) ... [2020-10-16 04:46:17,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:46:17" (1/1) ... [2020-10-16 04:46:17,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:46:17" (1/1) ... [2020-10-16 04:46:17,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:46:17" (1/1) ... [2020-10-16 04:46:17,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:46:17" (1/1) ... [2020-10-16 04:46:17,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:46:17" (1/1) ... [2020-10-16 04:46:17,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:46:17,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:46:17,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:46:17,557 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:46:17,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:46:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:46:17,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:46:17,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:46:17,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:46:17,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:46:17,630 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:46:17,630 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:46:17,631 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:46:17,631 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:46:17,631 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 04:46:17,631 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 04:46:17,631 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 04:46:17,631 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 04:46:17,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:46:17,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:46:17,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:46:17,636 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 04:46:19,834 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:46:19,834 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:46:19,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:46:19 BoogieIcfgContainer [2020-10-16 04:46:19,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:46:19,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:46:19,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:46:19,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:46:19,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:46:16" (1/3) ... [2020-10-16 04:46:19,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39bb9f50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:46:19, skipping insertion in model container [2020-10-16 04:46:19,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:46:17" (2/3) ... [2020-10-16 04:46:19,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39bb9f50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:46:19, skipping insertion in model container [2020-10-16 04:46:19,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:46:19" (3/3) ... [2020-10-16 04:46:19,848 INFO L111 eAbstractionObserver]: Analyzing ICFG mix027_pso.oepc.i [2020-10-16 04:46:19,863 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:46:19,876 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:46:19,878 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:46:19,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,975 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,976 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,976 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,977 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,978 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,981 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,981 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,983 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,983 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,984 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,984 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,989 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,989 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,989 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,990 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,992 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,992 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,992 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,993 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,993 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,993 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,993 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,993 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,993 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,994 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,994 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,994 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,994 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,994 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,994 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,995 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,995 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,995 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,995 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,995 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,995 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,996 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,996 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,996 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,996 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,997 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,997 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,997 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,997 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,997 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,997 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,997 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:19,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,001 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,002 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,002 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,002 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,002 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,002 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,002 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,003 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,003 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,011 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,011 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,012 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,012 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,012 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,012 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,012 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,013 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,016 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,016 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,018 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,018 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,019 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,020 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,021 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,022 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,022 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,023 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,023 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,023 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,023 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,023 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,023 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,023 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,023 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,023 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,024 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,024 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,024 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,024 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,024 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,024 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,024 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,024 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,025 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,025 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,025 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,025 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,025 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,025 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,025 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,025 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,026 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,026 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,026 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,026 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,026 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,027 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,029 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,029 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,029 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:46:20,046 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 04:46:20,068 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:46:20,068 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:46:20,068 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:46:20,069 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:46:20,069 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:46:20,069 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:46:20,069 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:46:20,070 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:46:20,089 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2020-10-16 04:46:20,162 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-10-16 04:46:20,164 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:46:20,174 INFO L80 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 83 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2020-10-16 04:46:20,175 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 112 transitions, 244 flow [2020-10-16 04:46:20,187 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 108 transitions, 228 flow [2020-10-16 04:46:20,191 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:46:20,195 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 108 transitions, 228 flow [2020-10-16 04:46:20,199 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 108 transitions, 228 flow [2020-10-16 04:46:20,199 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 228 flow [2020-10-16 04:46:20,258 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-10-16 04:46:20,259 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:46:20,260 INFO L80 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 85 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2020-10-16 04:46:20,267 INFO L117 LiptonReduction]: Number of co-enabled transitions 2714 [2020-10-16 04:46:20,449 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:20,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:20,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:46:20,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:46:20,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:46:20,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:46:20,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:46:20,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:46:20,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:46:20,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:20,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:46:20,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:20,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:46:20,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:20,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:46:20,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:46:20,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:46:20,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:20,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:20,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:20,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:20,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:20,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:20,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:20,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:20,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:20,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:20,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:20,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:20,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:20,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:20,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:20,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:20,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:20,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:20,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:20,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:20,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:20,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:20,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:20,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:20,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:20,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:20,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:20,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:20,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:20,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:20,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:20,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:20,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:20,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:20,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:20,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:20,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:20,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:20,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:20,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:20,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:20,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:20,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:20,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:20,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:20,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:20,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:20,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:20,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:20,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:20,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:20,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:20,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:20,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:20,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:20,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:20,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:20,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:20,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:20,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:20,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:20,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:20,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:20,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:20,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:21,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:46:21,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:21,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:46:21,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:46:21,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:46:21,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:21,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:21,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:21,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:46:21,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:46:21,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:46:21,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:46:21,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:46:21,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:46:21,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:46:21,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:21,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:46:21,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:21,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:46:21,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:21,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:21,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:21,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:21,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:21,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:21,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:21,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:21,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:21,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:21,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:21,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:21,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:21,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:21,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:21,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:21,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:21,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:21,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:21,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:21,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:21,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:21,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:21,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:21,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:21,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:21,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:21,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:21,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:21,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:21,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:21,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:21,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:21,702 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 04:46:21,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:21,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:21,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:21,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:21,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:21,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:21,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:21,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:21,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:21,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:21,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:21,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:21,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:21,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:21,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:21,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:21,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:21,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:21,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:21,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:21,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:21,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:21,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:21,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:21,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:21,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:21,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:21,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:21,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:21,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:21,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:21,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:22,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:22,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:22,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:22,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:22,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:22,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:22,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:22,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:22,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:22,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:22,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:22,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:22,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:22,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:22,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:22,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:22,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:46:22,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:22,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:22,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:22,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:46:22,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:46:22,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:46:22,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:46:22,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:46:22,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:46:22,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:46:22,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:22,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:46:22,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:22,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:46:22,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:22,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:46:22,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:46:22,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:46:22,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:22,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:22,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:22,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:22,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:22,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:22,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:22,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:22,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:22,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:22,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:22,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:22,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:22,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:22,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:22,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:22,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:22,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:22,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:22,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:22,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:22,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:22,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:22,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:22,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:22,869 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:22,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:22,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:22,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:22,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:22,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:22,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:22,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:23,112 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 04:46:23,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:46:23,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:46:23,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:46:23,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:23,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:23,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:46:23,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:46:23,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:46:23,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:46:23,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:46:23,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:46:23,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:46:23,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:23,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:46:23,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:23,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:46:23,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:23,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:23,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:23,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:23,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:23,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:23,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:23,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:23,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:23,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:23,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:23,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:23,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:23,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:23,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:23,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:23,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:23,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:23,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:23,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:23,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:23,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:23,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:23,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:23,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:23,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:23,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:23,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:23,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:23,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:23,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:23,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:23,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:23,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:23,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:23,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:23,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:23,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,663 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:23,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:23,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:23,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:23,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:23,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:23,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:23,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:23,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:23,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:23,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:23,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:23,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:23,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:23,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:23,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:23,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:23,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:23,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:23,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:23,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:23,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:23,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:23,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:23,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:23,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:23,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:23,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:23,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:23,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:23,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:23,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:23,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:24,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:46:24,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:46:24,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:46:24,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:46:24,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:46:24,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:46:24,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:46:24,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:24,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:46:24,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:24,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:46:24,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:24,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:46:24,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:46:24,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:46:24,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:24,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:24,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:24,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:24,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:24,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:24,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:24,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:24,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:24,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:24,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:24,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:24,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:24,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:24,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:24,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:24,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:24,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:24,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:24,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:24,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:24,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:24,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:24,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:24,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:24,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:24,331 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,333 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:24,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:24,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:24,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:24,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:24,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:24,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:24,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:24,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:24,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:46:24,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:46:24,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:46:24,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:46:24,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:46:24,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:46:24,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:46:24,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:46:24,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:46:24,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:46:24,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:24,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:46:24,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:24,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:46:24,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:24,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:24,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:24,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:24,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:24,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:24,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:24,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:24,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:24,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:24,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:24,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:24,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:24,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:24,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:24,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:24,680 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:24,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,682 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:24,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:24,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:46:24,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:24,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:46:24,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:46:24,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:24,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:46:24,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:46:25,416 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2020-10-16 04:46:25,546 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-16 04:46:25,662 INFO L132 LiptonReduction]: Checked pairs total: 7634 [2020-10-16 04:46:25,662 INFO L134 LiptonReduction]: Total number of compositions: 87 [2020-10-16 04:46:25,666 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5478 [2020-10-16 04:46:25,672 INFO L129 PetriNetUnfolder]: 0/4 cut-off events. [2020-10-16 04:46:25,672 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:46:25,672 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:25,673 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2020-10-16 04:46:25,673 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:25,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:25,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1191868, now seen corresponding path program 1 times [2020-10-16 04:46:25,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:25,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087859773] [2020-10-16 04:46:25,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:46:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:46:25,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087859773] [2020-10-16 04:46:25,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:46:25,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:46:25,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489419995] [2020-10-16 04:46:25,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:46:25,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:46:25,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:46:25,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:46:25,933 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 199 [2020-10-16 04:46:25,936 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand 3 states. [2020-10-16 04:46:25,936 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:46:25,936 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 199 [2020-10-16 04:46:25,938 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:46:26,089 INFO L129 PetriNetUnfolder]: 133/294 cut-off events. [2020-10-16 04:46:26,089 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:46:26,092 INFO L80 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 294 events. 133/294 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1584 event pairs, 29 based on Foata normal form. 0/275 useless extension candidates. Maximal degree in co-relation 502. Up to 153 conditions per place. [2020-10-16 04:46:26,096 INFO L132 encePairwiseOnDemand]: 196/199 looper letters, 11 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2020-10-16 04:46:26,096 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 34 transitions, 106 flow [2020-10-16 04:46:26,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:46:26,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:46:26,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2020-10-16 04:46:26,121 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8827470686767169 [2020-10-16 04:46:26,122 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 527 transitions. [2020-10-16 04:46:26,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 527 transitions. [2020-10-16 04:46:26,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:46:26,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 527 transitions. [2020-10-16 04:46:26,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:46:26,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:46:26,156 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:46:26,158 INFO L185 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 3 states and 527 transitions. [2020-10-16 04:46:26,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 34 transitions, 106 flow [2020-10-16 04:46:26,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 102 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 04:46:26,170 INFO L241 Difference]: Finished difference. Result has 40 places, 29 transitions, 70 flow [2020-10-16 04:46:26,173 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2020-10-16 04:46:26,174 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2020-10-16 04:46:26,174 INFO L481 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2020-10-16 04:46:26,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:46:26,174 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:26,174 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:46:26,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:46:26,175 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:26,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:26,175 INFO L82 PathProgramCache]: Analyzing trace with hash -327406856, now seen corresponding path program 1 times [2020-10-16 04:46:26,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:26,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984311494] [2020-10-16 04:46:26,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:46:26,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:46:26,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984311494] [2020-10-16 04:46:26,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:46:26,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:46:26,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027999025] [2020-10-16 04:46:26,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:46:26,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:46:26,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:46:26,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:46:26,304 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 199 [2020-10-16 04:46:26,305 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand 3 states. [2020-10-16 04:46:26,306 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:46:26,306 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 199 [2020-10-16 04:46:26,306 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:46:26,329 INFO L129 PetriNetUnfolder]: 7/51 cut-off events. [2020-10-16 04:46:26,329 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:46:26,330 INFO L80 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 51 events. 7/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 2 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 73. Up to 17 conditions per place. [2020-10-16 04:46:26,330 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 3 selfloop transitions, 3 changer transitions 2/32 dead transitions. [2020-10-16 04:46:26,330 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 32 transitions, 92 flow [2020-10-16 04:46:26,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:46:26,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:46:26,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 531 transitions. [2020-10-16 04:46:26,333 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8894472361809045 [2020-10-16 04:46:26,333 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 531 transitions. [2020-10-16 04:46:26,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 531 transitions. [2020-10-16 04:46:26,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:46:26,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 531 transitions. [2020-10-16 04:46:26,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:46:26,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:46:26,336 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:46:26,337 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 3 states and 531 transitions. [2020-10-16 04:46:26,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 32 transitions, 92 flow [2020-10-16 04:46:26,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 32 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:46:26,338 INFO L241 Difference]: Finished difference. Result has 41 places, 30 transitions, 83 flow [2020-10-16 04:46:26,338 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2020-10-16 04:46:26,339 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2020-10-16 04:46:26,339 INFO L481 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 83 flow [2020-10-16 04:46:26,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:46:26,339 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:26,340 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:46:26,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:46:26,340 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:26,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:26,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1436681530, now seen corresponding path program 1 times [2020-10-16 04:46:26,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:26,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594561229] [2020-10-16 04:46:26,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:46:26,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:46:26,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594561229] [2020-10-16 04:46:26,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:46:26,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:46:26,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435912726] [2020-10-16 04:46:26,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:46:26,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:46:26,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:46:26,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:46:26,415 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 199 [2020-10-16 04:46:26,415 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 83 flow. Second operand 3 states. [2020-10-16 04:46:26,415 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:46:26,415 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 199 [2020-10-16 04:46:26,416 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:46:26,427 INFO L129 PetriNetUnfolder]: 3/40 cut-off events. [2020-10-16 04:46:26,427 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2020-10-16 04:46:26,428 INFO L80 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 40 events. 3/40 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 83 event pairs, 1 based on Foata normal form. 1/39 useless extension candidates. Maximal degree in co-relation 59. Up to 10 conditions per place. [2020-10-16 04:46:26,428 INFO L132 encePairwiseOnDemand]: 196/199 looper letters, 1 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2020-10-16 04:46:26,428 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 30 transitions, 89 flow [2020-10-16 04:46:26,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:46:26,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:46:26,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2020-10-16 04:46:26,430 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.88107202680067 [2020-10-16 04:46:26,431 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 526 transitions. [2020-10-16 04:46:26,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 526 transitions. [2020-10-16 04:46:26,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:46:26,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 526 transitions. [2020-10-16 04:46:26,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:46:26,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:46:26,434 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:46:26,434 INFO L185 Difference]: Start difference. First operand has 41 places, 30 transitions, 83 flow. Second operand 3 states and 526 transitions. [2020-10-16 04:46:26,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 30 transitions, 89 flow [2020-10-16 04:46:26,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 30 transitions, 86 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:46:26,435 INFO L241 Difference]: Finished difference. Result has 42 places, 30 transitions, 88 flow [2020-10-16 04:46:26,435 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2020-10-16 04:46:26,436 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2020-10-16 04:46:26,436 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 88 flow [2020-10-16 04:46:26,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:46:26,436 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:26,436 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:46:26,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:46:26,437 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:26,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:26,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1966449418, now seen corresponding path program 1 times [2020-10-16 04:46:26,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:26,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925639197] [2020-10-16 04:46:26,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:46:26,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:46:26,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925639197] [2020-10-16 04:46:26,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:46:26,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:46:26,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729292347] [2020-10-16 04:46:26,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:46:26,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:46:26,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:46:26,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:46:26,535 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 199 [2020-10-16 04:46:26,536 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 88 flow. Second operand 4 states. [2020-10-16 04:46:26,536 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:46:26,536 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 199 [2020-10-16 04:46:26,536 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:46:26,607 INFO L129 PetriNetUnfolder]: 134/278 cut-off events. [2020-10-16 04:46:26,608 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-16 04:46:26,610 INFO L80 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 278 events. 134/278 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1372 event pairs, 21 based on Foata normal form. 20/267 useless extension candidates. Maximal degree in co-relation 556. Up to 116 conditions per place. [2020-10-16 04:46:26,612 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 10 selfloop transitions, 6 changer transitions 0/39 dead transitions. [2020-10-16 04:46:26,612 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 138 flow [2020-10-16 04:46:26,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:46:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:46:26,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 670 transitions. [2020-10-16 04:46:26,615 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8417085427135679 [2020-10-16 04:46:26,615 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 670 transitions. [2020-10-16 04:46:26,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 670 transitions. [2020-10-16 04:46:26,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:46:26,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 670 transitions. [2020-10-16 04:46:26,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:46:26,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:46:26,619 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:46:26,619 INFO L185 Difference]: Start difference. First operand has 42 places, 30 transitions, 88 flow. Second operand 4 states and 670 transitions. [2020-10-16 04:46:26,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 138 flow [2020-10-16 04:46:26,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:46:26,622 INFO L241 Difference]: Finished difference. Result has 45 places, 35 transitions, 130 flow [2020-10-16 04:46:26,622 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2020-10-16 04:46:26,622 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2020-10-16 04:46:26,622 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 130 flow [2020-10-16 04:46:26,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:46:26,623 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:26,623 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:46:26,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:46:26,623 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:26,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:26,623 INFO L82 PathProgramCache]: Analyzing trace with hash -2103778563, now seen corresponding path program 1 times [2020-10-16 04:46:26,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:26,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763704628] [2020-10-16 04:46:26,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:46:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:46:26,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763704628] [2020-10-16 04:46:26,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:46:26,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:46:26,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493807278] [2020-10-16 04:46:26,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:46:26,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:46:26,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:46:26,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:46:26,678 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 199 [2020-10-16 04:46:26,678 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 130 flow. Second operand 3 states. [2020-10-16 04:46:26,678 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:46:26,678 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 199 [2020-10-16 04:46:26,679 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:46:26,722 INFO L129 PetriNetUnfolder]: 129/281 cut-off events. [2020-10-16 04:46:26,723 INFO L130 PetriNetUnfolder]: For 150/200 co-relation queries the response was YES. [2020-10-16 04:46:26,724 INFO L80 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 281 events. 129/281 cut-off events. For 150/200 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1455 event pairs, 62 based on Foata normal form. 19/264 useless extension candidates. Maximal degree in co-relation 632. Up to 218 conditions per place. [2020-10-16 04:46:26,728 INFO L132 encePairwiseOnDemand]: 196/199 looper letters, 3 selfloop transitions, 3 changer transitions 1/35 dead transitions. [2020-10-16 04:46:26,728 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 35 transitions, 142 flow [2020-10-16 04:46:26,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:46:26,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:46:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2020-10-16 04:46:26,731 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8844221105527639 [2020-10-16 04:46:26,731 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 528 transitions. [2020-10-16 04:46:26,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 528 transitions. [2020-10-16 04:46:26,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:46:26,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 528 transitions. [2020-10-16 04:46:26,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:46:26,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:46:26,734 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:46:26,734 INFO L185 Difference]: Start difference. First operand has 45 places, 35 transitions, 130 flow. Second operand 3 states and 528 transitions. [2020-10-16 04:46:26,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 35 transitions, 142 flow [2020-10-16 04:46:26,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 35 transitions, 140 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:46:26,736 INFO L241 Difference]: Finished difference. Result has 47 places, 34 transitions, 135 flow [2020-10-16 04:46:26,737 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2020-10-16 04:46:26,737 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2020-10-16 04:46:26,737 INFO L481 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 135 flow [2020-10-16 04:46:26,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:46:26,737 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:26,737 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:46:26,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:46:26,738 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:26,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:26,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1337072210, now seen corresponding path program 1 times [2020-10-16 04:46:26,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:26,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611426960] [2020-10-16 04:46:26,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:46:26,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:46:26,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611426960] [2020-10-16 04:46:26,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:46:26,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:46:26,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809171700] [2020-10-16 04:46:26,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:46:26,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:46:26,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:46:26,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:46:26,825 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 199 [2020-10-16 04:46:26,825 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 135 flow. Second operand 5 states. [2020-10-16 04:46:26,826 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:46:26,826 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 199 [2020-10-16 04:46:26,826 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:46:26,914 INFO L129 PetriNetUnfolder]: 133/282 cut-off events. [2020-10-16 04:46:26,915 INFO L130 PetriNetUnfolder]: For 199/285 co-relation queries the response was YES. [2020-10-16 04:46:26,916 INFO L80 FinitePrefix]: Finished finitePrefix Result has 856 conditions, 282 events. 133/282 cut-off events. For 199/285 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1336 event pairs, 4 based on Foata normal form. 35/292 useless extension candidates. Maximal degree in co-relation 841. Up to 207 conditions per place. [2020-10-16 04:46:26,917 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 9 selfloop transitions, 10 changer transitions 1/43 dead transitions. [2020-10-16 04:46:26,918 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 211 flow [2020-10-16 04:46:26,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:46:26,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:46:26,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 837 transitions. [2020-10-16 04:46:26,921 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8412060301507538 [2020-10-16 04:46:26,921 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 837 transitions. [2020-10-16 04:46:26,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 837 transitions. [2020-10-16 04:46:26,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:46:26,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 837 transitions. [2020-10-16 04:46:26,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:46:26,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:46:26,926 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:46:26,926 INFO L185 Difference]: Start difference. First operand has 47 places, 34 transitions, 135 flow. Second operand 5 states and 837 transitions. [2020-10-16 04:46:26,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 211 flow [2020-10-16 04:46:26,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 43 transitions, 198 flow, removed 2 selfloop flow, removed 2 redundant places. [2020-10-16 04:46:26,929 INFO L241 Difference]: Finished difference. Result has 51 places, 38 transitions, 184 flow [2020-10-16 04:46:26,930 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2020-10-16 04:46:26,930 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2020-10-16 04:46:26,930 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 184 flow [2020-10-16 04:46:26,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:46:26,930 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:26,931 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:46:26,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:46:26,931 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:26,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:26,931 INFO L82 PathProgramCache]: Analyzing trace with hash -610680003, now seen corresponding path program 1 times [2020-10-16 04:46:26,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:26,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831626510] [2020-10-16 04:46:26,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:46:27,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:46:27,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831626510] [2020-10-16 04:46:27,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:46:27,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:46:27,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014141552] [2020-10-16 04:46:27,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:46:27,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:46:27,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:46:27,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:46:27,078 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 199 [2020-10-16 04:46:27,078 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 184 flow. Second operand 6 states. [2020-10-16 04:46:27,078 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:46:27,079 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 199 [2020-10-16 04:46:27,079 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:46:27,185 INFO L129 PetriNetUnfolder]: 71/174 cut-off events. [2020-10-16 04:46:27,185 INFO L130 PetriNetUnfolder]: For 309/460 co-relation queries the response was YES. [2020-10-16 04:46:27,186 INFO L80 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 174 events. 71/174 cut-off events. For 309/460 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 677 event pairs, 0 based on Foata normal form. 35/194 useless extension candidates. Maximal degree in co-relation 663. Up to 120 conditions per place. [2020-10-16 04:46:27,187 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 9 selfloop transitions, 14 changer transitions 1/47 dead transitions. [2020-10-16 04:46:27,187 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 47 transitions, 286 flow [2020-10-16 04:46:27,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:46:27,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:46:27,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1004 transitions. [2020-10-16 04:46:27,191 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8408710217755444 [2020-10-16 04:46:27,191 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1004 transitions. [2020-10-16 04:46:27,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1004 transitions. [2020-10-16 04:46:27,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:46:27,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1004 transitions. [2020-10-16 04:46:27,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:46:27,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:46:27,197 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:46:27,197 INFO L185 Difference]: Start difference. First operand has 51 places, 38 transitions, 184 flow. Second operand 6 states and 1004 transitions. [2020-10-16 04:46:27,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 47 transitions, 286 flow [2020-10-16 04:46:27,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 47 transitions, 256 flow, removed 5 selfloop flow, removed 4 redundant places. [2020-10-16 04:46:27,200 INFO L241 Difference]: Finished difference. Result has 54 places, 42 transitions, 234 flow [2020-10-16 04:46:27,201 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2020-10-16 04:46:27,201 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2020-10-16 04:46:27,201 INFO L481 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 234 flow [2020-10-16 04:46:27,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:46:27,201 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:27,201 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:46:27,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:46:27,202 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:27,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:27,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1427847416, now seen corresponding path program 1 times [2020-10-16 04:46:27,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:27,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451873096] [2020-10-16 04:46:27,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:46:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:46:27,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451873096] [2020-10-16 04:46:27,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:46:27,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:46:27,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167731957] [2020-10-16 04:46:27,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:46:27,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:46:27,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:46:27,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:46:27,394 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 199 [2020-10-16 04:46:27,395 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 234 flow. Second operand 7 states. [2020-10-16 04:46:27,395 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:46:27,396 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 199 [2020-10-16 04:46:27,396 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:46:27,488 INFO L129 PetriNetUnfolder]: 39/107 cut-off events. [2020-10-16 04:46:27,489 INFO L130 PetriNetUnfolder]: For 302/458 co-relation queries the response was YES. [2020-10-16 04:46:27,490 INFO L80 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 107 events. 39/107 cut-off events. For 302/458 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 317 event pairs, 0 based on Foata normal form. 27/121 useless extension candidates. Maximal degree in co-relation 457. Up to 65 conditions per place. [2020-10-16 04:46:27,490 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 1 selfloop transitions, 18 changer transitions 1/43 dead transitions. [2020-10-16 04:46:27,491 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 43 transitions, 280 flow [2020-10-16 04:46:27,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:46:27,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:46:27,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1163 transitions. [2020-10-16 04:46:27,495 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8348887293610912 [2020-10-16 04:46:27,495 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1163 transitions. [2020-10-16 04:46:27,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1163 transitions. [2020-10-16 04:46:27,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:46:27,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1163 transitions. [2020-10-16 04:46:27,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:46:27,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:46:27,501 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:46:27,501 INFO L185 Difference]: Start difference. First operand has 54 places, 42 transitions, 234 flow. Second operand 7 states and 1163 transitions. [2020-10-16 04:46:27,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 43 transitions, 280 flow [2020-10-16 04:46:27,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 228 flow, removed 11 selfloop flow, removed 6 redundant places. [2020-10-16 04:46:27,505 INFO L241 Difference]: Finished difference. Result has 56 places, 42 transitions, 238 flow [2020-10-16 04:46:27,505 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=238, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2020-10-16 04:46:27,505 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2020-10-16 04:46:27,506 INFO L481 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 238 flow [2020-10-16 04:46:27,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:46:27,506 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:27,506 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:46:27,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:46:27,506 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:27,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:27,507 INFO L82 PathProgramCache]: Analyzing trace with hash 487896151, now seen corresponding path program 1 times [2020-10-16 04:46:27,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:27,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135702005] [2020-10-16 04:46:27,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:46:27,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:46:27,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135702005] [2020-10-16 04:46:27,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:46:27,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:46:27,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244506591] [2020-10-16 04:46:27,574 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:46:27,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:46:27,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:46:27,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:46:27,575 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 199 [2020-10-16 04:46:27,576 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 238 flow. Second operand 4 states. [2020-10-16 04:46:27,576 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:46:27,576 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 199 [2020-10-16 04:46:27,576 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:46:27,610 INFO L129 PetriNetUnfolder]: 65/161 cut-off events. [2020-10-16 04:46:27,611 INFO L130 PetriNetUnfolder]: For 290/345 co-relation queries the response was YES. [2020-10-16 04:46:27,612 INFO L80 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 161 events. 65/161 cut-off events. For 290/345 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 616 event pairs, 0 based on Foata normal form. 1/136 useless extension candidates. Maximal degree in co-relation 588. Up to 69 conditions per place. [2020-10-16 04:46:27,612 INFO L132 encePairwiseOnDemand]: 196/199 looper letters, 3 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2020-10-16 04:46:27,613 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 43 transitions, 250 flow [2020-10-16 04:46:27,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:46:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:46:27,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 670 transitions. [2020-10-16 04:46:27,615 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8417085427135679 [2020-10-16 04:46:27,615 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 670 transitions. [2020-10-16 04:46:27,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 670 transitions. [2020-10-16 04:46:27,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:46:27,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 670 transitions. [2020-10-16 04:46:27,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:46:27,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:46:27,619 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:46:27,619 INFO L185 Difference]: Start difference. First operand has 56 places, 42 transitions, 238 flow. Second operand 4 states and 670 transitions. [2020-10-16 04:46:27,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 43 transitions, 250 flow [2020-10-16 04:46:27,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 43 transitions, 152 flow, removed 17 selfloop flow, removed 11 redundant places. [2020-10-16 04:46:27,623 INFO L241 Difference]: Finished difference. Result has 50 places, 41 transitions, 143 flow [2020-10-16 04:46:27,623 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2020-10-16 04:46:27,624 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2020-10-16 04:46:27,624 INFO L481 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 143 flow [2020-10-16 04:46:27,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:46:27,624 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:27,624 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:46:27,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:46:27,624 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:27,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:27,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1636082777, now seen corresponding path program 2 times [2020-10-16 04:46:27,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:27,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135229952] [2020-10-16 04:46:27,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:46:27,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:46:27,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135229952] [2020-10-16 04:46:27,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:46:27,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:46:27,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006604328] [2020-10-16 04:46:27,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 04:46:27,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:46:27,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 04:46:27,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-16 04:46:27,887 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 199 [2020-10-16 04:46:27,889 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 143 flow. Second operand 8 states. [2020-10-16 04:46:27,889 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:46:27,889 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 199 [2020-10-16 04:46:27,889 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:46:28,141 INFO L129 PetriNetUnfolder]: 194/438 cut-off events. [2020-10-16 04:46:28,141 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2020-10-16 04:46:28,143 INFO L80 FinitePrefix]: Finished finitePrefix Result has 889 conditions, 438 events. 194/438 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2504 event pairs, 5 based on Foata normal form. 1/408 useless extension candidates. Maximal degree in co-relation 875. Up to 116 conditions per place. [2020-10-16 04:46:28,145 INFO L132 encePairwiseOnDemand]: 193/199 looper letters, 13 selfloop transitions, 5 changer transitions 2/52 dead transitions. [2020-10-16 04:46:28,145 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 52 transitions, 205 flow [2020-10-16 04:46:28,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:46:28,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:46:28,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 994 transitions. [2020-10-16 04:46:28,149 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7135678391959799 [2020-10-16 04:46:28,149 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 994 transitions. [2020-10-16 04:46:28,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 994 transitions. [2020-10-16 04:46:28,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:46:28,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 994 transitions. [2020-10-16 04:46:28,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:46:28,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:46:28,155 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:46:28,155 INFO L185 Difference]: Start difference. First operand has 50 places, 41 transitions, 143 flow. Second operand 7 states and 994 transitions. [2020-10-16 04:46:28,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 52 transitions, 205 flow [2020-10-16 04:46:28,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 196 flow, removed 1 selfloop flow, removed 4 redundant places. [2020-10-16 04:46:28,157 INFO L241 Difference]: Finished difference. Result has 54 places, 42 transitions, 153 flow [2020-10-16 04:46:28,157 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=153, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2020-10-16 04:46:28,158 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2020-10-16 04:46:28,158 INFO L481 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 153 flow [2020-10-16 04:46:28,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 04:46:28,158 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:28,158 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:46:28,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:46:28,159 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:28,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:28,159 INFO L82 PathProgramCache]: Analyzing trace with hash 274843397, now seen corresponding path program 3 times [2020-10-16 04:46:28,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:28,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416137173] [2020-10-16 04:46:28,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:46:28,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:46:28,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416137173] [2020-10-16 04:46:28,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:46:28,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:46:28,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510928996] [2020-10-16 04:46:28,217 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:46:28,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:46:28,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:46:28,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:46:28,219 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 199 [2020-10-16 04:46:28,219 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 153 flow. Second operand 3 states. [2020-10-16 04:46:28,219 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:46:28,219 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 199 [2020-10-16 04:46:28,220 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:46:28,264 INFO L129 PetriNetUnfolder]: 138/306 cut-off events. [2020-10-16 04:46:28,265 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2020-10-16 04:46:28,266 INFO L80 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 306 events. 138/306 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 1556 event pairs, 0 based on Foata normal form. 1/261 useless extension candidates. Maximal degree in co-relation 597. Up to 102 conditions per place. [2020-10-16 04:46:28,267 INFO L132 encePairwiseOnDemand]: 196/199 looper letters, 3 selfloop transitions, 2 changer transitions 3/44 dead transitions. [2020-10-16 04:46:28,267 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 44 transitions, 171 flow [2020-10-16 04:46:28,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:46:28,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:46:28,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2020-10-16 04:46:28,269 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8726968174204355 [2020-10-16 04:46:28,270 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 521 transitions. [2020-10-16 04:46:28,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 521 transitions. [2020-10-16 04:46:28,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:46:28,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 521 transitions. [2020-10-16 04:46:28,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:46:28,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:46:28,273 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:46:28,273 INFO L185 Difference]: Start difference. First operand has 54 places, 42 transitions, 153 flow. Second operand 3 states and 521 transitions. [2020-10-16 04:46:28,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 44 transitions, 171 flow [2020-10-16 04:46:28,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 44 transitions, 163 flow, removed 1 selfloop flow, removed 4 redundant places. [2020-10-16 04:46:28,274 INFO L241 Difference]: Finished difference. Result has 52 places, 41 transitions, 147 flow [2020-10-16 04:46:28,275 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2020-10-16 04:46:28,275 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2020-10-16 04:46:28,275 INFO L481 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 147 flow [2020-10-16 04:46:28,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:46:28,275 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:46:28,276 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:46:28,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:46:28,276 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:46:28,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:46:28,276 INFO L82 PathProgramCache]: Analyzing trace with hash 46567605, now seen corresponding path program 4 times [2020-10-16 04:46:28,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:46:28,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950972642] [2020-10-16 04:46:28,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:46:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:46:28,336 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:46:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:46:28,395 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:46:28,435 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:46:28,435 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:46:28,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 04:46:28,437 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 04:46:28,457 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1152] [1152] L3-->L871: Formula: (let ((.cse8 (= (mod ~a$w_buff1_used~0_In-323545245 256) 0)) (.cse9 (= (mod ~a$r_buff1_thd0~0_In-323545245 256) 0)) (.cse7 (= (mod ~a$w_buff0_used~0_In-323545245 256) 0)) (.cse6 (= (mod ~a$r_buff0_thd0~0_In-323545245 256) 0))) (let ((.cse3 (not .cse6)) (.cse4 (not .cse7)) (.cse2 (or .cse8 .cse9)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse5 (or .cse6 .cse7))) (and (or (and .cse0 .cse1 (= ~a$w_buff1_used~0_Out-323545245 0)) (and (= ~a$w_buff1_used~0_In-323545245 ~a$w_buff1_used~0_Out-323545245) .cse2)) (or (and (= ~a$w_buff0_used~0_Out-323545245 0) .cse3 .cse4) (and .cse5 (= ~a$w_buff0_used~0_In-323545245 ~a$w_buff0_used~0_Out-323545245))) (= ~a$r_buff1_thd0~0_Out-323545245 ~a$r_buff1_thd0~0_In-323545245) (or (and (= ~a$w_buff0~0_In-323545245 ~a~0_Out-323545245) .cse3 .cse4) (and (or (and .cse2 (= ~a~0_In-323545245 ~a~0_Out-323545245)) (and .cse0 .cse1 (= ~a~0_Out-323545245 ~a$w_buff1~0_In-323545245))) .cse5)) (= ~a$r_buff0_thd0~0_In-323545245 ~a$r_buff0_thd0~0_Out-323545245) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In-323545245 0))))) InVars {~a~0=~a~0_In-323545245, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-323545245, ~a$w_buff1~0=~a$w_buff1~0_In-323545245, ~a$w_buff0~0=~a$w_buff0~0_In-323545245, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-323545245, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-323545245, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-323545245, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-323545245} OutVars{ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-323545245|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-323545245, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-323545245|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_Out-323545245, ULTIMATE.start_main_#t~ite54=|ULTIMATE.start_main_#t~ite54_Out-323545245|, ULTIMATE.start_main_#t~ite53=|ULTIMATE.start_main_#t~ite53_Out-323545245|, ULTIMATE.start_main_#t~ite56=|ULTIMATE.start_main_#t~ite56_Out-323545245|, ULTIMATE.start_main_#t~ite55=|ULTIMATE.start_main_#t~ite55_Out-323545245|, ~a~0=~a~0_Out-323545245, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-323545245, ~a$w_buff1~0=~a$w_buff1~0_In-323545245, ~a$w_buff0~0=~a$w_buff0~0_In-323545245, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-323545245, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-323545245} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite58, ~a$r_buff1_thd0~0, ~a$w_buff0_used~0, ULTIMATE.start_main_#t~ite57, ~a$r_buff0_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite55] because there is no mapped edge [2020-10-16 04:46:28,464 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,464 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,466 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,466 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,466 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,466 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,467 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,467 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,467 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,467 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,467 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,467 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,468 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,468 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,468 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,469 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,469 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,469 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,469 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,469 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,469 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,470 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,470 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,470 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,470 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,470 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,471 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,471 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,471 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,472 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,472 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,472 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,473 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,473 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,473 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,474 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,474 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,475 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,475 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,475 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,475 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,475 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,476 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,476 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,476 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,476 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,477 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,477 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,477 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,477 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,477 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,477 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,477 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,478 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:46:28,478 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:46:28,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:46:28 BasicIcfg [2020-10-16 04:46:28,563 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:46:28,565 INFO L168 Benchmark]: Toolchain (without parser) took 11931.01 ms. Allocated memory was 252.2 MB in the beginning and 577.2 MB in the end (delta: 325.1 MB). Free memory was 204.2 MB in the beginning and 261.7 MB in the end (delta: -57.5 MB). Peak memory consumption was 267.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:46:28,566 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 252.2 MB. Free memory is still 226.0 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:46:28,567 INFO L168 Benchmark]: CACSL2BoogieTranslator took 733.45 ms. Allocated memory was 252.2 MB in the beginning and 318.2 MB in the end (delta: 66.1 MB). Free memory was 204.2 MB in the beginning and 268.5 MB in the end (delta: -64.3 MB). Peak memory consumption was 30.7 MB. Max. memory is 14.2 GB. [2020-10-16 04:46:28,567 INFO L168 Benchmark]: Boogie Procedure Inliner took 119.20 ms. Allocated memory is still 318.2 MB. Free memory was 268.5 MB in the beginning and 266.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:46:28,568 INFO L168 Benchmark]: Boogie Preprocessor took 67.23 ms. Allocated memory is still 318.2 MB. Free memory was 266.0 MB in the beginning and 263.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:46:28,574 INFO L168 Benchmark]: RCFGBuilder took 2281.34 ms. Allocated memory was 318.2 MB in the beginning and 360.2 MB in the end (delta: 41.9 MB). Free memory was 263.4 MB in the beginning and 165.1 MB in the end (delta: 98.3 MB). Peak memory consumption was 140.3 MB. Max. memory is 14.2 GB. [2020-10-16 04:46:28,574 INFO L168 Benchmark]: TraceAbstraction took 8723.33 ms. Allocated memory was 360.2 MB in the beginning and 577.2 MB in the end (delta: 217.1 MB). Free memory was 165.1 MB in the beginning and 261.7 MB in the end (delta: -96.6 MB). Peak memory consumption was 120.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:46:28,583 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.49 ms. Allocated memory is still 252.2 MB. Free memory is still 226.0 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 733.45 ms. Allocated memory was 252.2 MB in the beginning and 318.2 MB in the end (delta: 66.1 MB). Free memory was 204.2 MB in the beginning and 268.5 MB in the end (delta: -64.3 MB). Peak memory consumption was 30.7 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 119.20 ms. Allocated memory is still 318.2 MB. Free memory was 268.5 MB in the beginning and 266.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 67.23 ms. Allocated memory is still 318.2 MB. Free memory was 266.0 MB in the beginning and 263.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2281.34 ms. Allocated memory was 318.2 MB in the beginning and 360.2 MB in the end (delta: 41.9 MB). Free memory was 263.4 MB in the beginning and 165.1 MB in the end (delta: 98.3 MB). Peak memory consumption was 140.3 MB. Max. memory is 14.2 GB. * TraceAbstraction took 8723.33 ms. Allocated memory was 360.2 MB in the beginning and 577.2 MB in the end (delta: 217.1 MB). Free memory was 165.1 MB in the beginning and 261.7 MB in the end (delta: -96.6 MB). Peak memory consumption was 120.5 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1735 VarBasedMoverChecksPositive, 114 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 97 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.3s, 219 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.4s, 119 PlacesBefore, 43 PlacesAfterwards, 108 TransitionsBefore, 30 TransitionsAfterwards, 2714 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 87 TotalNumberOfCompositions, 7634 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p1_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int __unbuffered_p3_EBX = 0; [L707] 0 int a = 0; [L708] 0 _Bool a$flush_delayed; [L709] 0 int a$mem_tmp; [L710] 0 _Bool a$r_buff0_thd0; [L711] 0 _Bool a$r_buff0_thd1; [L712] 0 _Bool a$r_buff0_thd2; [L713] 0 _Bool a$r_buff0_thd3; [L714] 0 _Bool a$r_buff0_thd4; [L715] 0 _Bool a$r_buff1_thd0; [L716] 0 _Bool a$r_buff1_thd1; [L717] 0 _Bool a$r_buff1_thd2; [L718] 0 _Bool a$r_buff1_thd3; [L719] 0 _Bool a$r_buff1_thd4; [L720] 0 _Bool a$read_delayed; [L721] 0 int *a$read_delayed_var; [L722] 0 int a$w_buff0; [L723] 0 _Bool a$w_buff0_used; [L724] 0 int a$w_buff1; [L725] 0 _Bool a$w_buff1_used; [L726] 0 _Bool main$tmp_guard0; [L727] 0 _Bool main$tmp_guard1; [L729] 0 int x = 0; [L731] 0 int y = 0; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L853] 0 pthread_t t721; [L854] FCALL, FORK 0 pthread_create(&t721, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L855] 0 pthread_t t722; [L856] FCALL, FORK 0 pthread_create(&t722, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t723; [L858] FCALL, FORK 0 pthread_create(&t723, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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] [L859] 0 pthread_t t724; [L860] FCALL, FORK 0 pthread_create(&t724, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L739] 1 a$w_buff1 = a$w_buff0 [L740] 1 a$w_buff0 = 1 [L741] 1 a$w_buff1_used = a$w_buff0_used [L742] 1 a$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L744] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L745] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L746] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L747] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L748] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L749] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L769] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L789] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L809] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L812] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L815] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 4 a$flush_delayed = weak$$choice2 [L818] 4 a$mem_tmp = a [L819] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L819] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L820] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L820] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L820] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0 [L820] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L820] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L820] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L821] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L821] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L822] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L822] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L823] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L823] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L824] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L824] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L824] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L824] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L824] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L825] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L825] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L826] 4 __unbuffered_p3_EBX = a [L827] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L827] 4 a = a$flush_delayed ? a$mem_tmp : a [L828] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=1, z=2] [L755] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L755] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L756] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L756] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L757] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L757] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L758] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L758] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L759] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L759] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L795] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L795] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L795] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L795] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L796] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L796] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L797] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L797] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L798] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L798] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L799] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L799] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L775] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L775] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L776] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L776] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L777] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L777] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L778] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L778] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L779] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L779] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 2 return 0; [L802] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 3 return 0; [L831] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L831] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L832] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L832] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L833] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L833] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L834] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L834] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L835] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L835] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L838] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 4 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=1, z=2] [L873] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 111 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 8.3s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 36 SDtfs, 18 SDslu, 27 SDs, 0 SdLazy, 202 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=238occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 19341 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...