/usr/bin/java -Xmx8000000000 -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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix029_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 22:41:05,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 22:41:05,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 22:41:05,062 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 22:41:05,062 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 22:41:05,063 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 22:41:05,065 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 22:41:05,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 22:41:05,069 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 22:41:05,070 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 22:41:05,071 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 22:41:05,072 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 22:41:05,072 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 22:41:05,073 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 22:41:05,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 22:41:05,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 22:41:05,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 22:41:05,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 22:41:05,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 22:41:05,082 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 22:41:05,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 22:41:05,085 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 22:41:05,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 22:41:05,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 22:41:05,090 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 22:41:05,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 22:41:05,090 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 22:41:05,091 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 22:41:05,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 22:41:05,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 22:41:05,093 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 22:41:05,094 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 22:41:05,095 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 22:41:05,096 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 22:41:05,097 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 22:41:05,097 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 22:41:05,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 22:41:05,098 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 22:41:05,098 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 22:41:05,099 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 22:41:05,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 22:41:05,101 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-05 22:41:05,124 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 22:41:05,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 22:41:05,126 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 22:41:05,126 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 22:41:05,126 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 22:41:05,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 22:41:05,126 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 22:41:05,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 22:41:05,127 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 22:41:05,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 22:41:05,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 22:41:05,127 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 22:41:05,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 22:41:05,128 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 22:41:05,128 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 22:41:05,128 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 22:41:05,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 22:41:05,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 22:41:05,129 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 22:41:05,129 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 22:41:05,129 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 22:41:05,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 22:41:05,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 22:41:05,130 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-05 22:41:05,130 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 22:41:05,130 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 22:41:05,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 22:41:05,131 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 22:41:05,131 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-05 22:41:05,131 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-05 22:41:05,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 22:41:05,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 22:41:05,435 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 22:41:05,436 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 22:41:05,437 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 22:41:05,438 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_tso.oepc.i [2020-10-05 22:41:05,516 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bbffc871/fdfa9aa3034e4970a6006946289b8e92/FLAGe7df38f49 [2020-10-05 22:41:06,093 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 22:41:06,094 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_tso.oepc.i [2020-10-05 22:41:06,111 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bbffc871/fdfa9aa3034e4970a6006946289b8e92/FLAGe7df38f49 [2020-10-05 22:41:06,350 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bbffc871/fdfa9aa3034e4970a6006946289b8e92 [2020-10-05 22:41:06,359 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 22:41:06,361 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 22:41:06,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 22:41:06,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 22:41:06,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 22:41:06,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:41:06" (1/1) ... [2020-10-05 22:41:06,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600eb3c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:06, skipping insertion in model container [2020-10-05 22:41:06,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:41:06" (1/1) ... [2020-10-05 22:41:06,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 22:41:06,456 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 22:41:06,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 22:41:06,951 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 22:41:07,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 22:41:07,123 INFO L208 MainTranslator]: Completed translation [2020-10-05 22:41:07,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:07 WrapperNode [2020-10-05 22:41:07,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 22:41:07,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 22:41:07,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 22:41:07,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 22:41:07,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:07" (1/1) ... [2020-10-05 22:41:07,163 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:07" (1/1) ... [2020-10-05 22:41:07,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 22:41:07,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 22:41:07,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 22:41:07,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 22:41:07,206 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:07" (1/1) ... [2020-10-05 22:41:07,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:07" (1/1) ... [2020-10-05 22:41:07,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:07" (1/1) ... [2020-10-05 22:41:07,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:07" (1/1) ... [2020-10-05 22:41:07,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:07" (1/1) ... [2020-10-05 22:41:07,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:07" (1/1) ... [2020-10-05 22:41:07,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:07" (1/1) ... [2020-10-05 22:41:07,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 22:41:07,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 22:41:07,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 22:41:07,242 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 22:41:07,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:07" (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-05 22:41:07,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 22:41:07,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 22:41:07,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 22:41:07,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 22:41:07,320 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 22:41:07,320 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 22:41:07,320 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 22:41:07,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 22:41:07,321 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 22:41:07,322 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 22:41:07,322 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-05 22:41:07,322 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-05 22:41:07,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 22:41:07,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 22:41:07,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 22:41:07,326 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 22:41:09,553 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 22:41:09,553 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 22:41:09,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:41:09 BoogieIcfgContainer [2020-10-05 22:41:09,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 22:41:09,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 22:41:09,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 22:41:09,561 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 22:41:09,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 10:41:06" (1/3) ... [2020-10-05 22:41:09,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e406daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:41:09, skipping insertion in model container [2020-10-05 22:41:09,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:07" (2/3) ... [2020-10-05 22:41:09,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e406daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:41:09, skipping insertion in model container [2020-10-05 22:41:09,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:41:09" (3/3) ... [2020-10-05 22:41:09,565 INFO L109 eAbstractionObserver]: Analyzing ICFG mix029_tso.oepc.i [2020-10-05 22:41:09,576 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 22:41:09,577 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-05 22:41:09,586 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 22:41:09,587 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 22:41:09,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,626 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,626 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,627 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,627 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,630 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,631 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,631 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,631 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,631 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,632 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,632 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,632 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,632 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,632 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,633 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,633 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,633 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,634 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,634 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,637 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,637 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,637 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,637 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,638 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,638 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,638 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,638 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,638 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,638 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,644 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,644 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,644 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,644 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,646 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,646 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,653 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,653 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,658 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,658 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,658 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,659 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,659 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,665 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,666 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,666 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,666 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,666 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,666 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,670 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,670 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,670 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,670 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,670 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,671 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,671 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,671 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,671 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,671 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,672 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,672 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,672 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,672 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,672 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,675 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,675 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,675 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,675 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,675 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,676 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,676 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,676 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,676 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,676 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:09,694 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-05 22:41:09,718 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 22:41:09,718 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 22:41:09,718 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-05 22:41:09,719 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 22:41:09,719 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 22:41:09,719 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 22:41:09,719 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 22:41:09,719 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 22:41:09,738 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 112 transitions, 244 flow [2020-10-05 22:41:09,741 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2020-10-05 22:41:09,797 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-10-05 22:41:09,798 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 22:41:09,807 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-05 22:41:09,811 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2020-10-05 22:41:09,834 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-10-05 22:41:09,835 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 22:41:09,836 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-05 22:41:09,839 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2714 [2020-10-05 22:41:09,840 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-10-05 22:41:09,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:09,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:10,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:41:10,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:10,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:41:10,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:10,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:41:10,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:10,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:41:10,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:10,064 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-05 22:41:10,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:10,068 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-05 22:41:10,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:10,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:41:10,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:41:10,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:41:10,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:10,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:10,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:10,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:10,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:10,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:10,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:10,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:10,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:10,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:10,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:10,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:10,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:10,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:10,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:10,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:10,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:10,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:10,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:10,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:10,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:10,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:10,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:10,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:10,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:10,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:10,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:10,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:10,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:10,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:10,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:10,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:10,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:10,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:10,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:10,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:10,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:10,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:10,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:10,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:10,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:10,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:10,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:10,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:10,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:10,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:10,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:10,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:10,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:10,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:10,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:10,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:10,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:10,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:10,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:10,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:10,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:10,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:10,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:10,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:10,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:10,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:10,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:10,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:10,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:10,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-05 22:41:10,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:10,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:41:10,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:41:10,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:41:10,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:10,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:10,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:10,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:41:10,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:10,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:41:10,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:10,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:41:10,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:10,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:41:10,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:10,897 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-05 22:41:10,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:10,900 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-05 22:41:10,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:10,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:10,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:10,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:10,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:10,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:10,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:10,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:10,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:10,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:10,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:10,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:10,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:10,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:10,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:10,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:10,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:11,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:11,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:11,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:11,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:11,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:11,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:11,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:11,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:11,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:11,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:11,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:11,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:11,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:11,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:11,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:11,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:11,355 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-05 22:41:11,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:11,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:11,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:11,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:11,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:11,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:11,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:11,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:11,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:11,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:11,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:11,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:11,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:11,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:11,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:11,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:11,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:11,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:11,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:11,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:11,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:11,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:11,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:11,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:11,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:11,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:11,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:11,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:11,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:11,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:11,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:11,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:11,820 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-10-05 22:41:12,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:12,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:12,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:12,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:12,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:12,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:12,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:12,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:12,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:12,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:12,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:12,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:12,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:12,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:12,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:12,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:12,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-05 22:41:12,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:12,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:12,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:12,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:41:12,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:12,452 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:41:12,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:12,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:41:12,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:12,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:41:12,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:12,457 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-05 22:41:12,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:12,459 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-05 22:41:12,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:12,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:41:12,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:41:12,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:41:12,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:12,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:12,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:12,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:12,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:12,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:12,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:12,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:12,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:12,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:12,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:12,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:12,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:12,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:12,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:12,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:12,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:12,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:12,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:12,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:12,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:12,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:12,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:12,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:12,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:12,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:12,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:12,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:12,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:12,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:12,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:12,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:12,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:12,727 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-05 22:41:12,830 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-05 22:41:12,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:41:12,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:41:12,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:41:12,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:12,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:12,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:12,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:41:12,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:12,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:41:12,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:12,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:41:12,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:12,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:41:12,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:12,943 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-05 22:41:12,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:12,945 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-05 22:41:12,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:13,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:13,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:13,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:13,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:13,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:13,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:13,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:13,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:13,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:13,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:13,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:13,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:13,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:13,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:13,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,374 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:13,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:13,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:13,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:13,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:13,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:13,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:13,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:13,446 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:13,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:13,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:13,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:13,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:13,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:13,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:13,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:13,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:13,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:13,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:13,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:13,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:13,548 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:13,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:13,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:13,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:13,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:13,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:13,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:13,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:13,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:41:13,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:13,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:41:13,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:13,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:41:13,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:13,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:41:13,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:13,847 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-05 22:41:13,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:13,848 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-05 22:41:13,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:13,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:41:13,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:41:13,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:41:13,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:13,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:13,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:13,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:13,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:13,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:13,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:13,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:13,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:13,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:13,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:13,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:13,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:14,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:14,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:14,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:14,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:14,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:14,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:14,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:14,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:14,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:14,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:14,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:14,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:14,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:14,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:14,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:14,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:14,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:14,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:14,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:14,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:14,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:14,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:14,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:14,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:14,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:41:14,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:41:14,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:41:14,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,218 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:41:14,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:14,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:41:14,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:14,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:41:14,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:14,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:41:14,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:14,225 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-05 22:41:14,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:14,226 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-05 22:41:14,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:14,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:14,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:14,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:14,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:14,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:14,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:14,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:14,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:14,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:14,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:14,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:14,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:14,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:14,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:14,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:14,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:14,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,401 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:14,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:14,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:14,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:14,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:14,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:14,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:14,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:14,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:15,075 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2020-10-05 22:41:15,207 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-05 22:41:15,318 INFO L206 etLargeBlockEncoding]: Checked pairs total: 7454 [2020-10-05 22:41:15,318 INFO L214 etLargeBlockEncoding]: Total number of compositions: 85 [2020-10-05 22:41:15,322 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 34 transitions, 88 flow [2020-10-05 22:41:15,621 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4874 states. [2020-10-05 22:41:15,623 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states. [2020-10-05 22:41:15,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 22:41:15,630 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:41:15,631 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 22:41:15,631 INFO L427 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-05 22:41:15,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:41:15,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1191868, now seen corresponding path program 1 times [2020-10-05 22:41:15,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:41:15,649 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964802723] [2020-10-05 22:41:15,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:41:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:41:15,909 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-05 22:41:15,910 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964802723] [2020-10-05 22:41:15,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:41:15,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 22:41:15,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124065788] [2020-10-05 22:41:15,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 22:41:15,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:41:15,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 22:41:15,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:41:15,937 INFO L87 Difference]: Start difference. First operand 4874 states. Second operand 3 states. [2020-10-05 22:41:16,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:41:16,084 INFO L93 Difference]: Finished difference Result 4062 states and 16125 transitions. [2020-10-05 22:41:16,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 22:41:16,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 22:41:16,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:41:16,142 INFO L225 Difference]: With dead ends: 4062 [2020-10-05 22:41:16,142 INFO L226 Difference]: Without dead ends: 3312 [2020-10-05 22:41:16,143 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:41:16,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2020-10-05 22:41:16,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3312. [2020-10-05 22:41:16,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3312 states. [2020-10-05 22:41:16,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 12950 transitions. [2020-10-05 22:41:16,381 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 12950 transitions. Word has length 3 [2020-10-05 22:41:16,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:41:16,382 INFO L479 AbstractCegarLoop]: Abstraction has 3312 states and 12950 transitions. [2020-10-05 22:41:16,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 22:41:16,382 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 12950 transitions. [2020-10-05 22:41:16,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 22:41:16,385 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:41:16,386 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:41:16,386 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 22:41:16,386 INFO L427 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-05 22:41:16,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:41:16,386 INFO L82 PathProgramCache]: Analyzing trace with hash -327406856, now seen corresponding path program 1 times [2020-10-05 22:41:16,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:41:16,387 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348615783] [2020-10-05 22:41:16,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:41:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:41:16,476 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-05 22:41:16,476 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348615783] [2020-10-05 22:41:16,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:41:16,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 22:41:16,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508597600] [2020-10-05 22:41:16,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 22:41:16,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:41:16,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 22:41:16,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:41:16,479 INFO L87 Difference]: Start difference. First operand 3312 states and 12950 transitions. Second operand 3 states. [2020-10-05 22:41:16,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:41:16,522 INFO L93 Difference]: Finished difference Result 3262 states and 12720 transitions. [2020-10-05 22:41:16,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 22:41:16,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-05 22:41:16,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:41:16,552 INFO L225 Difference]: With dead ends: 3262 [2020-10-05 22:41:16,552 INFO L226 Difference]: Without dead ends: 3262 [2020-10-05 22:41:16,553 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:41:16,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2020-10-05 22:41:16,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3262. [2020-10-05 22:41:16,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2020-10-05 22:41:16,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 12720 transitions. [2020-10-05 22:41:16,791 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 12720 transitions. Word has length 11 [2020-10-05 22:41:16,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:41:16,793 INFO L479 AbstractCegarLoop]: Abstraction has 3262 states and 12720 transitions. [2020-10-05 22:41:16,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 22:41:16,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 12720 transitions. [2020-10-05 22:41:16,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 22:41:16,796 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:41:16,797 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:41:16,797 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 22:41:16,797 INFO L427 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-05 22:41:16,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:41:16,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1559477982, now seen corresponding path program 1 times [2020-10-05 22:41:16,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:41:16,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560631660] [2020-10-05 22:41:16,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:41:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:41:16,883 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-05 22:41:16,883 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560631660] [2020-10-05 22:41:16,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:41:16,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 22:41:16,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460183045] [2020-10-05 22:41:16,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 22:41:16,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:41:16,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 22:41:16,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:41:16,885 INFO L87 Difference]: Start difference. First operand 3262 states and 12720 transitions. Second operand 3 states. [2020-10-05 22:41:16,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:41:16,920 INFO L93 Difference]: Finished difference Result 3062 states and 11850 transitions. [2020-10-05 22:41:16,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 22:41:16,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-05 22:41:16,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:41:16,948 INFO L225 Difference]: With dead ends: 3062 [2020-10-05 22:41:16,948 INFO L226 Difference]: Without dead ends: 3062 [2020-10-05 22:41:16,948 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:41:16,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2020-10-05 22:41:17,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 3062. [2020-10-05 22:41:17,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3062 states. [2020-10-05 22:41:17,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 11850 transitions. [2020-10-05 22:41:17,061 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 11850 transitions. Word has length 12 [2020-10-05 22:41:17,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:41:17,062 INFO L479 AbstractCegarLoop]: Abstraction has 3062 states and 11850 transitions. [2020-10-05 22:41:17,062 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 22:41:17,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 11850 transitions. [2020-10-05 22:41:17,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 22:41:17,065 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:41:17,065 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:41:17,065 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 22:41:17,065 INFO L427 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-05 22:41:17,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:41:17,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1100407192, now seen corresponding path program 1 times [2020-10-05 22:41:17,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:41:17,066 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71473639] [2020-10-05 22:41:17,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:41:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:41:17,110 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-05 22:41:17,111 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71473639] [2020-10-05 22:41:17,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:41:17,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 22:41:17,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289185679] [2020-10-05 22:41:17,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 22:41:17,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:41:17,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 22:41:17,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:41:17,113 INFO L87 Difference]: Start difference. First operand 3062 states and 11850 transitions. Second operand 3 states. [2020-10-05 22:41:17,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:41:17,158 INFO L93 Difference]: Finished difference Result 3022 states and 11668 transitions. [2020-10-05 22:41:17,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 22:41:17,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-05 22:41:17,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:41:17,204 INFO L225 Difference]: With dead ends: 3022 [2020-10-05 22:41:17,204 INFO L226 Difference]: Without dead ends: 3022 [2020-10-05 22:41:17,205 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:41:17,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2020-10-05 22:41:17,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 3022. [2020-10-05 22:41:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3022 states. [2020-10-05 22:41:17,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 11668 transitions. [2020-10-05 22:41:17,315 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 11668 transitions. Word has length 13 [2020-10-05 22:41:17,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:41:17,315 INFO L479 AbstractCegarLoop]: Abstraction has 3022 states and 11668 transitions. [2020-10-05 22:41:17,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 22:41:17,316 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 11668 transitions. [2020-10-05 22:41:17,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 22:41:17,319 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:41:17,319 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:41:17,319 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 22:41:17,319 INFO L427 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-05 22:41:17,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:41:17,319 INFO L82 PathProgramCache]: Analyzing trace with hash 854550182, now seen corresponding path program 1 times [2020-10-05 22:41:17,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:41:17,320 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757813288] [2020-10-05 22:41:17,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:41:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:41:17,433 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-05 22:41:17,434 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757813288] [2020-10-05 22:41:17,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:41:17,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 22:41:17,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251083745] [2020-10-05 22:41:17,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:41:17,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:41:17,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:41:17,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:41:17,438 INFO L87 Difference]: Start difference. First operand 3022 states and 11668 transitions. Second operand 4 states. [2020-10-05 22:41:17,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:41:17,497 INFO L93 Difference]: Finished difference Result 2964 states and 10373 transitions. [2020-10-05 22:41:17,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 22:41:17,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-05 22:41:17,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:41:17,507 INFO L225 Difference]: With dead ends: 2964 [2020-10-05 22:41:17,507 INFO L226 Difference]: Without dead ends: 2214 [2020-10-05 22:41:17,508 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:41:17,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2020-10-05 22:41:17,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 2214. [2020-10-05 22:41:17,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2214 states. [2020-10-05 22:41:17,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 7628 transitions. [2020-10-05 22:41:17,573 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 7628 transitions. Word has length 14 [2020-10-05 22:41:17,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:41:17,573 INFO L479 AbstractCegarLoop]: Abstraction has 2214 states and 7628 transitions. [2020-10-05 22:41:17,573 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:41:17,573 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 7628 transitions. [2020-10-05 22:41:17,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 22:41:17,579 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:41:17,580 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:41:17,580 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 22:41:17,580 INFO L427 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-05 22:41:17,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:41:17,580 INFO L82 PathProgramCache]: Analyzing trace with hash 935604432, now seen corresponding path program 1 times [2020-10-05 22:41:17,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:41:17,581 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236554025] [2020-10-05 22:41:17,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:41:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:41:17,620 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-05 22:41:17,620 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236554025] [2020-10-05 22:41:17,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:41:17,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 22:41:17,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637977644] [2020-10-05 22:41:17,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 22:41:17,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:41:17,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 22:41:17,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:41:17,622 INFO L87 Difference]: Start difference. First operand 2214 states and 7628 transitions. Second operand 3 states. [2020-10-05 22:41:17,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:41:17,658 INFO L93 Difference]: Finished difference Result 3270 states and 11011 transitions. [2020-10-05 22:41:17,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 22:41:17,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-10-05 22:41:17,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:41:17,669 INFO L225 Difference]: With dead ends: 3270 [2020-10-05 22:41:17,669 INFO L226 Difference]: Without dead ends: 2310 [2020-10-05 22:41:17,670 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:41:17,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2020-10-05 22:41:17,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 2178. [2020-10-05 22:41:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2178 states. [2020-10-05 22:41:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 2178 states and 7215 transitions. [2020-10-05 22:41:17,735 INFO L78 Accepts]: Start accepts. Automaton has 2178 states and 7215 transitions. Word has length 17 [2020-10-05 22:41:17,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:41:17,736 INFO L479 AbstractCegarLoop]: Abstraction has 2178 states and 7215 transitions. [2020-10-05 22:41:17,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 22:41:17,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 7215 transitions. [2020-10-05 22:41:17,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 22:41:17,740 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:41:17,740 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:41:17,740 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 22:41:17,740 INFO L427 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-05 22:41:17,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:41:17,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1552882529, now seen corresponding path program 1 times [2020-10-05 22:41:17,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:41:17,741 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295971855] [2020-10-05 22:41:17,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:41:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:41:17,874 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-05 22:41:17,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295971855] [2020-10-05 22:41:17,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:41:17,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 22:41:17,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718027871] [2020-10-05 22:41:17,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 22:41:17,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:41:17,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 22:41:17,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:41:17,876 INFO L87 Difference]: Start difference. First operand 2178 states and 7215 transitions. Second operand 5 states. [2020-10-05 22:41:17,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:41:17,935 INFO L93 Difference]: Finished difference Result 1832 states and 5594 transitions. [2020-10-05 22:41:17,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:41:17,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 22:41:17,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:41:17,941 INFO L225 Difference]: With dead ends: 1832 [2020-10-05 22:41:17,941 INFO L226 Difference]: Without dead ends: 1402 [2020-10-05 22:41:17,942 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:41:17,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-10-05 22:41:17,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402. [2020-10-05 22:41:17,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2020-10-05 22:41:17,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 4205 transitions. [2020-10-05 22:41:17,981 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 4205 transitions. Word has length 17 [2020-10-05 22:41:17,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:41:17,981 INFO L479 AbstractCegarLoop]: Abstraction has 1402 states and 4205 transitions. [2020-10-05 22:41:17,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 22:41:17,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 4205 transitions. [2020-10-05 22:41:17,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-05 22:41:17,985 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:41:17,985 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:41:17,985 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 22:41:17,986 INFO L427 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-05 22:41:17,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:41:17,986 INFO L82 PathProgramCache]: Analyzing trace with hash -2019689364, now seen corresponding path program 1 times [2020-10-05 22:41:17,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:41:17,986 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211326663] [2020-10-05 22:41:17,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:41:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:41:18,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:41:18,099 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211326663] [2020-10-05 22:41:18,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:41:18,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:41:18,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106043054] [2020-10-05 22:41:18,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 22:41:18,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:41:18,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 22:41:18,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:41:18,102 INFO L87 Difference]: Start difference. First operand 1402 states and 4205 transitions. Second operand 6 states. [2020-10-05 22:41:18,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:41:18,173 INFO L93 Difference]: Finished difference Result 1239 states and 3690 transitions. [2020-10-05 22:41:18,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 22:41:18,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-05 22:41:18,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:41:18,179 INFO L225 Difference]: With dead ends: 1239 [2020-10-05 22:41:18,179 INFO L226 Difference]: Without dead ends: 1113 [2020-10-05 22:41:18,179 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:41:18,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2020-10-05 22:41:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2020-10-05 22:41:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2020-10-05 22:41:18,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 3362 transitions. [2020-10-05 22:41:18,209 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 3362 transitions. Word has length 20 [2020-10-05 22:41:18,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:41:18,210 INFO L479 AbstractCegarLoop]: Abstraction has 1113 states and 3362 transitions. [2020-10-05 22:41:18,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 22:41:18,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 3362 transitions. [2020-10-05 22:41:18,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 22:41:18,214 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:41:18,214 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:41:18,214 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 22:41:18,214 INFO L427 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-05 22:41:18,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:41:18,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1850353899, now seen corresponding path program 1 times [2020-10-05 22:41:18,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:41:18,215 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954694296] [2020-10-05 22:41:18,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:41:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:41:18,373 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-05 22:41:18,373 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954694296] [2020-10-05 22:41:18,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:41:18,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:41:18,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544759437] [2020-10-05 22:41:18,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 22:41:18,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:41:18,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 22:41:18,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:41:18,375 INFO L87 Difference]: Start difference. First operand 1113 states and 3362 transitions. Second operand 7 states. [2020-10-05 22:41:18,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:41:18,600 INFO L93 Difference]: Finished difference Result 1921 states and 5610 transitions. [2020-10-05 22:41:18,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:41:18,600 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-05 22:41:18,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:41:18,605 INFO L225 Difference]: With dead ends: 1921 [2020-10-05 22:41:18,605 INFO L226 Difference]: Without dead ends: 1674 [2020-10-05 22:41:18,605 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-05 22:41:18,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2020-10-05 22:41:18,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1352. [2020-10-05 22:41:18,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2020-10-05 22:41:18,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 4014 transitions. [2020-10-05 22:41:18,648 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 4014 transitions. Word has length 24 [2020-10-05 22:41:18,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:41:18,649 INFO L479 AbstractCegarLoop]: Abstraction has 1352 states and 4014 transitions. [2020-10-05 22:41:18,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 22:41:18,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 4014 transitions. [2020-10-05 22:41:18,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 22:41:18,653 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:41:18,653 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:41:18,653 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 22:41:18,653 INFO L427 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-05 22:41:18,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:41:18,654 INFO L82 PathProgramCache]: Analyzing trace with hash 301351231, now seen corresponding path program 2 times [2020-10-05 22:41:18,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:41:18,654 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207825490] [2020-10-05 22:41:18,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:41:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:41:18,775 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-05 22:41:18,775 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207825490] [2020-10-05 22:41:18,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:41:18,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 22:41:18,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770174855] [2020-10-05 22:41:18,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 22:41:18,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:41:18,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 22:41:18,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:41:18,777 INFO L87 Difference]: Start difference. First operand 1352 states and 4014 transitions. Second operand 7 states. [2020-10-05 22:41:18,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:41:18,877 INFO L93 Difference]: Finished difference Result 1322 states and 3950 transitions. [2020-10-05 22:41:18,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:41:18,878 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-05 22:41:18,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:41:18,881 INFO L225 Difference]: With dead ends: 1322 [2020-10-05 22:41:18,881 INFO L226 Difference]: Without dead ends: 941 [2020-10-05 22:41:18,882 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-05 22:41:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2020-10-05 22:41:18,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 941. [2020-10-05 22:41:18,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2020-10-05 22:41:18,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 2812 transitions. [2020-10-05 22:41:18,906 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 2812 transitions. Word has length 24 [2020-10-05 22:41:18,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:41:18,907 INFO L479 AbstractCegarLoop]: Abstraction has 941 states and 2812 transitions. [2020-10-05 22:41:18,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 22:41:18,907 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2812 transitions. [2020-10-05 22:41:18,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-05 22:41:18,910 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:41:18,910 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:41:18,910 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 22:41:18,910 INFO L427 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-05 22:41:18,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:41:18,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1383804645, now seen corresponding path program 1 times [2020-10-05 22:41:18,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:41:18,911 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226683841] [2020-10-05 22:41:18,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:41:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:41:18,970 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-05 22:41:18,971 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226683841] [2020-10-05 22:41:18,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:41:18,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 22:41:18,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732690043] [2020-10-05 22:41:18,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:41:18,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:41:18,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:41:18,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:41:18,972 INFO L87 Difference]: Start difference. First operand 941 states and 2812 transitions. Second operand 4 states. [2020-10-05 22:41:18,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:41:18,991 INFO L93 Difference]: Finished difference Result 1371 states and 4064 transitions. [2020-10-05 22:41:18,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 22:41:18,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-10-05 22:41:18,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:41:18,994 INFO L225 Difference]: With dead ends: 1371 [2020-10-05 22:41:18,994 INFO L226 Difference]: Without dead ends: 493 [2020-10-05 22:41:18,994 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:41:18,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2020-10-05 22:41:19,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2020-10-05 22:41:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-10-05 22:41:19,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 1386 transitions. [2020-10-05 22:41:19,006 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 1386 transitions. Word has length 28 [2020-10-05 22:41:19,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:41:19,006 INFO L479 AbstractCegarLoop]: Abstraction has 493 states and 1386 transitions. [2020-10-05 22:41:19,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:41:19,006 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 1386 transitions. [2020-10-05 22:41:19,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-05 22:41:19,008 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:41:19,008 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:41:19,009 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 22:41:19,009 INFO L427 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-05 22:41:19,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:41:19,009 INFO L82 PathProgramCache]: Analyzing trace with hash -763891125, now seen corresponding path program 2 times [2020-10-05 22:41:19,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:41:19,010 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333939582] [2020-10-05 22:41:19,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:41:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:41:19,215 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-05 22:41:19,216 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333939582] [2020-10-05 22:41:19,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:41:19,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 22:41:19,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808758177] [2020-10-05 22:41:19,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 22:41:19,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:41:19,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 22:41:19,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:41:19,218 INFO L87 Difference]: Start difference. First operand 493 states and 1386 transitions. Second operand 8 states. [2020-10-05 22:41:19,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:41:19,396 INFO L93 Difference]: Finished difference Result 828 states and 2279 transitions. [2020-10-05 22:41:19,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:41:19,396 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-10-05 22:41:19,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:41:19,398 INFO L225 Difference]: With dead ends: 828 [2020-10-05 22:41:19,399 INFO L226 Difference]: Without dead ends: 718 [2020-10-05 22:41:19,399 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-10-05 22:41:19,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2020-10-05 22:41:19,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 561. [2020-10-05 22:41:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2020-10-05 22:41:19,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 1550 transitions. [2020-10-05 22:41:19,415 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 1550 transitions. Word has length 28 [2020-10-05 22:41:19,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:41:19,415 INFO L479 AbstractCegarLoop]: Abstraction has 561 states and 1550 transitions. [2020-10-05 22:41:19,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 22:41:19,416 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1550 transitions. [2020-10-05 22:41:19,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-05 22:41:19,417 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:41:19,417 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:41:19,418 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 22:41:19,418 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:41:19,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:41:19,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1982073503, now seen corresponding path program 3 times [2020-10-05 22:41:19,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:41:19,419 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778236440] [2020-10-05 22:41:19,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:41:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 22:41:19,503 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 22:41:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 22:41:19,581 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 22:41:19,624 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 22:41:19,625 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 22:41:19,625 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 22:41:19,626 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 22:41:19,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1152] [1152] L3-->L871: Formula: (let ((.cse6 (= (mod ~a$r_buff0_thd0~0_In-982151936 256) 0)) (.cse7 (= (mod ~a$w_buff0_used~0_In-982151936 256) 0)) (.cse9 (= (mod ~a$r_buff1_thd0~0_In-982151936 256) 0)) (.cse8 (= (mod ~a$w_buff1_used~0_In-982151936 256) 0))) (let ((.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse3 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (or (and (or (and .cse0 (= ~a~0_In-982151936 ~a~0_Out-982151936)) (and .cse1 .cse2 (= ~a~0_Out-982151936 ~a$w_buff1~0_In-982151936))) .cse3) (and .cse4 (= ~a~0_Out-982151936 ~a$w_buff0~0_In-982151936) .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In-982151936 0)) (= ~a$r_buff0_thd0~0_In-982151936 ~a$r_buff0_thd0~0_Out-982151936) (or (and (= ~a$w_buff1_used~0_Out-982151936 0) .cse1 .cse2) (and (= ~a$w_buff1_used~0_Out-982151936 ~a$w_buff1_used~0_In-982151936) .cse0)) (or (and (= ~a$w_buff0_used~0_In-982151936 ~a$w_buff0_used~0_Out-982151936) .cse3) (and .cse4 .cse5 (= 0 ~a$w_buff0_used~0_Out-982151936))) (= ~a$r_buff1_thd0~0_In-982151936 ~a$r_buff1_thd0~0_Out-982151936)))) InVars {~a~0=~a~0_In-982151936, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-982151936, ~a$w_buff1~0=~a$w_buff1~0_In-982151936, ~a$w_buff0~0=~a$w_buff0~0_In-982151936, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-982151936, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-982151936, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-982151936, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-982151936} OutVars{ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-982151936|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-982151936, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-982151936|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_Out-982151936, ULTIMATE.start_main_#t~ite54=|ULTIMATE.start_main_#t~ite54_Out-982151936|, ULTIMATE.start_main_#t~ite53=|ULTIMATE.start_main_#t~ite53_Out-982151936|, ULTIMATE.start_main_#t~ite56=|ULTIMATE.start_main_#t~ite56_Out-982151936|, ULTIMATE.start_main_#t~ite55=|ULTIMATE.start_main_#t~ite55_Out-982151936|, ~a~0=~a~0_Out-982151936, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-982151936, ~a$w_buff1~0=~a$w_buff1~0_In-982151936, ~a$w_buff0~0=~a$w_buff0~0_In-982151936, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-982151936, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-982151936} 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-05 22:41:19,707 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-05 22:41:19,708 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,710 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:41:19,711 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,711 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:41:19,711 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,711 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:41:19,711 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,711 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:41:19,712 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,712 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:41:19,712 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,713 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:41:19,713 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,713 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:41:19,713 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,713 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:41:19,713 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,714 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-05 22:41:19,714 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,714 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-05 22:41:19,715 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,716 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-05 22:41:19,716 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,718 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-05 22:41:19,718 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,718 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-05 22:41:19,718 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,719 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-05 22:41:19,719 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,719 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-05 22:41:19,719 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,719 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-05 22:41:19,719 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,724 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-05 22:41:19,724 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,724 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-05 22:41:19,724 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,724 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-05 22:41:19,725 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,725 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-05 22:41:19,725 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,725 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-05 22:41:19,725 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,726 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-05 22:41:19,726 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,726 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-05 22:41:19,726 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,726 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-05 22:41:19,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,727 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-05 22:41:19,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,727 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-05 22:41:19,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,727 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-05 22:41:19,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,728 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-05 22:41:19,728 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,729 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-05 22:41:19,729 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,729 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-05 22:41:19,729 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,729 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-05 22:41:19,730 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,730 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-05 22:41:19,730 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,730 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-05 22:41:19,730 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:19,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 10:41:19 BasicIcfg [2020-10-05 22:41:19,857 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 22:41:19,861 INFO L168 Benchmark]: Toolchain (without parser) took 13498.69 ms. Allocated memory was 146.8 MB in the beginning and 472.9 MB in the end (delta: 326.1 MB). Free memory was 101.4 MB in the beginning and 381.0 MB in the end (delta: -279.6 MB). Peak memory consumption was 374.0 MB. Max. memory is 7.1 GB. [2020-10-05 22:41:19,862 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 146.8 MB. Free memory was 121.5 MB in the beginning and 121.1 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. [2020-10-05 22:41:19,863 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.28 ms. Allocated memory was 146.8 MB in the beginning and 203.4 MB in the end (delta: 56.6 MB). Free memory was 101.4 MB in the beginning and 156.4 MB in the end (delta: -55.0 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2020-10-05 22:41:19,864 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.75 ms. Allocated memory is still 203.4 MB. Free memory was 156.4 MB in the beginning and 153.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-05 22:41:19,864 INFO L168 Benchmark]: Boogie Preprocessor took 45.36 ms. Allocated memory is still 203.4 MB. Free memory was 153.5 MB in the beginning and 151.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-10-05 22:41:19,869 INFO L168 Benchmark]: RCFGBuilder took 2314.78 ms. Allocated memory was 203.4 MB in the beginning and 247.5 MB in the end (delta: 44.0 MB). Free memory was 151.6 MB in the beginning and 147.4 MB in the end (delta: 4.2 MB). Peak memory consumption was 103.6 MB. Max. memory is 7.1 GB. [2020-10-05 22:41:19,870 INFO L168 Benchmark]: TraceAbstraction took 10299.80 ms. Allocated memory was 247.5 MB in the beginning and 472.9 MB in the end (delta: 225.4 MB). Free memory was 147.4 MB in the beginning and 381.0 MB in the end (delta: -233.6 MB). Peak memory consumption was 319.4 MB. Max. memory is 7.1 GB. [2020-10-05 22:41:19,874 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.23 ms. Allocated memory is still 146.8 MB. Free memory was 121.5 MB in the beginning and 121.1 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 763.28 ms. Allocated memory was 146.8 MB in the beginning and 203.4 MB in the end (delta: 56.6 MB). Free memory was 101.4 MB in the beginning and 156.4 MB in the end (delta: -55.0 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.75 ms. Allocated memory is still 203.4 MB. Free memory was 156.4 MB in the beginning and 153.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.36 ms. Allocated memory is still 203.4 MB. Free memory was 153.5 MB in the beginning and 151.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2314.78 ms. Allocated memory was 203.4 MB in the beginning and 247.5 MB in the end (delta: 44.0 MB). Free memory was 151.6 MB in the beginning and 147.4 MB in the end (delta: 4.2 MB). Peak memory consumption was 103.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10299.80 ms. Allocated memory was 247.5 MB in the beginning and 472.9 MB in the end (delta: 225.4 MB). Free memory was 147.4 MB in the beginning and 381.0 MB in the end (delta: -233.6 MB). Peak memory consumption was 319.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 123 ProgramPointsBefore, 47 ProgramPointsAfterwards, 112 TransitionsBefore, 34 TransitionsAfterwards, 2714 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 1372 VarBasedMoverChecksPositive, 73 VarBasedMoverChecksNegative, 18 SemBasedMoverChecksPositive, 96 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.5s, 0 MoverChecksTotal, 7454 CheckedPairsTotal, 85 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_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 t793; [L854] FCALL, FORK 0 pthread_create(&t793, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [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_p0_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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L855] 0 pthread_t t794; [L856] FCALL, FORK 0 pthread_create(&t794, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t795; [L858] FCALL, FORK 0 pthread_create(&t795, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1, z=0] [L789] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1, y=2, z=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 [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1, y=2, z=1] [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 2 return 0; [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 [L802] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 3 return 0; [L859] 0 pthread_t t796; [L860] FCALL, FORK 0 pthread_create(&t796, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_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=1, y=2, z=1] [L809] 4 z = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_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=1, y=2, z=2] [L812] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_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=1, y=2, 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_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=1, y=2, z=2] [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; [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 [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_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=1, y=2, z=2] [L873] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_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_p0_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=1, y=2, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 111 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.9s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 428 SDtfs, 723 SDslu, 642 SDs, 0 SdLazy, 237 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4874occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 611 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 239 NumberOfCodeBlocks, 239 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 20383 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...