/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/mix013_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 11:07:43,467 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 11:07:43,470 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 11:07:43,515 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 11:07:43,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 11:07:43,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 11:07:43,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 11:07:43,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 11:07:43,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 11:07:43,538 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 11:07:43,539 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 11:07:43,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 11:07:43,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 11:07:43,543 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 11:07:43,545 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 11:07:43,547 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 11:07:43,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 11:07:43,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 11:07:43,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 11:07:43,559 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 11:07:43,562 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 11:07:43,563 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 11:07:43,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 11:07:43,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 11:07:43,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 11:07:43,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 11:07:43,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 11:07:43,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 11:07:43,586 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 11:07:43,588 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 11:07:43,588 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 11:07:43,589 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 11:07:43,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 11:07:43,590 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 11:07:43,591 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 11:07:43,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 11:07:43,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 11:07:43,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 11:07:43,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 11:07:43,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 11:07:43,595 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 11:07:43,596 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-16 11:07:43,637 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 11:07:43,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 11:07:43,640 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 11:07:43,640 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 11:07:43,640 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 11:07:43,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 11:07:43,640 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 11:07:43,641 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 11:07:43,641 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 11:07:43,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 11:07:43,642 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 11:07:43,642 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 11:07:43,643 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 11:07:43,643 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 11:07:43,643 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 11:07:43,643 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 11:07:43,644 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 11:07:43,644 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 11:07:43,644 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 11:07:43,644 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 11:07:43,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 11:07:43,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 11:07:43,645 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 11:07:43,645 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 11:07:43,645 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 11:07:43,645 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 11:07:43,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 11:07:43,646 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 11:07:43,646 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-16 11:07:43,646 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 11:07:44,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 11:07:44,015 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 11:07:44,019 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 11:07:44,020 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 11:07:44,021 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 11:07:44,021 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix013_power.oepc.i [2020-10-16 11:07:44,083 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1febe98e5/83b589b6677e49eea9b8778956f40e1d/FLAG42522a31a [2020-10-16 11:07:44,685 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 11:07:44,686 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix013_power.oepc.i [2020-10-16 11:07:44,711 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1febe98e5/83b589b6677e49eea9b8778956f40e1d/FLAG42522a31a [2020-10-16 11:07:44,931 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1febe98e5/83b589b6677e49eea9b8778956f40e1d [2020-10-16 11:07:44,941 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 11:07:44,942 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 11:07:44,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 11:07:44,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 11:07:44,947 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 11:07:44,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:07:44" (1/1) ... [2020-10-16 11:07:44,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b6f427d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:07:44, skipping insertion in model container [2020-10-16 11:07:44,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:07:44" (1/1) ... [2020-10-16 11:07:44,960 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 11:07:45,011 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 11:07:45,582 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:07:45,601 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 11:07:45,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:07:45,788 INFO L208 MainTranslator]: Completed translation [2020-10-16 11:07:45,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:07:45 WrapperNode [2020-10-16 11:07:45,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 11:07:45,789 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 11:07:45,790 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 11:07:45,790 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 11:07:45,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:07:45" (1/1) ... [2020-10-16 11:07:45,821 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:07:45" (1/1) ... [2020-10-16 11:07:45,854 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 11:07:45,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 11:07:45,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 11:07:45,855 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 11:07:45,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:07:45" (1/1) ... [2020-10-16 11:07:45,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:07:45" (1/1) ... [2020-10-16 11:07:45,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:07:45" (1/1) ... [2020-10-16 11:07:45,871 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:07:45" (1/1) ... [2020-10-16 11:07:45,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:07:45" (1/1) ... [2020-10-16 11:07:45,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:07:45" (1/1) ... [2020-10-16 11:07:45,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:07:45" (1/1) ... [2020-10-16 11:07:45,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 11:07:45,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 11:07:45,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 11:07:45,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 11:07:45,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:07:45" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 11:07:45,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 11:07:45,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 11:07:45,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 11:07:45,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 11:07:45,985 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 11:07:45,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 11:07:45,986 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 11:07:45,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 11:07:45,986 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 11:07:45,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 11:07:45,987 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 11:07:45,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 11:07:45,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 11:07:45,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 11:07:45,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 11:07:45,990 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 11:07:48,375 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 11:07:48,376 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 11:07:48,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:07:48 BoogieIcfgContainer [2020-10-16 11:07:48,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 11:07:48,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 11:07:48,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 11:07:48,383 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 11:07:48,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:07:44" (1/3) ... [2020-10-16 11:07:48,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cda13a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:07:48, skipping insertion in model container [2020-10-16 11:07:48,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:07:45" (2/3) ... [2020-10-16 11:07:48,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cda13a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:07:48, skipping insertion in model container [2020-10-16 11:07:48,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:07:48" (3/3) ... [2020-10-16 11:07:48,386 INFO L111 eAbstractionObserver]: Analyzing ICFG mix013_power.oepc.i [2020-10-16 11:07:48,397 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 11:07:48,398 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 11:07:48,406 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 11:07:48,407 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 11:07:48,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,442 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,442 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,442 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,442 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,443 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,445 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,445 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,446 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,446 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,446 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,446 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,446 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,447 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,447 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,447 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,447 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,448 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,448 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,449 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,449 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,451 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,452 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,452 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,453 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,453 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,453 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,453 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,453 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,453 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,454 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,454 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,454 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,454 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,454 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,454 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,460 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,460 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,462 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,462 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,468 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,468 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,469 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,471 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,472 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,475 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,475 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,478 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,478 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,479 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,479 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,479 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,479 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,479 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,480 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,480 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,480 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,480 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,480 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,480 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,484 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:07:48,485 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 11:07:48,499 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 11:07:48,521 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 11:07:48,522 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 11:07:48,522 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 11:07:48,522 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 11:07:48,522 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 11:07:48,522 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 11:07:48,522 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 11:07:48,523 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 11:07:48,537 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 11:07:48,539 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 116 transitions, 252 flow [2020-10-16 11:07:48,542 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 116 transitions, 252 flow [2020-10-16 11:07:48,544 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 252 flow [2020-10-16 11:07:48,596 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2020-10-16 11:07:48,596 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 11:07:48,602 INFO L80 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2020-10-16 11:07:48,606 INFO L117 LiptonReduction]: Number of co-enabled transitions 2832 [2020-10-16 11:07:48,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:48,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:48,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:48,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:48,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:48,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:48,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:48,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:48,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:48,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:48,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:48,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:48,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:48,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:48,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:48,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:49,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:07:49,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:07:49,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:07:49,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:49,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:49,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:49,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:07:49,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:07:49,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:07:49,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:07:49,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:07:49,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:07:49,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:07:49,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:49,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:07:49,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:49,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:07:49,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:49,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:49,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:49,293 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:49,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:49,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:49,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:49,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:49,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:49,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:49,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:49,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:49,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:49,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:49,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:49,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:49,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:49,590 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-10-16 11:07:49,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:49,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:49,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:49,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:49,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:49,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:49,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:49,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:49,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:49,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:49,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:49,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:49,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:49,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:49,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:49,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:49,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:49,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:49,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:49,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:49,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:49,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:49,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:49,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:49,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:49,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:49,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:49,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:49,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:49,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:49,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:49,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:50,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:50,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:50,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:50,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:50,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:50,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:50,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:50,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:50,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:50,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:50,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:50,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:50,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:50,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:50,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:50,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:50,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:50,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:50,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:50,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:50,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:50,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:50,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:50,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:50,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:50,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:50,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:50,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:50,200 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:50,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:50,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:50,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:50,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:50,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:50,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:07:50,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:07:50,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:07:50,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:07:50,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:07:50,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:07:50,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:07:50,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:50,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:07:50,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:50,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:07:50,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:50,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:07:50,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:07:50,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:07:50,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:50,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:50,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:50,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:50,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:50,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:50,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:50,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:50,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:50,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:50,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:50,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:50,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:50,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:50,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:50,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:50,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:50,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 11:07:50,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:50,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 11:07:50,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:51,344 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2020-10-16 11:07:51,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:51,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:51,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:51,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:51,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:51,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:51,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:51,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:51,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:51,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:51,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:51,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:51,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:51,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:51,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:51,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:51,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:51,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:51,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:51,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:51,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:51,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:51,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:51,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:51,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:51,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:51,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:51,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:51,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:51,759 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:51,760 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:51,761 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:51,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:51,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:51,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:51,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:51,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:51,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:51,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:51,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:51,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:51,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:51,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:51,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:51,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:51,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:51,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:51,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:51,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:51,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:51,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:51,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:51,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:51,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:51,951 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:51,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:51,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:51,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:51,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:51,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:51,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:51,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:51,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:51,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:51,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:51,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:51,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:51,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:52,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:52,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:52,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:52,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:52,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:52,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:52,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:52,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:52,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:52,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:52,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:52,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:52,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:52,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:52,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:52,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:52,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:52,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:52,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:52,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:52,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:52,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:52,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:52,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:52,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:52,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:52,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:52,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:52,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:52,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:52,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:52,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:52,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:07:52,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:07:52,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:07:52,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:52,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:52,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:52,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:07:52,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:07:52,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:07:52,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:07:52,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:07:52,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:07:52,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:07:52,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:52,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:07:52,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:52,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:07:52,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:52,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:52,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:52,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:07:52,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:07:52,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:07:52,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:07:52,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:07:52,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:07:52,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:07:52,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:52,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:07:52,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:52,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:07:52,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:52,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:07:52,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:07:52,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:07:52,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:52,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:52,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:52,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:52,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:52,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:52,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:52,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:52,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:07:52,405 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:52,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:52,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:52,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:07:52,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:07:52,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:52,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:07:52,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:07:53,084 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2020-10-16 11:07:53,228 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-10-16 11:07:53,242 INFO L132 LiptonReduction]: Checked pairs total: 8554 [2020-10-16 11:07:53,242 INFO L134 LiptonReduction]: Total number of compositions: 92 [2020-10-16 11:07:53,250 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 37 transitions, 94 flow [2020-10-16 11:07:53,728 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6926 states. [2020-10-16 11:07:53,731 INFO L276 IsEmpty]: Start isEmpty. Operand 6926 states. [2020-10-16 11:07:53,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-16 11:07:53,738 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:07:53,738 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-16 11:07:53,739 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:07:53,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:07:53,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1206365, now seen corresponding path program 1 times [2020-10-16 11:07:53,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:07:53,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134279785] [2020-10-16 11:07:53,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:07:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:07:54,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:07:54,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134279785] [2020-10-16 11:07:54,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:07:54,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:07:54,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061480652] [2020-10-16 11:07:54,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:07:54,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:07:54,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:07:54,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:07:54,039 INFO L87 Difference]: Start difference. First operand 6926 states. Second operand 3 states. [2020-10-16 11:07:54,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:07:54,289 INFO L93 Difference]: Finished difference Result 5772 states and 23348 transitions. [2020-10-16 11:07:54,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:07:54,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-16 11:07:54,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:07:54,378 INFO L225 Difference]: With dead ends: 5772 [2020-10-16 11:07:54,379 INFO L226 Difference]: Without dead ends: 4872 [2020-10-16 11:07:54,380 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:07:54,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4872 states. [2020-10-16 11:07:54,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4872 to 4872. [2020-10-16 11:07:54,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4872 states. [2020-10-16 11:07:54,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 19508 transitions. [2020-10-16 11:07:54,712 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 19508 transitions. Word has length 3 [2020-10-16 11:07:54,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:07:54,712 INFO L481 AbstractCegarLoop]: Abstraction has 4872 states and 19508 transitions. [2020-10-16 11:07:54,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:07:54,713 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 19508 transitions. [2020-10-16 11:07:54,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 11:07:54,717 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:07:54,718 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:07:54,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 11:07:54,718 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:07:54,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:07:54,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1695924350, now seen corresponding path program 1 times [2020-10-16 11:07:54,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:07:54,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484376600] [2020-10-16 11:07:54,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:07:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:07:54,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:07:54,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484376600] [2020-10-16 11:07:54,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:07:54,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 11:07:54,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228676470] [2020-10-16 11:07:54,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:07:54,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:07:54,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:07:54,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:07:54,838 INFO L87 Difference]: Start difference. First operand 4872 states and 19508 transitions. Second operand 4 states. [2020-10-16 11:07:54,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:07:54,972 INFO L93 Difference]: Finished difference Result 5172 states and 20088 transitions. [2020-10-16 11:07:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:07:54,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-16 11:07:54,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:07:55,014 INFO L225 Difference]: With dead ends: 5172 [2020-10-16 11:07:55,014 INFO L226 Difference]: Without dead ends: 4272 [2020-10-16 11:07:55,015 INFO L677 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-16 11:07:55,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4272 states. [2020-10-16 11:07:55,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4272 to 4272. [2020-10-16 11:07:55,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4272 states. [2020-10-16 11:07:55,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4272 states to 4272 states and 16848 transitions. [2020-10-16 11:07:55,187 INFO L78 Accepts]: Start accepts. Automaton has 4272 states and 16848 transitions. Word has length 12 [2020-10-16 11:07:55,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:07:55,189 INFO L481 AbstractCegarLoop]: Abstraction has 4272 states and 16848 transitions. [2020-10-16 11:07:55,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:07:55,189 INFO L276 IsEmpty]: Start isEmpty. Operand 4272 states and 16848 transitions. [2020-10-16 11:07:55,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 11:07:55,194 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:07:55,194 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:07:55,194 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 11:07:55,195 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:07:55,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:07:55,195 INFO L82 PathProgramCache]: Analyzing trace with hash 625966633, now seen corresponding path program 1 times [2020-10-16 11:07:55,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:07:55,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714298742] [2020-10-16 11:07:55,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:07:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:07:55,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:07:55,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714298742] [2020-10-16 11:07:55,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:07:55,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 11:07:55,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722649416] [2020-10-16 11:07:55,305 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:07:55,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:07:55,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:07:55,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:07:55,306 INFO L87 Difference]: Start difference. First operand 4272 states and 16848 transitions. Second operand 4 states. [2020-10-16 11:07:55,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:07:55,364 INFO L93 Difference]: Finished difference Result 4472 states and 17218 transitions. [2020-10-16 11:07:55,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:07:55,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-16 11:07:55,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:07:55,400 INFO L225 Difference]: With dead ends: 4472 [2020-10-16 11:07:55,400 INFO L226 Difference]: Without dead ends: 3872 [2020-10-16 11:07:55,401 INFO L677 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-16 11:07:55,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3872 states. [2020-10-16 11:07:55,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3872 to 3872. [2020-10-16 11:07:55,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3872 states. [2020-10-16 11:07:55,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3872 states to 3872 states and 15108 transitions. [2020-10-16 11:07:55,658 INFO L78 Accepts]: Start accepts. Automaton has 3872 states and 15108 transitions. Word has length 14 [2020-10-16 11:07:55,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:07:55,659 INFO L481 AbstractCegarLoop]: Abstraction has 3872 states and 15108 transitions. [2020-10-16 11:07:55,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:07:55,659 INFO L276 IsEmpty]: Start isEmpty. Operand 3872 states and 15108 transitions. [2020-10-16 11:07:55,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 11:07:55,664 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:07:55,664 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:07:55,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 11:07:55,664 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:07:55,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:07:55,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1536188806, now seen corresponding path program 1 times [2020-10-16 11:07:55,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:07:55,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456214480] [2020-10-16 11:07:55,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:07:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:07:55,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:07:55,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456214480] [2020-10-16 11:07:55,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:07:55,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:07:55,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526266243] [2020-10-16 11:07:55,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:07:55,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:07:55,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:07:55,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:07:55,748 INFO L87 Difference]: Start difference. First operand 3872 states and 15108 transitions. Second operand 4 states. [2020-10-16 11:07:55,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:07:55,813 INFO L93 Difference]: Finished difference Result 3684 states and 13008 transitions. [2020-10-16 11:07:55,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:07:55,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-16 11:07:55,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:07:55,826 INFO L225 Difference]: With dead ends: 3684 [2020-10-16 11:07:55,827 INFO L226 Difference]: Without dead ends: 2784 [2020-10-16 11:07:55,827 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:07:55,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2020-10-16 11:07:55,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2784. [2020-10-16 11:07:55,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2784 states. [2020-10-16 11:07:55,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 9668 transitions. [2020-10-16 11:07:55,915 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 9668 transitions. Word has length 16 [2020-10-16 11:07:55,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:07:55,915 INFO L481 AbstractCegarLoop]: Abstraction has 2784 states and 9668 transitions. [2020-10-16 11:07:55,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:07:55,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 9668 transitions. [2020-10-16 11:07:55,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 11:07:55,920 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:07:55,921 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-16 11:07:55,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 11:07:55,921 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:07:55,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:07:55,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1632811323, now seen corresponding path program 1 times [2020-10-16 11:07:55,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:07:55,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986811743] [2020-10-16 11:07:55,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:07:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:07:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:07:56,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986811743] [2020-10-16 11:07:56,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:07:56,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:07:56,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362957520] [2020-10-16 11:07:56,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:07:56,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:07:56,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:07:56,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:07:56,052 INFO L87 Difference]: Start difference. First operand 2784 states and 9668 transitions. Second operand 5 states. [2020-10-16 11:07:56,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:07:56,125 INFO L93 Difference]: Finished difference Result 2228 states and 7144 transitions. [2020-10-16 11:07:56,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:07:56,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-10-16 11:07:56,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:07:56,133 INFO L225 Difference]: With dead ends: 2228 [2020-10-16 11:07:56,133 INFO L226 Difference]: Without dead ends: 1728 [2020-10-16 11:07:56,134 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:07:56,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2020-10-16 11:07:56,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1728. [2020-10-16 11:07:56,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1728 states. [2020-10-16 11:07:56,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 5444 transitions. [2020-10-16 11:07:56,181 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 5444 transitions. Word has length 19 [2020-10-16 11:07:56,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:07:56,182 INFO L481 AbstractCegarLoop]: Abstraction has 1728 states and 5444 transitions. [2020-10-16 11:07:56,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:07:56,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 5444 transitions. [2020-10-16 11:07:56,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:07:56,186 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:07:56,186 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] [2020-10-16 11:07:56,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 11:07:56,187 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:07:56,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:07:56,187 INFO L82 PathProgramCache]: Analyzing trace with hash 999274663, now seen corresponding path program 1 times [2020-10-16 11:07:56,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:07:56,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858372470] [2020-10-16 11:07:56,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:07:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:07:56,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:07:56,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858372470] [2020-10-16 11:07:56,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:07:56,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:07:56,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681261456] [2020-10-16 11:07:56,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:07:56,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:07:56,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:07:56,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:07:56,413 INFO L87 Difference]: Start difference. First operand 1728 states and 5444 transitions. Second operand 6 states. [2020-10-16 11:07:56,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:07:56,511 INFO L93 Difference]: Finished difference Result 1480 states and 4661 transitions. [2020-10-16 11:07:56,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:07:56,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-10-16 11:07:56,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:07:56,518 INFO L225 Difference]: With dead ends: 1480 [2020-10-16 11:07:56,518 INFO L226 Difference]: Without dead ends: 1340 [2020-10-16 11:07:56,518 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:07:56,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2020-10-16 11:07:56,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1340. [2020-10-16 11:07:56,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2020-10-16 11:07:56,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 4280 transitions. [2020-10-16 11:07:56,554 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 4280 transitions. Word has length 22 [2020-10-16 11:07:56,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:07:56,555 INFO L481 AbstractCegarLoop]: Abstraction has 1340 states and 4280 transitions. [2020-10-16 11:07:56,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:07:56,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 4280 transitions. [2020-10-16 11:07:56,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-16 11:07:56,559 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:07:56,560 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] [2020-10-16 11:07:56,560 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 11:07:56,560 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:07:56,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:07:56,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1928785253, now seen corresponding path program 1 times [2020-10-16 11:07:56,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:07:56,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686240983] [2020-10-16 11:07:56,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:07:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:07:56,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:07:56,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686240983] [2020-10-16 11:07:56,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:07:56,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:07:56,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063795740] [2020-10-16 11:07:56,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:07:56,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:07:56,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:07:56,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:07:56,685 INFO L87 Difference]: Start difference. First operand 1340 states and 4280 transitions. Second operand 5 states. [2020-10-16 11:07:56,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:07:56,733 INFO L93 Difference]: Finished difference Result 2021 states and 6333 transitions. [2020-10-16 11:07:56,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:07:56,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-10-16 11:07:56,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:07:56,739 INFO L225 Difference]: With dead ends: 2021 [2020-10-16 11:07:56,739 INFO L226 Difference]: Without dead ends: 1346 [2020-10-16 11:07:56,740 INFO L677 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-16 11:07:56,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-10-16 11:07:56,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1340. [2020-10-16 11:07:56,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2020-10-16 11:07:56,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 4068 transitions. [2020-10-16 11:07:56,775 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 4068 transitions. Word has length 26 [2020-10-16 11:07:56,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:07:56,775 INFO L481 AbstractCegarLoop]: Abstraction has 1340 states and 4068 transitions. [2020-10-16 11:07:56,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:07:56,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 4068 transitions. [2020-10-16 11:07:56,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-16 11:07:56,780 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:07:56,780 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] [2020-10-16 11:07:56,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 11:07:56,780 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:07:56,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:07:56,781 INFO L82 PathProgramCache]: Analyzing trace with hash -385114213, now seen corresponding path program 1 times [2020-10-16 11:07:56,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:07:56,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925083389] [2020-10-16 11:07:56,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:07:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:07:56,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:07:56,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925083389] [2020-10-16 11:07:56,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:07:56,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:07:56,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302969745] [2020-10-16 11:07:56,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:07:56,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:07:56,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:07:56,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:07:56,964 INFO L87 Difference]: Start difference. First operand 1340 states and 4068 transitions. Second operand 5 states. [2020-10-16 11:07:57,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:07:57,006 INFO L93 Difference]: Finished difference Result 1841 states and 5480 transitions. [2020-10-16 11:07:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:07:57,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-10-16 11:07:57,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:07:57,011 INFO L225 Difference]: With dead ends: 1841 [2020-10-16 11:07:57,011 INFO L226 Difference]: Without dead ends: 1246 [2020-10-16 11:07:57,012 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-16 11:07:57,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2020-10-16 11:07:57,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1240. [2020-10-16 11:07:57,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1240 states. [2020-10-16 11:07:57,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 3616 transitions. [2020-10-16 11:07:57,042 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 3616 transitions. Word has length 26 [2020-10-16 11:07:57,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:07:57,043 INFO L481 AbstractCegarLoop]: Abstraction has 1240 states and 3616 transitions. [2020-10-16 11:07:57,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:07:57,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 3616 transitions. [2020-10-16 11:07:57,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-16 11:07:57,047 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:07:57,047 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] [2020-10-16 11:07:57,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 11:07:57,047 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:07:57,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:07:57,048 INFO L82 PathProgramCache]: Analyzing trace with hash -2037503795, now seen corresponding path program 2 times [2020-10-16 11:07:57,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:07:57,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269853055] [2020-10-16 11:07:57,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:07:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:07:57,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:07:57,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269853055] [2020-10-16 11:07:57,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:07:57,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:07:57,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705761750] [2020-10-16 11:07:57,165 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 11:07:57,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:07:57,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 11:07:57,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:07:57,166 INFO L87 Difference]: Start difference. First operand 1240 states and 3616 transitions. Second operand 7 states. [2020-10-16 11:07:57,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:07:57,254 INFO L93 Difference]: Finished difference Result 1195 states and 3526 transitions. [2020-10-16 11:07:57,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 11:07:57,255 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-10-16 11:07:57,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:07:57,258 INFO L225 Difference]: With dead ends: 1195 [2020-10-16 11:07:57,259 INFO L226 Difference]: Without dead ends: 656 [2020-10-16 11:07:57,259 INFO L677 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-16 11:07:57,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-10-16 11:07:57,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2020-10-16 11:07:57,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2020-10-16 11:07:57,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1932 transitions. [2020-10-16 11:07:57,275 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1932 transitions. Word has length 26 [2020-10-16 11:07:57,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:07:57,276 INFO L481 AbstractCegarLoop]: Abstraction has 656 states and 1932 transitions. [2020-10-16 11:07:57,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 11:07:57,276 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1932 transitions. [2020-10-16 11:07:57,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-16 11:07:57,278 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:07:57,278 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:07:57,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 11:07:57,279 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:07:57,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:07:57,279 INFO L82 PathProgramCache]: Analyzing trace with hash 331782881, now seen corresponding path program 1 times [2020-10-16 11:07:57,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:07:57,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43572237] [2020-10-16 11:07:57,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:07:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:07:57,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:07:57,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43572237] [2020-10-16 11:07:57,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:07:57,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 11:07:57,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680849524] [2020-10-16 11:07:57,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 11:07:57,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:07:57,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 11:07:57,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:07:57,516 INFO L87 Difference]: Start difference. First operand 656 states and 1932 transitions. Second operand 9 states. [2020-10-16 11:07:57,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:07:57,766 INFO L93 Difference]: Finished difference Result 1129 states and 3270 transitions. [2020-10-16 11:07:57,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 11:07:57,767 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-10-16 11:07:57,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:07:57,771 INFO L225 Difference]: With dead ends: 1129 [2020-10-16 11:07:57,771 INFO L226 Difference]: Without dead ends: 738 [2020-10-16 11:07:57,771 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-10-16 11:07:57,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2020-10-16 11:07:57,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 566. [2020-10-16 11:07:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2020-10-16 11:07:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 1539 transitions. [2020-10-16 11:07:57,793 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 1539 transitions. Word has length 30 [2020-10-16 11:07:57,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:07:57,794 INFO L481 AbstractCegarLoop]: Abstraction has 566 states and 1539 transitions. [2020-10-16 11:07:57,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 11:07:57,795 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 1539 transitions. [2020-10-16 11:07:57,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-16 11:07:57,797 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:07:57,797 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:07:57,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 11:07:57,798 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:07:57,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:07:57,798 INFO L82 PathProgramCache]: Analyzing trace with hash -218749791, now seen corresponding path program 2 times [2020-10-16 11:07:57,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:07:57,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056978522] [2020-10-16 11:07:57,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:07:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:07:58,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:07:58,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056978522] [2020-10-16 11:07:58,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:07:58,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 11:07:58,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055672384] [2020-10-16 11:07:58,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 11:07:58,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:07:58,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 11:07:58,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:07:58,138 INFO L87 Difference]: Start difference. First operand 566 states and 1539 transitions. Second operand 9 states. [2020-10-16 11:07:58,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:07:58,411 INFO L93 Difference]: Finished difference Result 806 states and 2187 transitions. [2020-10-16 11:07:58,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 11:07:58,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-10-16 11:07:58,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:07:58,414 INFO L225 Difference]: With dead ends: 806 [2020-10-16 11:07:58,414 INFO L226 Difference]: Without dead ends: 683 [2020-10-16 11:07:58,415 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-16 11:07:58,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2020-10-16 11:07:58,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 546. [2020-10-16 11:07:58,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2020-10-16 11:07:58,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1463 transitions. [2020-10-16 11:07:58,430 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1463 transitions. Word has length 30 [2020-10-16 11:07:58,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:07:58,430 INFO L481 AbstractCegarLoop]: Abstraction has 546 states and 1463 transitions. [2020-10-16 11:07:58,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 11:07:58,431 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1463 transitions. [2020-10-16 11:07:58,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-16 11:07:58,433 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:07:58,433 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:07:58,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 11:07:58,433 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:07:58,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:07:58,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1503974241, now seen corresponding path program 3 times [2020-10-16 11:07:58,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:07:58,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597795487] [2020-10-16 11:07:58,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:07:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:07:58,554 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:07:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:07:58,608 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:07:58,652 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 11:07:58,652 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 11:07:58,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 11:07:58,683 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,685 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,685 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,685 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,685 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,685 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,686 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,686 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,686 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,686 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,686 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,687 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,688 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,688 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,688 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,688 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,688 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,688 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,689 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,689 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,689 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,690 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,690 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,690 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,690 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,690 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,690 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,691 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,691 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,691 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,691 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,691 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,691 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,692 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,692 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,692 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,692 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,692 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,693 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,693 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,693 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,693 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,693 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,694 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,694 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,694 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,694 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,694 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,694 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,695 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,695 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,695 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,695 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,695 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,696 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,696 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,696 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,696 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,696 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,697 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,697 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,697 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,698 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,698 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,698 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,698 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,698 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,698 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,698 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,699 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:07:58,699 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:07:58,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:07:58 BasicIcfg [2020-10-16 11:07:58,855 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 11:07:58,858 INFO L168 Benchmark]: Toolchain (without parser) took 13914.56 ms. Allocated memory was 140.5 MB in the beginning and 463.5 MB in the end (delta: 323.0 MB). Free memory was 102.2 MB in the beginning and 58.0 MB in the end (delta: 44.2 MB). Peak memory consumption was 367.2 MB. Max. memory is 7.1 GB. [2020-10-16 11:07:58,858 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 11:07:58,859 INFO L168 Benchmark]: CACSL2BoogieTranslator took 845.56 ms. Allocated memory was 140.5 MB in the beginning and 201.9 MB in the end (delta: 61.3 MB). Free memory was 102.0 MB in the beginning and 153.4 MB in the end (delta: -51.4 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2020-10-16 11:07:58,860 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.88 ms. Allocated memory is still 201.9 MB. Free memory was 153.4 MB in the beginning and 150.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-16 11:07:58,863 INFO L168 Benchmark]: Boogie Preprocessor took 64.37 ms. Allocated memory is still 201.9 MB. Free memory was 150.7 MB in the beginning and 148.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-16 11:07:58,864 INFO L168 Benchmark]: RCFGBuilder took 2451.70 ms. Allocated memory was 201.9 MB in the beginning and 246.9 MB in the end (delta: 45.1 MB). Free memory was 148.1 MB in the beginning and 132.8 MB in the end (delta: 15.3 MB). Peak memory consumption was 101.5 MB. Max. memory is 7.1 GB. [2020-10-16 11:07:58,864 INFO L168 Benchmark]: TraceAbstraction took 10475.93 ms. Allocated memory was 246.9 MB in the beginning and 463.5 MB in the end (delta: 216.5 MB). Free memory was 132.8 MB in the beginning and 58.0 MB in the end (delta: 74.7 MB). Peak memory consumption was 291.3 MB. Max. memory is 7.1 GB. [2020-10-16 11:07:58,875 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 845.56 ms. Allocated memory was 140.5 MB in the beginning and 201.9 MB in the end (delta: 61.3 MB). Free memory was 102.0 MB in the beginning and 153.4 MB in the end (delta: -51.4 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.88 ms. Allocated memory is still 201.9 MB. Free memory was 153.4 MB in the beginning and 150.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.37 ms. Allocated memory is still 201.9 MB. Free memory was 150.7 MB in the beginning and 148.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2451.70 ms. Allocated memory was 201.9 MB in the beginning and 246.9 MB in the end (delta: 45.1 MB). Free memory was 148.1 MB in the beginning and 132.8 MB in the end (delta: 15.3 MB). Peak memory consumption was 101.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10475.93 ms. Allocated memory was 246.9 MB in the beginning and 463.5 MB in the end (delta: 216.5 MB). Free memory was 132.8 MB in the beginning and 58.0 MB in the end (delta: 74.7 MB). Peak memory consumption was 291.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1999 VarBasedMoverChecksPositive, 95 VarBasedMoverChecksNegative, 31 SemBasedMoverChecksPositive, 64 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 322 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.7s, 127 PlacesBefore, 49 PlacesAfterwards, 116 TransitionsBefore, 37 TransitionsAfterwards, 2832 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 8554 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p1_EAX = 0; [L705] 0 int __unbuffered_p1_EBX = 0; [L707] 0 int __unbuffered_p2_EAX = 0; [L709] 0 int __unbuffered_p3_EAX = 0; [L711] 0 int __unbuffered_p3_EBX = 0; [L713] 0 int a = 0; [L714] 0 _Bool a$flush_delayed; [L715] 0 int a$mem_tmp; [L716] 0 _Bool a$r_buff0_thd0; [L717] 0 _Bool a$r_buff0_thd1; [L718] 0 _Bool a$r_buff0_thd2; [L719] 0 _Bool a$r_buff0_thd3; [L720] 0 _Bool a$r_buff0_thd4; [L721] 0 _Bool a$r_buff1_thd0; [L722] 0 _Bool a$r_buff1_thd1; [L723] 0 _Bool a$r_buff1_thd2; [L724] 0 _Bool a$r_buff1_thd3; [L725] 0 _Bool a$r_buff1_thd4; [L726] 0 _Bool a$read_delayed; [L727] 0 int *a$read_delayed_var; [L728] 0 int a$w_buff0; [L729] 0 _Bool a$w_buff0_used; [L730] 0 int a$w_buff1; [L731] 0 _Bool a$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L862] 0 pthread_t t321; [L863] FCALL, FORK 0 pthread_create(&t321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L864] 0 pthread_t t322; [L865] FCALL, FORK 0 pthread_create(&t322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t323; [L867] FCALL, FORK 0 pthread_create(&t323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t324; [L869] FCALL, FORK 0 pthread_create(&t324, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L745] 1 a$w_buff1 = a$w_buff0 [L746] 1 a$w_buff0 = 1 [L747] 1 a$w_buff1_used = a$w_buff0_used [L748] 1 a$w_buff0_used = (_Bool)1 [L7] COND FALSE 1 !(!expression) [L750] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L751] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L752] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L753] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L754] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L755] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L758] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L775] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L781] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L798] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L801] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L818] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L804] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L821] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L824] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 4 a$flush_delayed = weak$$choice2 [L827] 4 a$mem_tmp = a [L828] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L828] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1 [L828] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L828] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L829] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L829] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L830] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L830] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L831] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L831] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L832] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L833] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L833] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L834] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 __unbuffered_p3_EBX = a [L836] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L836] 4 a = a$flush_delayed ? a$mem_tmp : a [L837] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=1, y=1, z=1] [L761] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L761] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L762] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L762] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L763] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L763] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L764] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L764] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L765] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L765] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L768] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L770] 1 return 0; [L840] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L840] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L841] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L841] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L842] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L842] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L843] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L843] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L844] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L844] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L875] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L875] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L875] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L875] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L876] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L876] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L877] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L877] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L878] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L878] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L879] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L879] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L882] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 115 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.1s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 518 SDtfs, 642 SDslu, 1272 SDs, 0 SdLazy, 415 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6926occurred 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: 1.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 321 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 213 ConstructedInterpolants, 0 QuantifiedInterpolants, 31898 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...