/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/mix008_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 22:37:18,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 22:37:18,171 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 22:37:18,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 22:37:18,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 22:37:18,220 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 22:37:18,223 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 22:37:18,227 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 22:37:18,229 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 22:37:18,232 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 22:37:18,233 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 22:37:18,234 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 22:37:18,234 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 22:37:18,237 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 22:37:18,240 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 22:37:18,241 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 22:37:18,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 22:37:18,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 22:37:18,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 22:37:18,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 22:37:18,255 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 22:37:18,256 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 22:37:18,257 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 22:37:18,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 22:37:18,270 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 22:37:18,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 22:37:18,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 22:37:18,272 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 22:37:18,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 22:37:18,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 22:37:18,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 22:37:18,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 22:37:18,274 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 22:37:18,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 22:37:18,276 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 22:37:18,276 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 22:37:18,277 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 22:37:18,277 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 22:37:18,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 22:37:18,278 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 22:37:18,278 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 22:37:18,279 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:37:18,302 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 22:37:18,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 22:37:18,304 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 22:37:18,304 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 22:37:18,304 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 22:37:18,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 22:37:18,305 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 22:37:18,305 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 22:37:18,305 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 22:37:18,305 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 22:37:18,305 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 22:37:18,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 22:37:18,306 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 22:37:18,306 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 22:37:18,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 22:37:18,306 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 22:37:18,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 22:37:18,307 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 22:37:18,307 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 22:37:18,307 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 22:37:18,307 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 22:37:18,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 22:37:18,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 22:37:18,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-05 22:37:18,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 22:37:18,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 22:37:18,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 22:37:18,309 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 22:37:18,309 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-05 22:37:18,309 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-05 22:37:18,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 22:37:18,598 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 22:37:18,602 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 22:37:18,603 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 22:37:18,604 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 22:37:18,605 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008_rmo.opt.i [2020-10-05 22:37:18,670 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964fbfc5b/4bdd2696e5b94a04925ef1dd67735be7/FLAG5f40117ab [2020-10-05 22:37:19,257 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 22:37:19,258 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_rmo.opt.i [2020-10-05 22:37:19,275 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964fbfc5b/4bdd2696e5b94a04925ef1dd67735be7/FLAG5f40117ab [2020-10-05 22:37:19,485 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964fbfc5b/4bdd2696e5b94a04925ef1dd67735be7 [2020-10-05 22:37:19,494 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 22:37:19,496 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 22:37:19,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 22:37:19,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 22:37:19,500 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 22:37:19,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:37:19" (1/1) ... [2020-10-05 22:37:19,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fc0d6ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:37:19, skipping insertion in model container [2020-10-05 22:37:19,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:37:19" (1/1) ... [2020-10-05 22:37:19,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 22:37:19,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 22:37:20,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 22:37:20,047 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 22:37:20,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 22:37:20,259 INFO L208 MainTranslator]: Completed translation [2020-10-05 22:37:20,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:37:20 WrapperNode [2020-10-05 22:37:20,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 22:37:20,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 22:37:20,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 22:37:20,260 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 22:37:20,267 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:37:20" (1/1) ... [2020-10-05 22:37:20,290 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:37:20" (1/1) ... [2020-10-05 22:37:20,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 22:37:20,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 22:37:20,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 22:37:20,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 22:37:20,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:37:20" (1/1) ... [2020-10-05 22:37:20,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:37:20" (1/1) ... [2020-10-05 22:37:20,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:37:20" (1/1) ... [2020-10-05 22:37:20,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:37:20" (1/1) ... [2020-10-05 22:37:20,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:37:20" (1/1) ... [2020-10-05 22:37:20,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:37:20" (1/1) ... [2020-10-05 22:37:20,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:37:20" (1/1) ... [2020-10-05 22:37:20,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 22:37:20,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 22:37:20,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 22:37:20,368 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 22:37:20,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:37:20" (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:37:20,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 22:37:20,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 22:37:20,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 22:37:20,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 22:37:20,442 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 22:37:20,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 22:37:20,442 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 22:37:20,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 22:37:20,442 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 22:37:20,443 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 22:37:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-05 22:37:20,443 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-05 22:37:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 22:37:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 22:37:20,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 22:37:20,446 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:37:22,849 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 22:37:22,850 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 22:37:22,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:37:22 BoogieIcfgContainer [2020-10-05 22:37:22,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 22:37:22,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 22:37:22,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 22:37:22,857 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 22:37:22,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 10:37:19" (1/3) ... [2020-10-05 22:37:22,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d8840b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:37:22, skipping insertion in model container [2020-10-05 22:37:22,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:37:20" (2/3) ... [2020-10-05 22:37:22,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d8840b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:37:22, skipping insertion in model container [2020-10-05 22:37:22,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:37:22" (3/3) ... [2020-10-05 22:37:22,861 INFO L109 eAbstractionObserver]: Analyzing ICFG mix008_rmo.opt.i [2020-10-05 22:37:22,872 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 22:37:22,872 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-05 22:37:22,884 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 22:37:22,885 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 22:37:22,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,923 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,924 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,925 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,925 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,925 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,925 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,926 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,926 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,927 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,927 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,933 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,933 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,933 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,933 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,933 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,934 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,934 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,934 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,937 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,937 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,937 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,937 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,938 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,938 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,938 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,938 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,939 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,939 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,939 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,939 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,939 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,939 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,940 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,940 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,940 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,940 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,940 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,940 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,941 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,941 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,941 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,941 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,941 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,941 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,942 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,942 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,942 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,942 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,942 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,942 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,943 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,943 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,943 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,943 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,943 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,944 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,944 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,944 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,944 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,944 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,945 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,945 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,945 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,945 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,947 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,947 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,948 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,948 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,948 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,948 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,948 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,949 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,949 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,955 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,956 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,962 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,962 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,962 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,962 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,963 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,963 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,963 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,963 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,963 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,964 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,966 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,968 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,968 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,968 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,968 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,970 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,971 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,972 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,973 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,973 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,973 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:37:22,990 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-05 22:37:23,011 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 22:37:23,011 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 22:37:23,012 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-05 22:37:23,012 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 22:37:23,012 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 22:37:23,012 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 22:37:23,012 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 22:37:23,012 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 22:37:23,029 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 242 flow [2020-10-05 22:37:23,031 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow [2020-10-05 22:37:23,116 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2020-10-05 22:37:23,116 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 22:37:23,122 INFO L80 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2020-10-05 22:37:23,126 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow [2020-10-05 22:37:23,150 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2020-10-05 22:37:23,150 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 22:37:23,151 INFO L80 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2020-10-05 22:37:23,154 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2446 [2020-10-05 22:37:23,155 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-10-05 22:37:23,565 WARN L193 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-05 22:37:23,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:23,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:37:23,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:37:23,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:23,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:37:23,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:23,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:37:23,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:37:23,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:23,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:37:23,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:37:23,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:37:23,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:37:23,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:23,979 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:37:23,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:23,983 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:37:23,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:24,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:37:24,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:24,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:37:24,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:24,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:37:24,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:37:24,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:37:24,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:37:24,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:37:24,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:24,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:37:24,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:24,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:37:24,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:37:24,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:37:24,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:37:24,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:37:24,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:24,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:37:24,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:24,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:37:24,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:37:24,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:37:24,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:37:24,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:37:24,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:24,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:37:24,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:24,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:37:24,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:37:24,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:37:24,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:37:24,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:37:24,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:24,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:37:24,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:37:24,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:24,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:37:24,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:37:24,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:37:24,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:37:24,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:24,782 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:37:24,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:24,785 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:37:24,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:24,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:24,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:37:24,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:37:24,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:24,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:37:24,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:24,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:37:24,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:37:24,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:24,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:37:24,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:37:24,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:37:24,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:37:24,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:24,919 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:37:24,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:24,921 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:37:24,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:24,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:24,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:37:24,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:37:24,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:37:25,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:37:25,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:37:25,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:37:25,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:25,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:37:25,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:37:25,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:37:25,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:37:25,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,394 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:37:25,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,396 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:37:25,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:37:25,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:37:25,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:37:25,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:37:25,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:37:25,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:37:25,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:25,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:25,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:25,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:37:25,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:37:25,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:37:25,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:37:25,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:37:25,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:25,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:25,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:25,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:37:25,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:37:25,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:25,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:37:25,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:37:25,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:37:25,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:37:25,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,963 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:37:25,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,964 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:37:25,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:25,996 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:25,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:37:25,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:37:25,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:26,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:37:26,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:26,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:26,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:26,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:26,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:26,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:26,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:26,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:26,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:26,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:26,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:26,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:26,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:26,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:26,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:26,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:26,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:37:26,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:26,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:37:26,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:26,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:37:26,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:37:26,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:26,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:26,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:26,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:26,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:26,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:37:26,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:26,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:26,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:26,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:37:26,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:26,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:37:26,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:26,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:26,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:26,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:26,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:26,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:26,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:26,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:26,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:37:26,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:26,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:37:26,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:26,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:37:26,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:37:26,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:26,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:26,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:26,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:26,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:26,411 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-05 22:37:26,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:37:26,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:26,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:37:26,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:26,730 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:37:26,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:37:26,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:37:26,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:37:26,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:37:26,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:26,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:37:26,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:26,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:37:26,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:26,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:37:26,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:26,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:26,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:37:26,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:37:26,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:26,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:37:26,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:26,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:37:26,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:37:26,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:26,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:37:26,882 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:37:26,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:37:26,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:37:26,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:26,886 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:37:26,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:26,887 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:37:26,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:26,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:37:26,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:26,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:37:26,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:26,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:37:26,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:26,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:37:26,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:26,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:37:26,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:26,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:37:26,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:26,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:37:26,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:37:26,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:37:26,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:37:27,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:37:27,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:27,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:37:27,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:37:27,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:27,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:37:27,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:37:27,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:37:27,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:37:27,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:27,029 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:37:27,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:27,030 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:37:27,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:37:27,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:37:27,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:37:27,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:37:27,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:37:27,958 WARN L193 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2020-10-05 22:37:28,090 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-05 22:37:28,107 INFO L206 etLargeBlockEncoding]: Checked pairs total: 6164 [2020-10-05 22:37:28,108 INFO L214 etLargeBlockEncoding]: Total number of compositions: 90 [2020-10-05 22:37:28,112 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2020-10-05 22:37:28,328 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3562 states. [2020-10-05 22:37:28,331 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states. [2020-10-05 22:37:28,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 22:37:28,340 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:37:28,341 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:37:28,341 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:37:28,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:37:28,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1541605919, now seen corresponding path program 1 times [2020-10-05 22:37:28,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:37:28,360 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181644076] [2020-10-05 22:37:28,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:37:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:37:28,649 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:37:28,650 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181644076] [2020-10-05 22:37:28,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:37:28,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 22:37:28,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171074328] [2020-10-05 22:37:28,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 22:37:28,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:37:28,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 22:37:28,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:37:28,672 INFO L87 Difference]: Start difference. First operand 3562 states. Second operand 3 states. [2020-10-05 22:37:28,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:37:28,801 INFO L93 Difference]: Finished difference Result 3082 states and 12048 transitions. [2020-10-05 22:37:28,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 22:37:28,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-05 22:37:28,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:37:28,854 INFO L225 Difference]: With dead ends: 3082 [2020-10-05 22:37:28,854 INFO L226 Difference]: Without dead ends: 2602 [2020-10-05 22:37:28,856 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:37:28,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2020-10-05 22:37:29,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2020-10-05 22:37:29,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2020-10-05 22:37:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2020-10-05 22:37:29,086 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2020-10-05 22:37:29,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:37:29,087 INFO L479 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2020-10-05 22:37:29,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 22:37:29,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2020-10-05 22:37:29,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 22:37:29,097 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:37:29,097 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:37:29,098 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 22:37:29,098 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:37:29,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:37:29,098 INFO L82 PathProgramCache]: Analyzing trace with hash 105851133, now seen corresponding path program 1 times [2020-10-05 22:37:29,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:37:29,099 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808223024] [2020-10-05 22:37:29,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:37:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:37:29,274 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:37:29,274 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808223024] [2020-10-05 22:37:29,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:37:29,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 22:37:29,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053932924] [2020-10-05 22:37:29,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 22:37:29,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:37:29,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 22:37:29,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:37:29,277 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand 5 states. [2020-10-05 22:37:29,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:37:29,405 INFO L93 Difference]: Finished difference Result 2762 states and 10352 transitions. [2020-10-05 22:37:29,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:37:29,406 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-05 22:37:29,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:37:29,426 INFO L225 Difference]: With dead ends: 2762 [2020-10-05 22:37:29,426 INFO L226 Difference]: Without dead ends: 2282 [2020-10-05 22:37:29,427 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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:37:29,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2020-10-05 22:37:29,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2282. [2020-10-05 22:37:29,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2020-10-05 22:37:29,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 8688 transitions. [2020-10-05 22:37:29,513 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 8688 transitions. Word has length 12 [2020-10-05 22:37:29,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:37:29,514 INFO L479 AbstractCegarLoop]: Abstraction has 2282 states and 8688 transitions. [2020-10-05 22:37:29,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 22:37:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 8688 transitions. [2020-10-05 22:37:29,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 22:37:29,517 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:37:29,517 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:37:29,517 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 22:37:29,517 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:37:29,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:37:29,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1355521040, now seen corresponding path program 1 times [2020-10-05 22:37:29,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:37:29,518 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258735355] [2020-10-05 22:37:29,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:37:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:37:29,724 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:37:29,724 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258735355] [2020-10-05 22:37:29,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:37:29,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 22:37:29,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926357309] [2020-10-05 22:37:29,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:37:29,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:37:29,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:37:29,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:37:29,727 INFO L87 Difference]: Start difference. First operand 2282 states and 8688 transitions. Second operand 4 states. [2020-10-05 22:37:29,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:37:29,794 INFO L93 Difference]: Finished difference Result 2538 states and 9408 transitions. [2020-10-05 22:37:29,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:37:29,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-05 22:37:29,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:37:29,817 INFO L225 Difference]: With dead ends: 2538 [2020-10-05 22:37:29,817 INFO L226 Difference]: Without dead ends: 2218 [2020-10-05 22:37:29,818 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:37:29,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2020-10-05 22:37:29,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2218. [2020-10-05 22:37:29,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2218 states. [2020-10-05 22:37:29,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 8400 transitions. [2020-10-05 22:37:29,972 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 8400 transitions. Word has length 14 [2020-10-05 22:37:29,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:37:29,973 INFO L479 AbstractCegarLoop]: Abstraction has 2218 states and 8400 transitions. [2020-10-05 22:37:29,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:37:29,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 8400 transitions. [2020-10-05 22:37:29,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 22:37:29,976 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:37:29,976 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:37:29,976 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 22:37:29,977 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:37:29,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:37:29,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1455002848, now seen corresponding path program 1 times [2020-10-05 22:37:29,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:37:29,978 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253355788] [2020-10-05 22:37:29,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:37:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:37:30,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:37:30,093 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253355788] [2020-10-05 22:37:30,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:37:30,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 22:37:30,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941837290] [2020-10-05 22:37:30,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:37:30,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:37:30,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:37:30,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:37:30,095 INFO L87 Difference]: Start difference. First operand 2218 states and 8400 transitions. Second operand 4 states. [2020-10-05 22:37:30,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:37:30,158 INFO L93 Difference]: Finished difference Result 2410 states and 8912 transitions. [2020-10-05 22:37:30,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:37:30,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-05 22:37:30,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:37:30,178 INFO L225 Difference]: With dead ends: 2410 [2020-10-05 22:37:30,178 INFO L226 Difference]: Without dead ends: 2154 [2020-10-05 22:37:30,179 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:37:30,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2020-10-05 22:37:30,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2154. [2020-10-05 22:37:30,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2020-10-05 22:37:30,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 8112 transitions. [2020-10-05 22:37:30,274 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 8112 transitions. Word has length 15 [2020-10-05 22:37:30,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:37:30,274 INFO L479 AbstractCegarLoop]: Abstraction has 2154 states and 8112 transitions. [2020-10-05 22:37:30,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:37:30,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 8112 transitions. [2020-10-05 22:37:30,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 22:37:30,280 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:37:30,280 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:37:30,280 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 22:37:30,280 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:37:30,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:37:30,281 INFO L82 PathProgramCache]: Analyzing trace with hash -2138646739, now seen corresponding path program 1 times [2020-10-05 22:37:30,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:37:30,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787246408] [2020-10-05 22:37:30,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:37:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:37:30,361 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:37:30,361 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787246408] [2020-10-05 22:37:30,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:37:30,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 22:37:30,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609452837] [2020-10-05 22:37:30,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:37:30,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:37:30,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:37:30,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:37:30,363 INFO L87 Difference]: Start difference. First operand 2154 states and 8112 transitions. Second operand 4 states. [2020-10-05 22:37:30,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:37:30,415 INFO L93 Difference]: Finished difference Result 2234 states and 8228 transitions. [2020-10-05 22:37:30,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:37:30,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-05 22:37:30,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:37:30,432 INFO L225 Difference]: With dead ends: 2234 [2020-10-05 22:37:30,432 INFO L226 Difference]: Without dead ends: 1978 [2020-10-05 22:37:30,433 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:37:30,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2020-10-05 22:37:30,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1978. [2020-10-05 22:37:30,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1978 states. [2020-10-05 22:37:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 7388 transitions. [2020-10-05 22:37:30,502 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 7388 transitions. Word has length 16 [2020-10-05 22:37:30,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:37:30,502 INFO L479 AbstractCegarLoop]: Abstraction has 1978 states and 7388 transitions. [2020-10-05 22:37:30,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:37:30,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 7388 transitions. [2020-10-05 22:37:30,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 22:37:30,506 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:37:30,506 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:37:30,507 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 22:37:30,507 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:37:30,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:37:30,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1592007369, now seen corresponding path program 1 times [2020-10-05 22:37:30,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:37:30,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972864904] [2020-10-05 22:37:30,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:37:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:37:30,592 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:37:30,592 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972864904] [2020-10-05 22:37:30,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:37:30,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 22:37:30,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556696946] [2020-10-05 22:37:30,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:37:30,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:37:30,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:37:30,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:37:30,594 INFO L87 Difference]: Start difference. First operand 1978 states and 7388 transitions. Second operand 4 states. [2020-10-05 22:37:30,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:37:30,656 INFO L93 Difference]: Finished difference Result 2014 states and 6852 transitions. [2020-10-05 22:37:30,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:37:30,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-05 22:37:30,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:37:30,670 INFO L225 Difference]: With dead ends: 2014 [2020-10-05 22:37:30,671 INFO L226 Difference]: Without dead ends: 1534 [2020-10-05 22:37:30,671 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:37:30,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2020-10-05 22:37:30,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1534. [2020-10-05 22:37:30,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1534 states. [2020-10-05 22:37:30,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 5168 transitions. [2020-10-05 22:37:30,729 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 5168 transitions. Word has length 17 [2020-10-05 22:37:30,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:37:30,730 INFO L479 AbstractCegarLoop]: Abstraction has 1534 states and 5168 transitions. [2020-10-05 22:37:30,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:37:30,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 5168 transitions. [2020-10-05 22:37:30,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 22:37:30,735 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:37:30,735 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:37:30,735 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 22:37:30,736 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:37:30,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:37:30,736 INFO L82 PathProgramCache]: Analyzing trace with hash 934318224, now seen corresponding path program 1 times [2020-10-05 22:37:30,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:37:30,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963742894] [2020-10-05 22:37:30,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:37:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:37:30,861 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:37:30,862 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963742894] [2020-10-05 22:37:30,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:37:30,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 22:37:30,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365898708] [2020-10-05 22:37:30,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 22:37:30,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:37:30,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 22:37:30,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:37:30,863 INFO L87 Difference]: Start difference. First operand 1534 states and 5168 transitions. Second operand 5 states. [2020-10-05 22:37:30,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:37:30,920 INFO L93 Difference]: Finished difference Result 1290 states and 3977 transitions. [2020-10-05 22:37:30,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 22:37:30,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-10-05 22:37:30,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:37:30,925 INFO L225 Difference]: With dead ends: 1290 [2020-10-05 22:37:30,926 INFO L226 Difference]: Without dead ends: 990 [2020-10-05 22:37:30,926 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:37:30,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2020-10-05 22:37:30,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 990. [2020-10-05 22:37:30,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 990 states. [2020-10-05 22:37:30,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 2992 transitions. [2020-10-05 22:37:30,954 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 2992 transitions. Word has length 19 [2020-10-05 22:37:30,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:37:30,954 INFO L479 AbstractCegarLoop]: Abstraction has 990 states and 2992 transitions. [2020-10-05 22:37:30,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 22:37:30,954 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 2992 transitions. [2020-10-05 22:37:30,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 22:37:30,957 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:37:30,957 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:37:30,957 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 22:37:30,958 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:37:30,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:37:30,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1187310109, now seen corresponding path program 1 times [2020-10-05 22:37:30,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:37:30,958 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488697062] [2020-10-05 22:37:30,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:37:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:37:31,048 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:37:31,048 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488697062] [2020-10-05 22:37:31,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:37:31,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 22:37:31,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103390199] [2020-10-05 22:37:31,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:37:31,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:37:31,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:37:31,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:37:31,050 INFO L87 Difference]: Start difference. First operand 990 states and 2992 transitions. Second operand 4 states. [2020-10-05 22:37:31,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:37:31,082 INFO L93 Difference]: Finished difference Result 1447 states and 4252 transitions. [2020-10-05 22:37:31,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 22:37:31,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-10-05 22:37:31,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:37:31,086 INFO L225 Difference]: With dead ends: 1447 [2020-10-05 22:37:31,086 INFO L226 Difference]: Without dead ends: 1026 [2020-10-05 22:37:31,087 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:37:31,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2020-10-05 22:37:31,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 990. [2020-10-05 22:37:31,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 990 states. [2020-10-05 22:37:31,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 2840 transitions. [2020-10-05 22:37:31,114 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 2840 transitions. Word has length 21 [2020-10-05 22:37:31,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:37:31,114 INFO L479 AbstractCegarLoop]: Abstraction has 990 states and 2840 transitions. [2020-10-05 22:37:31,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:37:31,115 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 2840 transitions. [2020-10-05 22:37:31,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 22:37:31,117 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:37:31,118 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:37:31,118 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 22:37:31,118 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:37:31,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:37:31,118 INFO L82 PathProgramCache]: Analyzing trace with hash -667616350, now seen corresponding path program 1 times [2020-10-05 22:37:31,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:37:31,119 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234969664] [2020-10-05 22:37:31,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:37:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:37:31,267 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:37:31,268 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234969664] [2020-10-05 22:37:31,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:37:31,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 22:37:31,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987439984] [2020-10-05 22:37:31,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:37:31,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:37:31,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:37:31,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:37:31,269 INFO L87 Difference]: Start difference. First operand 990 states and 2840 transitions. Second operand 4 states. [2020-10-05 22:37:31,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:37:31,300 INFO L93 Difference]: Finished difference Result 1444 states and 3966 transitions. [2020-10-05 22:37:31,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:37:31,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-10-05 22:37:31,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:37:31,304 INFO L225 Difference]: With dead ends: 1444 [2020-10-05 22:37:31,304 INFO L226 Difference]: Without dead ends: 1008 [2020-10-05 22:37:31,304 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:37:31,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2020-10-05 22:37:31,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 976. [2020-10-05 22:37:31,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2020-10-05 22:37:31,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 2650 transitions. [2020-10-05 22:37:31,331 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 2650 transitions. Word has length 21 [2020-10-05 22:37:31,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:37:31,332 INFO L479 AbstractCegarLoop]: Abstraction has 976 states and 2650 transitions. [2020-10-05 22:37:31,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:37:31,332 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 2650 transitions. [2020-10-05 22:37:31,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 22:37:31,335 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:37:31,335 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:37:31,335 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 22:37:31,335 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:37:31,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:37:31,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1716792557, now seen corresponding path program 2 times [2020-10-05 22:37:31,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:37:31,336 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038866506] [2020-10-05 22:37:31,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:37:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:37:31,469 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:37:31,470 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038866506] [2020-10-05 22:37:31,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:37:31,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:37:31,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936153872] [2020-10-05 22:37:31,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 22:37:31,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:37:31,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 22:37:31,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:37:31,471 INFO L87 Difference]: Start difference. First operand 976 states and 2650 transitions. Second operand 6 states. [2020-10-05 22:37:31,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:37:31,540 INFO L93 Difference]: Finished difference Result 835 states and 2214 transitions. [2020-10-05 22:37:31,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:37:31,541 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-05 22:37:31,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:37:31,543 INFO L225 Difference]: With dead ends: 835 [2020-10-05 22:37:31,544 INFO L226 Difference]: Without dead ends: 672 [2020-10-05 22:37:31,546 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:37:31,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2020-10-05 22:37:31,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2020-10-05 22:37:31,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2020-10-05 22:37:31,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1758 transitions. [2020-10-05 22:37:31,567 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1758 transitions. Word has length 21 [2020-10-05 22:37:31,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:37:31,567 INFO L479 AbstractCegarLoop]: Abstraction has 672 states and 1758 transitions. [2020-10-05 22:37:31,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 22:37:31,567 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1758 transitions. [2020-10-05 22:37:31,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 22:37:31,569 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:37:31,570 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:37:31,570 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 22:37:31,570 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:37:31,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:37:31,570 INFO L82 PathProgramCache]: Analyzing trace with hash 2031611998, now seen corresponding path program 1 times [2020-10-05 22:37:31,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:37:31,571 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110670450] [2020-10-05 22:37:31,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:37:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:37:31,735 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:37:31,736 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110670450] [2020-10-05 22:37:31,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:37:31,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 22:37:31,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831299224] [2020-10-05 22:37:31,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 22:37:31,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:37:31,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 22:37:31,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:37:31,738 INFO L87 Difference]: Start difference. First operand 672 states and 1758 transitions. Second operand 7 states. [2020-10-05 22:37:31,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:37:31,817 INFO L93 Difference]: Finished difference Result 638 states and 1690 transitions. [2020-10-05 22:37:31,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 22:37:31,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-05 22:37:31,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:37:31,819 INFO L225 Difference]: With dead ends: 638 [2020-10-05 22:37:31,819 INFO L226 Difference]: Without dead ends: 242 [2020-10-05 22:37:31,819 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:37:31,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-10-05 22:37:31,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2020-10-05 22:37:31,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-10-05 22:37:31,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 598 transitions. [2020-10-05 22:37:31,829 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 598 transitions. Word has length 24 [2020-10-05 22:37:31,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:37:31,829 INFO L479 AbstractCegarLoop]: Abstraction has 242 states and 598 transitions. [2020-10-05 22:37:31,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 22:37:31,829 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 598 transitions. [2020-10-05 22:37:31,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-05 22:37:31,831 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:37:31,831 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] [2020-10-05 22:37:31,832 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 22:37:31,832 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:37:31,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:37:31,832 INFO L82 PathProgramCache]: Analyzing trace with hash -782385811, now seen corresponding path program 1 times [2020-10-05 22:37:31,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:37:31,833 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895403496] [2020-10-05 22:37:31,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:37:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:37:31,946 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:37:31,946 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895403496] [2020-10-05 22:37:31,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:37:31,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 22:37:31,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371244637] [2020-10-05 22:37:31,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 22:37:31,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:37:31,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 22:37:31,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:37:31,948 INFO L87 Difference]: Start difference. First operand 242 states and 598 transitions. Second operand 5 states. [2020-10-05 22:37:31,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:37:31,978 INFO L93 Difference]: Finished difference Result 320 states and 780 transitions. [2020-10-05 22:37:31,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:37:31,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-10-05 22:37:31,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:37:31,980 INFO L225 Difference]: With dead ends: 320 [2020-10-05 22:37:31,980 INFO L226 Difference]: Without dead ends: 93 [2020-10-05 22:37:31,980 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:37:31,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-10-05 22:37:31,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2020-10-05 22:37:31,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-05 22:37:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 199 transitions. [2020-10-05 22:37:31,983 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 199 transitions. Word has length 27 [2020-10-05 22:37:31,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:37:31,983 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 199 transitions. [2020-10-05 22:37:31,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 22:37:31,984 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 199 transitions. [2020-10-05 22:37:31,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-05 22:37:31,984 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:37:31,984 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] [2020-10-05 22:37:31,985 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 22:37:31,985 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:37:31,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:37:31,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1776184171, now seen corresponding path program 2 times [2020-10-05 22:37:31,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:37:31,986 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546101792] [2020-10-05 22:37:31,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:37:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:37:32,272 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 27 [2020-10-05 22:37:32,326 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:37:32,326 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546101792] [2020-10-05 22:37:32,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:37:32,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 22:37:32,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598374795] [2020-10-05 22:37:32,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 22:37:32,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:37:32,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 22:37:32,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:37:32,328 INFO L87 Difference]: Start difference. First operand 93 states and 199 transitions. Second operand 8 states. [2020-10-05 22:37:32,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:37:32,719 INFO L93 Difference]: Finished difference Result 112 states and 234 transitions. [2020-10-05 22:37:32,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 22:37:32,719 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-10-05 22:37:32,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:37:32,720 INFO L225 Difference]: With dead ends: 112 [2020-10-05 22:37:32,720 INFO L226 Difference]: Without dead ends: 57 [2020-10-05 22:37:32,720 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-05 22:37:32,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-05 22:37:32,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-10-05 22:37:32,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-05 22:37:32,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 99 transitions. [2020-10-05 22:37:32,725 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 99 transitions. Word has length 27 [2020-10-05 22:37:32,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:37:32,726 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 99 transitions. [2020-10-05 22:37:32,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 22:37:32,726 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 99 transitions. [2020-10-05 22:37:32,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-05 22:37:32,726 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:37:32,727 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] [2020-10-05 22:37:32,727 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 22:37:32,727 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:37:32,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:37:32,728 INFO L82 PathProgramCache]: Analyzing trace with hash 258709973, now seen corresponding path program 3 times [2020-10-05 22:37:32,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:37:32,728 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651766069] [2020-10-05 22:37:32,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:37:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 22:37:32,817 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 22:37:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 22:37:32,873 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 22:37:32,929 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 22:37:32,929 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 22:37:32,930 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 22:37:32,967 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:37:32,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,968 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:37:32,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,968 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:37:32,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,969 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:37:32,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,969 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:37:32,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,969 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:37:32,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,970 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:37:32,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,970 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:37:32,971 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,971 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:37:32,971 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,971 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:37:32,971 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,971 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:37:32,971 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,972 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:37:32,972 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,972 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:37:32,972 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,974 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:37:32,975 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,979 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:37:32,979 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,979 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:37:32,979 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,980 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:37:32,980 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,980 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:37:32,980 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,980 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:37:32,981 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,981 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:37:32,981 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,981 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:37:32,981 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,981 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:37:32,981 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,982 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:37:32,982 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,982 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:37:32,982 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,982 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:37:32,982 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,983 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:37:32,983 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,983 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:37:32,983 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,983 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:37:32,983 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,983 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:37:32,984 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,984 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:37:32,984 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,985 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:37:32,986 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,986 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:37:32,986 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,986 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:37:32,986 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,986 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:37:32,986 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,986 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:37:32,987 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:32,987 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:37:32,987 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:37:33,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 10:37:33 BasicIcfg [2020-10-05 22:37:33,094 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 22:37:33,096 INFO L168 Benchmark]: Toolchain (without parser) took 13600.77 ms. Allocated memory was 140.0 MB in the beginning and 469.2 MB in the end (delta: 329.3 MB). Free memory was 101.2 MB in the beginning and 92.9 MB in the end (delta: 8.3 MB). Peak memory consumption was 337.6 MB. Max. memory is 7.1 GB. [2020-10-05 22:37:33,097 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-05 22:37:33,098 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.20 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 100.8 MB in the beginning and 155.7 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:37:33,098 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.80 ms. Allocated memory is still 203.9 MB. Free memory was 155.7 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-05 22:37:33,099 INFO L168 Benchmark]: Boogie Preprocessor took 41.89 ms. Allocated memory is still 203.9 MB. Free memory was 153.1 MB in the beginning and 150.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-05 22:37:33,100 INFO L168 Benchmark]: RCFGBuilder took 2484.98 ms. Allocated memory was 203.9 MB in the beginning and 250.6 MB in the end (delta: 46.7 MB). Free memory was 149.8 MB in the beginning and 120.4 MB in the end (delta: 29.3 MB). Peak memory consumption was 102.4 MB. Max. memory is 7.1 GB. [2020-10-05 22:37:33,100 INFO L168 Benchmark]: TraceAbstraction took 10241.00 ms. Allocated memory was 250.6 MB in the beginning and 469.2 MB in the end (delta: 218.6 MB). Free memory was 118.6 MB in the beginning and 92.9 MB in the end (delta: 25.7 MB). Peak memory consumption was 244.3 MB. Max. memory is 7.1 GB. [2020-10-05 22:37:33,104 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 763.20 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 100.8 MB in the beginning and 155.7 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 64.80 ms. Allocated memory is still 203.9 MB. Free memory was 155.7 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.89 ms. Allocated memory is still 203.9 MB. Free memory was 153.1 MB in the beginning and 150.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2484.98 ms. Allocated memory was 203.9 MB in the beginning and 250.6 MB in the end (delta: 46.7 MB). Free memory was 149.8 MB in the beginning and 120.4 MB in the end (delta: 29.3 MB). Peak memory consumption was 102.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10241.00 ms. Allocated memory was 250.6 MB in the beginning and 469.2 MB in the end (delta: 218.6 MB). Free memory was 118.6 MB in the beginning and 92.9 MB in the end (delta: 25.7 MB). Peak memory consumption was 244.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 122 ProgramPointsBefore, 46 ProgramPointsAfterwards, 111 TransitionsBefore, 34 TransitionsAfterwards, 2446 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 1236 VarBasedMoverChecksPositive, 58 VarBasedMoverChecksNegative, 33 SemBasedMoverChecksPositive, 54 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 0 MoverChecksTotal, 6164 CheckedPairsTotal, 90 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_p2_EAX = 0; [L703] 0 int __unbuffered_p2_EBX = 0; [L705] 0 int __unbuffered_p3_EAX = 0; [L707] 0 int __unbuffered_p3_EBX = 0; [L709] 0 int a = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff0_thd4; [L725] 0 _Bool z$r_buff1_thd0; [L726] 0 _Bool z$r_buff1_thd1; [L727] 0 _Bool z$r_buff1_thd2; [L728] 0 _Bool z$r_buff1_thd3; [L729] 0 _Bool z$r_buff1_thd4; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L856] 0 pthread_t t229; [L857] FCALL, FORK 0 pthread_create(&t229, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 pthread_t t230; [L859] FCALL, FORK 0 pthread_create(&t230, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 pthread_t t231; [L861] FCALL, FORK 0 pthread_create(&t231, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 pthread_t t232; [L863] FCALL, FORK 0 pthread_create(&t232, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 1 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L7] COND FALSE 4 !(!expression) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 4 z$flush_delayed = weak$$choice2 [L818] 4 z$mem_tmp = z [L819] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L819] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1 [L819] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L819] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L820] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L820] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0) [L820] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L820] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L821] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L821] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L822] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L822] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used) [L822] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L822] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L823] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L823] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L824] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4) [L824] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L824] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L825] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L825] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L826] 4 __unbuffered_p3_EAX = z [L827] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L827] 4 z = z$flush_delayed ? z$mem_tmp : z [L828] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L756] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L778] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L779] 3 z$flush_delayed = weak$$choice2 [L780] 3 z$mem_tmp = z [L781] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L781] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L782] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L782] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L783] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L783] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L784] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L784] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L784] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L784] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L785] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L785] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L786] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L787] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L787] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L788] 3 __unbuffered_p2_EBX = z [L789] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L789] 3 z = z$flush_delayed ? z$mem_tmp : z [L790] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L834] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L834] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L835] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L836] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L837] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 2 return 0; [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L869] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L869] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L869] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L876] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 110 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.9s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 488 SDtfs, 544 SDslu, 954 SDs, 0 SdLazy, 279 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3562occurred 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.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 68 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 270 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 20630 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...