/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/pthread-wmm/safe003_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 11:05:45,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 11:05:45,024 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 11:05:45,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 11:05:45,071 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 11:05:45,076 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 11:05:45,080 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 11:05:45,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 11:05:45,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 11:05:45,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 11:05:45,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 11:05:45,103 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 11:05:45,103 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 11:05:45,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 11:05:45,109 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 11:05:45,112 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 11:05:45,113 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 11:05:45,117 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 11:05:45,124 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 11:05:45,132 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 11:05:45,134 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 11:05:45,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 11:05:45,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 11:05:45,142 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 11:05:45,175 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 11:05:45,176 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 11:05:45,176 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 11:05:45,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 11:05:45,180 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 11:05:45,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 11:05:45,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 11:05:45,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 11:05:45,187 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 11:05:45,188 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 11:05:45,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 11:05:45,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 11:05:45,192 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 11:05:45,192 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 11:05:45,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 11:05:45,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 11:05:45,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 11:05:45,195 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 11:05:45,256 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 11:05:45,257 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 11:05:45,262 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 11:05:45,262 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 11:05:45,262 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 11:05:45,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 11:05:45,263 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 11:05:45,263 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 11:05:45,263 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 11:05:45,264 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 11:05:45,265 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 11:05:45,265 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 11:05:45,265 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 11:05:45,266 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 11:05:45,266 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 11:05:45,266 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 11:05:45,266 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 11:05:45,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 11:05:45,267 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 11:05:45,267 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 11:05:45,268 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 11:05:45,268 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 11:05:45,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 11:05:45,268 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 11:05:45,268 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 11:05:45,269 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-22 11:05:45,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 11:05:45,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 11:05:45,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 11:05:45,704 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 11:05:45,705 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 11:05:45,706 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe003_rmo.oepc.i [2020-12-22 11:05:45,798 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5b3611f4/914e1f52a18743f8ae5f0c0f236d86cf/FLAG2b9e72eba [2020-12-22 11:05:46,735 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 11:05:46,735 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe003_rmo.oepc.i [2020-12-22 11:05:46,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5b3611f4/914e1f52a18743f8ae5f0c0f236d86cf/FLAG2b9e72eba [2020-12-22 11:05:46,923 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5b3611f4/914e1f52a18743f8ae5f0c0f236d86cf [2020-12-22 11:05:46,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 11:05:46,935 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 11:05:46,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 11:05:46,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 11:05:46,942 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 11:05:46,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 11:05:46" (1/1) ... [2020-12-22 11:05:46,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@401e0d72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:05:46, skipping insertion in model container [2020-12-22 11:05:46,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 11:05:46" (1/1) ... [2020-12-22 11:05:46,956 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 11:05:47,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 11:05:47,325 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe003_rmo.oepc.i[950,963] [2020-12-22 11:05:47,783 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 11:05:47,793 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 11:05:47,809 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe003_rmo.oepc.i[950,963] [2020-12-22 11:05:47,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 11:05:48,021 INFO L208 MainTranslator]: Completed translation [2020-12-22 11:05:48,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:05:48 WrapperNode [2020-12-22 11:05:48,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 11:05:48,024 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 11:05:48,024 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 11:05:48,024 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 11:05:48,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:05:48" (1/1) ... [2020-12-22 11:05:48,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:05:48" (1/1) ... [2020-12-22 11:05:48,135 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 11:05:48,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 11:05:48,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 11:05:48,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 11:05:48,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:05:48" (1/1) ... [2020-12-22 11:05:48,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:05:48" (1/1) ... [2020-12-22 11:05:48,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:05:48" (1/1) ... [2020-12-22 11:05:48,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:05:48" (1/1) ... [2020-12-22 11:05:48,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:05:48" (1/1) ... [2020-12-22 11:05:48,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:05:48" (1/1) ... [2020-12-22 11:05:48,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:05:48" (1/1) ... [2020-12-22 11:05:48,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 11:05:48,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 11:05:48,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 11:05:48,220 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 11:05:48,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:05:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 11:05:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-22 11:05:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-22 11:05:48,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 11:05:48,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-22 11:05:48,341 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-22 11:05:48,341 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-22 11:05:48,341 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-22 11:05:48,341 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-22 11:05:48,342 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-22 11:05:48,342 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-22 11:05:48,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 11:05:48,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-22 11:05:48,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 11:05:48,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 11:05:48,345 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-22 11:05:51,669 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 11:05:51,670 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-22 11:05:51,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:05:51 BoogieIcfgContainer [2020-12-22 11:05:51,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 11:05:51,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 11:05:51,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 11:05:51,679 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 11:05:51,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 11:05:46" (1/3) ... [2020-12-22 11:05:51,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c6cf7ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 11:05:51, skipping insertion in model container [2020-12-22 11:05:51,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:05:48" (2/3) ... [2020-12-22 11:05:51,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c6cf7ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 11:05:51, skipping insertion in model container [2020-12-22 11:05:51,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:05:51" (3/3) ... [2020-12-22 11:05:51,682 INFO L111 eAbstractionObserver]: Analyzing ICFG safe003_rmo.oepc.i [2020-12-22 11:05:51,690 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-22 11:05:51,690 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 11:05:51,696 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-22 11:05:51,697 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-22 11:05:51,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,742 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,742 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,742 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,743 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,743 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,743 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,744 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,744 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,749 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,750 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,750 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,750 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,755 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,755 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,755 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,756 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,767 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,767 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,767 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,767 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,767 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,767 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,768 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,768 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,768 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,768 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,768 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,768 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,769 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,769 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,769 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,769 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,769 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,769 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,779 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,779 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,779 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,783 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,783 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,783 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,783 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,783 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,783 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,784 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,784 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,784 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,784 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,784 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,784 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,785 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,785 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,787 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,787 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,788 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,788 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,788 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,788 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,788 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,791 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,791 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,791 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,795 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,795 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,796 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,797 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,798 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,805 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,805 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,805 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,805 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,805 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,805 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,807 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,809 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:05:51,812 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-22 11:05:51,834 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-22 11:05:51,857 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 11:05:51,858 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 11:05:51,858 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 11:05:51,858 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 11:05:51,858 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 11:05:51,858 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 11:05:51,858 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 11:05:51,859 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 11:05:51,872 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-22 11:05:51,874 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 98 transitions, 211 flow [2020-12-22 11:05:51,877 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 98 transitions, 211 flow [2020-12-22 11:05:51,879 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 211 flow [2020-12-22 11:05:51,930 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2020-12-22 11:05:51,930 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-22 11:05:51,935 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-12-22 11:05:51,939 INFO L116 LiptonReduction]: Number of co-enabled transitions 1694 [2020-12-22 11:05:52,018 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:05:52,019 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:05:52,021 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:05:52,021 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:05:52,026 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:05:52,027 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:05:52,032 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:05:52,033 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:05:52,071 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:05:52,071 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:05:52,072 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:05:52,073 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:05:52,077 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:05:52,078 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:05:52,082 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:05:52,082 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:05:52,746 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 11:05:52,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:05:52,749 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 11:05:52,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:05:52,790 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-22 11:05:52,790 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:05:52,792 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:05:52,793 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:05:52,799 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-22 11:05:52,800 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:05:52,888 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 11:05:52,889 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:05:52,893 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 11:05:52,895 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:05:53,967 WARN L197 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2020-12-22 11:05:54,392 WARN L197 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2020-12-22 11:05:56,339 WARN L197 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 312 DAG size of output: 267 [2020-12-22 11:05:57,202 WARN L197 SmtUtils]: Spent 858.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2020-12-22 11:05:57,553 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:05:57,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:05:57,554 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:05:57,555 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:05:57,557 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:05:57,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:05:57,560 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:05:57,561 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:05:57,587 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:05:57,588 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:05:57,589 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:05:57,589 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:05:57,592 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:05:57,592 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:05:57,595 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:05:57,595 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:05:57,635 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:05:57,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:05:57,636 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:05:57,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:05:57,640 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:05:57,640 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:05:57,643 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:05:57,643 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:05:57,667 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:05:57,667 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:05:57,668 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:05:57,668 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:05:57,670 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:05:57,671 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:05:57,673 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:05:57,674 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:05:57,793 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:05:57,793 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:05:57,795 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:05:57,796 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:05:57,797 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-22 11:05:57,797 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:05:57,798 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:05:57,799 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:05:57,802 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:05:57,802 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:05:57,804 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:05:57,804 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:05:57,806 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:05:57,806 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:05:57,891 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:05:57,891 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 11:05:57,895 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:05:57,896 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:05:57,970 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:05:57,971 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 11:05:57,974 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:05:57,974 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:05:58,018 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:05:58,019 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:05:58,064 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:05:58,065 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:05:58,066 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-22 11:05:58,067 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:05:58,068 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:05:58,069 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:05:58,072 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:05:58,073 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:05:58,074 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:05:58,075 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:05:58,076 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:05:58,077 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:05:59,123 WARN L197 SmtUtils]: Spent 996.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 175 [2020-12-22 11:05:59,533 WARN L197 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2020-12-22 11:06:01,581 WARN L197 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 299 DAG size of output: 255 [2020-12-22 11:06:02,481 WARN L197 SmtUtils]: Spent 884.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2020-12-22 11:06:02,574 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:02,575 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:02,576 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:02,576 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:02,578 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:02,578 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:02,580 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:02,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:02,601 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:02,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:02,602 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:02,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:02,604 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:02,604 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:02,606 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:02,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:02,687 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:02,687 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:02,689 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:06:02,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:02,691 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-22 11:06:02,692 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:02,693 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:06:02,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:02,695 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:02,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:02,697 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:02,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:02,699 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:02,699 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:02,750 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:02,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 11:06:02,753 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:02,754 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:02,789 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:02,790 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:02,791 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:02,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:02,793 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:02,793 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:02,795 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:02,796 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:02,814 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:02,815 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:02,815 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:02,816 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:02,817 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:02,818 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:02,820 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:02,820 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:02,854 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:02,854 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:02,855 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:02,856 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:02,857 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:02,858 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:02,860 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:02,860 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:02,901 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:02,901 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:02,902 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:02,902 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:02,904 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:02,904 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:02,906 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:02,907 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:03,116 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-22 11:06:03,117 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:03,424 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:03,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:03,428 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:06:03,428 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:03,429 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-22 11:06:03,430 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:03,431 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:03,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:03,433 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:03,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:03,434 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:03,435 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:03,485 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:03,486 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 11:06:03,488 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:03,489 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:03,802 WARN L197 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-12-22 11:06:04,456 WARN L197 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2020-12-22 11:06:04,682 WARN L197 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-22 11:06:05,080 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:05,080 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:05,081 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:05,081 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:05,083 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:05,083 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:05,085 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:05,086 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:05,108 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:05,109 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:05,109 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:05,109 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:05,111 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:05,112 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:05,114 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:05,114 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:05,151 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:05,152 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:05,153 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:05,153 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:05,155 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:05,156 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:05,158 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:05,158 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:05,181 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:05,182 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:05,182 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:05,183 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:05,184 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:05,185 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:05,187 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:05,188 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:05,248 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:05,249 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 11:06:05,252 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:05,252 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:05,286 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:05,287 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:05,294 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:06:05,295 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:05,296 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-22 11:06:05,296 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:05,298 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:05,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:05,300 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:05,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:05,302 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:05,302 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:05,348 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 11:06:05,348 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:05,349 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 11:06:05,350 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:05,379 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 11:06:05,379 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:05,380 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 11:06:05,381 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:05,458 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:05,458 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:05,462 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:06:05,463 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:05,464 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-22 11:06:05,464 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:05,466 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:05,466 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:05,467 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:05,467 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:05,468 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:05,469 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:05,519 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:05,519 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 11:06:05,522 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:05,522 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:05,583 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:05,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 11:06:05,587 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:05,587 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:05,675 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:05,676 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:05,687 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:06:05,687 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:05,689 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-22 11:06:05,689 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:05,690 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:06:05,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:05,692 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:05,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:05,695 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:05,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:05,696 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:05,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:05,768 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-22 11:06:05,769 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:06,055 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:06,055 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:06,056 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:06,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:06,058 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:06,058 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:06,060 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:06,060 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:06,085 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:06,085 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:06,086 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:06,086 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:06,088 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:06,088 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:06,090 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:06,090 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:06,156 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:06,156 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:06,158 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:06:06,158 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:06,160 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-22 11:06:06,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:06,161 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:06:06,161 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:06,163 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:06,163 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:06,165 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:06,165 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:06,166 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:06,167 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:06,214 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:06,214 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 11:06:06,217 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:06,217 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:06,252 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:06,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:06,254 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:06,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:06,255 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:06,255 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:06,257 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:06,258 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:06,278 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:06,279 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:06,279 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:06,280 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:06,281 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:06,282 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:06,284 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:06,284 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:06,360 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:06,361 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:06,362 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:06:06,362 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:06,363 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-22 11:06:06,363 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:06,365 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:06,365 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:06,366 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:06,366 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:06,367 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:06,367 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:06,405 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:06,405 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 11:06:06,407 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:06,407 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:06,857 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-12-22 11:06:07,015 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-12-22 11:06:08,069 WARN L197 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-12-22 11:06:08,286 WARN L197 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-12-22 11:06:08,691 WARN L197 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-12-22 11:06:08,891 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-12-22 11:06:08,898 INFO L131 LiptonReduction]: Checked pairs total: 4531 [2020-12-22 11:06:08,898 INFO L133 LiptonReduction]: Total number of compositions: 80 [2020-12-22 11:06:08,906 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-12-22 11:06:09,002 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 974 states. [2020-12-22 11:06:09,004 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states. [2020-12-22 11:06:09,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-22 11:06:09,010 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:09,011 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-22 11:06:09,012 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:09,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:09,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1702306, now seen corresponding path program 1 times [2020-12-22 11:06:09,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:09,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498306444] [2020-12-22 11:06:09,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:09,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:09,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498306444] [2020-12-22 11:06:09,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:09,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-22 11:06:09,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127624166] [2020-12-22 11:06:09,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 11:06:09,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:09,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 11:06:09,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 11:06:09,390 INFO L87 Difference]: Start difference. First operand 974 states. Second operand 3 states. [2020-12-22 11:06:09,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:09,527 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-12-22 11:06:09,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 11:06:09,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-22 11:06:09,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:09,564 INFO L225 Difference]: With dead ends: 812 [2020-12-22 11:06:09,564 INFO L226 Difference]: Without dead ends: 687 [2020-12-22 11:06:09,566 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-12-22 11:06:09,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-12-22 11:06:09,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2020-12-22 11:06:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2020-12-22 11:06:09,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2020-12-22 11:06:09,713 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 3 [2020-12-22 11:06:09,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:09,714 INFO L481 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2020-12-22 11:06:09,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 11:06:09,714 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2020-12-22 11:06:09,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-22 11:06:09,717 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:09,717 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:06:09,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 11:06:09,717 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:09,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:09,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1462880072, now seen corresponding path program 1 times [2020-12-22 11:06:09,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:09,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069443267] [2020-12-22 11:06:09,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:09,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:09,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069443267] [2020-12-22 11:06:09,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:09,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 11:06:09,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612543513] [2020-12-22 11:06:09,939 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 11:06:09,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:09,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 11:06:09,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 11:06:09,941 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand 4 states. [2020-12-22 11:06:09,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:09,993 INFO L93 Difference]: Finished difference Result 712 states and 2140 transitions. [2020-12-22 11:06:09,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 11:06:09,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-22 11:06:09,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:10,000 INFO L225 Difference]: With dead ends: 712 [2020-12-22 11:06:10,000 INFO L226 Difference]: Without dead ends: 587 [2020-12-22 11:06:10,001 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-12-22 11:06:10,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-12-22 11:06:10,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2020-12-22 11:06:10,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2020-12-22 11:06:10,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1790 transitions. [2020-12-22 11:06:10,024 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1790 transitions. Word has length 10 [2020-12-22 11:06:10,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:10,025 INFO L481 AbstractCegarLoop]: Abstraction has 587 states and 1790 transitions. [2020-12-22 11:06:10,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 11:06:10,025 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1790 transitions. [2020-12-22 11:06:10,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-22 11:06:10,028 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:10,028 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:06:10,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 11:06:10,029 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:10,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:10,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1388931770, now seen corresponding path program 1 times [2020-12-22 11:06:10,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:10,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103001161] [2020-12-22 11:06:10,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:10,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:10,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103001161] [2020-12-22 11:06:10,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:10,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 11:06:10,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517323502] [2020-12-22 11:06:10,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 11:06:10,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:10,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 11:06:10,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 11:06:10,240 INFO L87 Difference]: Start difference. First operand 587 states and 1790 transitions. Second operand 4 states. [2020-12-22 11:06:10,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:10,283 INFO L93 Difference]: Finished difference Result 632 states and 1871 transitions. [2020-12-22 11:06:10,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 11:06:10,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-22 11:06:10,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:10,289 INFO L225 Difference]: With dead ends: 632 [2020-12-22 11:06:10,289 INFO L226 Difference]: Without dead ends: 557 [2020-12-22 11:06:10,290 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-12-22 11:06:10,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-12-22 11:06:10,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2020-12-22 11:06:10,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2020-12-22 11:06:10,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1686 transitions. [2020-12-22 11:06:10,312 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1686 transitions. Word has length 12 [2020-12-22 11:06:10,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:10,313 INFO L481 AbstractCegarLoop]: Abstraction has 557 states and 1686 transitions. [2020-12-22 11:06:10,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 11:06:10,313 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1686 transitions. [2020-12-22 11:06:10,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-22 11:06:10,318 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:10,319 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:06:10,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-22 11:06:10,319 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:10,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:10,320 INFO L82 PathProgramCache]: Analyzing trace with hash -236469381, now seen corresponding path program 1 times [2020-12-22 11:06:10,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:10,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746939524] [2020-12-22 11:06:10,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:10,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:10,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746939524] [2020-12-22 11:06:10,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:10,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 11:06:10,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730774099] [2020-12-22 11:06:10,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 11:06:10,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:10,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 11:06:10,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 11:06:10,490 INFO L87 Difference]: Start difference. First operand 557 states and 1686 transitions. Second operand 5 states. [2020-12-22 11:06:10,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:10,559 INFO L93 Difference]: Finished difference Result 773 states and 2292 transitions. [2020-12-22 11:06:10,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 11:06:10,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-12-22 11:06:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:10,563 INFO L225 Difference]: With dead ends: 773 [2020-12-22 11:06:10,563 INFO L226 Difference]: Without dead ends: 373 [2020-12-22 11:06:10,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-22 11:06:10,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2020-12-22 11:06:10,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2020-12-22 11:06:10,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-12-22 11:06:10,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1058 transitions. [2020-12-22 11:06:10,578 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1058 transitions. Word has length 13 [2020-12-22 11:06:10,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:10,578 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 1058 transitions. [2020-12-22 11:06:10,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 11:06:10,578 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1058 transitions. [2020-12-22 11:06:10,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-22 11:06:10,580 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:10,580 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:06:10,580 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 11:06:10,580 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:10,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:10,581 INFO L82 PathProgramCache]: Analyzing trace with hash 39948530, now seen corresponding path program 1 times [2020-12-22 11:06:10,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:10,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831395247] [2020-12-22 11:06:10,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:10,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:10,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831395247] [2020-12-22 11:06:10,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:10,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 11:06:10,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136244639] [2020-12-22 11:06:10,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 11:06:10,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:10,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 11:06:10,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 11:06:10,854 INFO L87 Difference]: Start difference. First operand 373 states and 1058 transitions. Second operand 5 states. [2020-12-22 11:06:10,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:10,991 INFO L93 Difference]: Finished difference Result 605 states and 1724 transitions. [2020-12-22 11:06:10,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 11:06:10,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-12-22 11:06:10,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:10,996 INFO L225 Difference]: With dead ends: 605 [2020-12-22 11:06:10,996 INFO L226 Difference]: Without dead ends: 365 [2020-12-22 11:06:10,997 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-22 11:06:10,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2020-12-22 11:06:11,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2020-12-22 11:06:11,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2020-12-22 11:06:11,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 1034 transitions. [2020-12-22 11:06:11,012 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 1034 transitions. Word has length 15 [2020-12-22 11:06:11,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:11,012 INFO L481 AbstractCegarLoop]: Abstraction has 365 states and 1034 transitions. [2020-12-22 11:06:11,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 11:06:11,012 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 1034 transitions. [2020-12-22 11:06:11,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-22 11:06:11,014 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:11,014 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:06:11,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-22 11:06:11,014 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:11,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:11,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1744400882, now seen corresponding path program 2 times [2020-12-22 11:06:11,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:11,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63819957] [2020-12-22 11:06:11,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:11,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63819957] [2020-12-22 11:06:11,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:11,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 11:06:11,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770889744] [2020-12-22 11:06:11,184 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 11:06:11,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:11,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 11:06:11,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-22 11:06:11,185 INFO L87 Difference]: Start difference. First operand 365 states and 1034 transitions. Second operand 7 states. [2020-12-22 11:06:11,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:11,461 INFO L93 Difference]: Finished difference Result 411 states and 1138 transitions. [2020-12-22 11:06:11,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-22 11:06:11,464 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-12-22 11:06:11,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:11,468 INFO L225 Difference]: With dead ends: 411 [2020-12-22 11:06:11,468 INFO L226 Difference]: Without dead ends: 374 [2020-12-22 11:06:11,469 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-12-22 11:06:11,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2020-12-22 11:06:11,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2020-12-22 11:06:11,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-12-22 11:06:11,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1050 transitions. [2020-12-22 11:06:11,485 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1050 transitions. Word has length 15 [2020-12-22 11:06:11,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:11,486 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 1050 transitions. [2020-12-22 11:06:11,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 11:06:11,486 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1050 transitions. [2020-12-22 11:06:11,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-22 11:06:11,487 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:11,488 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:06:11,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-22 11:06:11,488 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:11,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:11,489 INFO L82 PathProgramCache]: Analyzing trace with hash -410962766, now seen corresponding path program 3 times [2020-12-22 11:06:11,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:11,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759075616] [2020-12-22 11:06:11,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:11,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:11,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759075616] [2020-12-22 11:06:11,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:11,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 11:06:11,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470411516] [2020-12-22 11:06:11,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 11:06:11,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:11,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 11:06:11,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-22 11:06:11,659 INFO L87 Difference]: Start difference. First operand 371 states and 1050 transitions. Second operand 7 states. [2020-12-22 11:06:11,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:11,859 INFO L93 Difference]: Finished difference Result 590 states and 1667 transitions. [2020-12-22 11:06:11,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 11:06:11,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-12-22 11:06:11,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:11,868 INFO L225 Difference]: With dead ends: 590 [2020-12-22 11:06:11,868 INFO L226 Difference]: Without dead ends: 340 [2020-12-22 11:06:11,869 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-22 11:06:11,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-12-22 11:06:11,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2020-12-22 11:06:11,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-12-22 11:06:11,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 943 transitions. [2020-12-22 11:06:11,882 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 943 transitions. Word has length 15 [2020-12-22 11:06:11,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:11,882 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 943 transitions. [2020-12-22 11:06:11,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 11:06:11,883 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 943 transitions. [2020-12-22 11:06:11,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-22 11:06:11,884 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:11,884 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:06:11,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-22 11:06:11,884 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:11,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:11,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1955669840, now seen corresponding path program 4 times [2020-12-22 11:06:11,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:11,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212077654] [2020-12-22 11:06:11,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:12,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:12,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212077654] [2020-12-22 11:06:12,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:12,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 11:06:12,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691666835] [2020-12-22 11:06:12,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 11:06:12,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:12,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 11:06:12,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-22 11:06:12,148 INFO L87 Difference]: Start difference. First operand 340 states and 943 transitions. Second operand 7 states. [2020-12-22 11:06:12,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:12,427 INFO L93 Difference]: Finished difference Result 443 states and 1214 transitions. [2020-12-22 11:06:12,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 11:06:12,427 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-12-22 11:06:12,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:12,431 INFO L225 Difference]: With dead ends: 443 [2020-12-22 11:06:12,431 INFO L226 Difference]: Without dead ends: 396 [2020-12-22 11:06:12,433 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-22 11:06:12,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2020-12-22 11:06:12,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 367. [2020-12-22 11:06:12,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2020-12-22 11:06:12,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1018 transitions. [2020-12-22 11:06:12,446 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1018 transitions. Word has length 15 [2020-12-22 11:06:12,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:12,446 INFO L481 AbstractCegarLoop]: Abstraction has 367 states and 1018 transitions. [2020-12-22 11:06:12,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 11:06:12,446 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1018 transitions. [2020-12-22 11:06:12,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-22 11:06:12,447 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:12,448 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:06:12,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-22 11:06:12,448 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:12,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:12,450 INFO L82 PathProgramCache]: Analyzing trace with hash -484022128, now seen corresponding path program 1 times [2020-12-22 11:06:12,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:12,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062510086] [2020-12-22 11:06:12,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:12,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:12,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062510086] [2020-12-22 11:06:12,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:12,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 11:06:12,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20876454] [2020-12-22 11:06:12,728 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 11:06:12,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:12,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 11:06:12,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-22 11:06:12,730 INFO L87 Difference]: Start difference. First operand 367 states and 1018 transitions. Second operand 8 states. [2020-12-22 11:06:13,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:13,058 INFO L93 Difference]: Finished difference Result 495 states and 1347 transitions. [2020-12-22 11:06:13,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 11:06:13,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-12-22 11:06:13,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:13,062 INFO L225 Difference]: With dead ends: 495 [2020-12-22 11:06:13,062 INFO L226 Difference]: Without dead ends: 348 [2020-12-22 11:06:13,063 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:06:13,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2020-12-22 11:06:13,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 327. [2020-12-22 11:06:13,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2020-12-22 11:06:13,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 877 transitions. [2020-12-22 11:06:13,074 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 877 transitions. Word has length 16 [2020-12-22 11:06:13,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:13,075 INFO L481 AbstractCegarLoop]: Abstraction has 327 states and 877 transitions. [2020-12-22 11:06:13,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 11:06:13,075 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 877 transitions. [2020-12-22 11:06:13,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-22 11:06:13,076 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:13,076 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:06:13,076 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-22 11:06:13,077 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:13,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:13,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1665870342, now seen corresponding path program 1 times [2020-12-22 11:06:13,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:13,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470141619] [2020-12-22 11:06:13,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:13,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:13,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470141619] [2020-12-22 11:06:13,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:13,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 11:06:13,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205078060] [2020-12-22 11:06:13,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 11:06:13,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:13,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 11:06:13,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-22 11:06:13,170 INFO L87 Difference]: Start difference. First operand 327 states and 877 transitions. Second operand 6 states. [2020-12-22 11:06:13,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:13,332 INFO L93 Difference]: Finished difference Result 380 states and 1008 transitions. [2020-12-22 11:06:13,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 11:06:13,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-22 11:06:13,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:13,335 INFO L225 Difference]: With dead ends: 380 [2020-12-22 11:06:13,336 INFO L226 Difference]: Without dead ends: 358 [2020-12-22 11:06:13,336 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-12-22 11:06:13,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2020-12-22 11:06:13,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 331. [2020-12-22 11:06:13,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2020-12-22 11:06:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 885 transitions. [2020-12-22 11:06:13,347 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 885 transitions. Word has length 17 [2020-12-22 11:06:13,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:13,349 INFO L481 AbstractCegarLoop]: Abstraction has 331 states and 885 transitions. [2020-12-22 11:06:13,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 11:06:13,349 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 885 transitions. [2020-12-22 11:06:13,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-22 11:06:13,351 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:13,351 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:06:13,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-22 11:06:13,351 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:13,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:13,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1665878030, now seen corresponding path program 1 times [2020-12-22 11:06:13,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:13,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647605801] [2020-12-22 11:06:13,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:13,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:13,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647605801] [2020-12-22 11:06:13,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:13,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 11:06:13,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361680525] [2020-12-22 11:06:13,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 11:06:13,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:13,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 11:06:13,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-22 11:06:13,588 INFO L87 Difference]: Start difference. First operand 331 states and 885 transitions. Second operand 8 states. [2020-12-22 11:06:13,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:13,877 INFO L93 Difference]: Finished difference Result 457 states and 1213 transitions. [2020-12-22 11:06:13,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 11:06:13,879 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-12-22 11:06:13,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:13,882 INFO L225 Difference]: With dead ends: 457 [2020-12-22 11:06:13,882 INFO L226 Difference]: Without dead ends: 292 [2020-12-22 11:06:13,882 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-12-22 11:06:13,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2020-12-22 11:06:13,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2020-12-22 11:06:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2020-12-22 11:06:13,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 777 transitions. [2020-12-22 11:06:13,892 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 777 transitions. Word has length 17 [2020-12-22 11:06:13,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:13,892 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 777 transitions. [2020-12-22 11:06:13,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 11:06:13,893 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 777 transitions. [2020-12-22 11:06:13,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-22 11:06:13,894 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:13,894 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:06:13,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-22 11:06:13,894 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:13,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:13,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1831098376, now seen corresponding path program 2 times [2020-12-22 11:06:13,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:13,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088941982] [2020-12-22 11:06:13,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:14,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:14,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088941982] [2020-12-22 11:06:14,063 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:14,063 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 11:06:14,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250796094] [2020-12-22 11:06:14,064 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 11:06:14,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:14,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 11:06:14,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 11:06:14,071 INFO L87 Difference]: Start difference. First operand 292 states and 777 transitions. Second operand 4 states. [2020-12-22 11:06:14,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:14,106 INFO L93 Difference]: Finished difference Result 280 states and 671 transitions. [2020-12-22 11:06:14,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 11:06:14,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-12-22 11:06:14,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:14,109 INFO L225 Difference]: With dead ends: 280 [2020-12-22 11:06:14,109 INFO L226 Difference]: Without dead ends: 219 [2020-12-22 11:06:14,110 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-12-22 11:06:14,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-12-22 11:06:14,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2020-12-22 11:06:14,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-12-22 11:06:14,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 520 transitions. [2020-12-22 11:06:14,117 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 520 transitions. Word has length 17 [2020-12-22 11:06:14,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:14,118 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 520 transitions. [2020-12-22 11:06:14,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 11:06:14,118 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 520 transitions. [2020-12-22 11:06:14,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-22 11:06:14,119 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:14,119 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:06:14,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-22 11:06:14,119 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:14,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:14,120 INFO L82 PathProgramCache]: Analyzing trace with hash -228631362, now seen corresponding path program 1 times [2020-12-22 11:06:14,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:14,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783027214] [2020-12-22 11:06:14,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:14,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:14,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783027214] [2020-12-22 11:06:14,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:14,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 11:06:14,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656528479] [2020-12-22 11:06:14,274 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 11:06:14,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:14,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 11:06:14,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-22 11:06:14,275 INFO L87 Difference]: Start difference. First operand 219 states and 520 transitions. Second operand 5 states. [2020-12-22 11:06:14,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:14,316 INFO L93 Difference]: Finished difference Result 177 states and 377 transitions. [2020-12-22 11:06:14,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 11:06:14,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-12-22 11:06:14,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:14,318 INFO L225 Difference]: With dead ends: 177 [2020-12-22 11:06:14,318 INFO L226 Difference]: Without dead ends: 141 [2020-12-22 11:06:14,319 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-12-22 11:06:14,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-12-22 11:06:14,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2020-12-22 11:06:14,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-12-22 11:06:14,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 282 transitions. [2020-12-22 11:06:14,324 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 282 transitions. Word has length 18 [2020-12-22 11:06:14,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:14,325 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 282 transitions. [2020-12-22 11:06:14,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 11:06:14,325 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 282 transitions. [2020-12-22 11:06:14,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-22 11:06:14,326 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:14,326 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:06:14,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-22 11:06:14,327 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:14,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:14,327 INFO L82 PathProgramCache]: Analyzing trace with hash 2017181734, now seen corresponding path program 1 times [2020-12-22 11:06:14,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:14,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573186053] [2020-12-22 11:06:14,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:14,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573186053] [2020-12-22 11:06:14,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:14,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-22 11:06:14,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713652328] [2020-12-22 11:06:14,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-22 11:06:14,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:14,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-22 11:06:14,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-12-22 11:06:14,579 INFO L87 Difference]: Start difference. First operand 137 states and 282 transitions. Second operand 9 states. [2020-12-22 11:06:14,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:14,911 INFO L93 Difference]: Finished difference Result 182 states and 374 transitions. [2020-12-22 11:06:14,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 11:06:14,912 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-12-22 11:06:14,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:14,914 INFO L225 Difference]: With dead ends: 182 [2020-12-22 11:06:14,914 INFO L226 Difference]: Without dead ends: 179 [2020-12-22 11:06:14,914 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:06:14,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-12-22 11:06:14,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 147. [2020-12-22 11:06:14,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-12-22 11:06:14,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 307 transitions. [2020-12-22 11:06:14,920 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 307 transitions. Word has length 20 [2020-12-22 11:06:14,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:14,920 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 307 transitions. [2020-12-22 11:06:14,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-22 11:06:14,920 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 307 transitions. [2020-12-22 11:06:14,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-22 11:06:14,921 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:14,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, 1] [2020-12-22 11:06:14,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-22 11:06:14,921 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:14,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:14,922 INFO L82 PathProgramCache]: Analyzing trace with hash -2083846152, now seen corresponding path program 1 times [2020-12-22 11:06:14,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:14,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69990855] [2020-12-22 11:06:14,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:15,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:15,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69990855] [2020-12-22 11:06:15,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:15,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-22 11:06:15,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489446435] [2020-12-22 11:06:15,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-22 11:06:15,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:15,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-22 11:06:15,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-22 11:06:15,259 INFO L87 Difference]: Start difference. First operand 147 states and 307 transitions. Second operand 9 states. [2020-12-22 11:06:15,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:15,613 INFO L93 Difference]: Finished difference Result 242 states and 480 transitions. [2020-12-22 11:06:15,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 11:06:15,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-12-22 11:06:15,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:15,619 INFO L225 Difference]: With dead ends: 242 [2020-12-22 11:06:15,619 INFO L226 Difference]: Without dead ends: 193 [2020-12-22 11:06:15,620 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-12-22 11:06:15,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2020-12-22 11:06:15,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 155. [2020-12-22 11:06:15,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-12-22 11:06:15,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 308 transitions. [2020-12-22 11:06:15,625 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 308 transitions. Word has length 20 [2020-12-22 11:06:15,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:15,625 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 308 transitions. [2020-12-22 11:06:15,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-22 11:06:15,626 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 308 transitions. [2020-12-22 11:06:15,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-22 11:06:15,626 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:15,627 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:06:15,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-22 11:06:15,627 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:15,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:15,627 INFO L82 PathProgramCache]: Analyzing trace with hash 2093912422, now seen corresponding path program 2 times [2020-12-22 11:06:15,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:15,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758293264] [2020-12-22 11:06:15,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:15,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:15,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758293264] [2020-12-22 11:06:15,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:15,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 11:06:15,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693624691] [2020-12-22 11:06:15,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 11:06:15,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:15,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 11:06:15,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-22 11:06:15,877 INFO L87 Difference]: Start difference. First operand 155 states and 308 transitions. Second operand 8 states. [2020-12-22 11:06:16,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:16,206 INFO L93 Difference]: Finished difference Result 190 states and 370 transitions. [2020-12-22 11:06:16,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 11:06:16,207 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-12-22 11:06:16,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:16,208 INFO L225 Difference]: With dead ends: 190 [2020-12-22 11:06:16,208 INFO L226 Difference]: Without dead ends: 145 [2020-12-22 11:06:16,209 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:06:16,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-12-22 11:06:16,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2020-12-22 11:06:16,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-12-22 11:06:16,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 287 transitions. [2020-12-22 11:06:16,214 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 287 transitions. Word has length 20 [2020-12-22 11:06:16,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:16,214 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 287 transitions. [2020-12-22 11:06:16,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 11:06:16,215 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 287 transitions. [2020-12-22 11:06:16,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-22 11:06:16,218 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:16,218 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:06:16,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-22 11:06:16,218 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:16,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:16,219 INFO L82 PathProgramCache]: Analyzing trace with hash 39407034, now seen corresponding path program 3 times [2020-12-22 11:06:16,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:16,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269661720] [2020-12-22 11:06:16,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:16,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:16,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269661720] [2020-12-22 11:06:16,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:16,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 11:06:16,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973755749] [2020-12-22 11:06:16,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 11:06:16,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:16,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 11:06:16,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-22 11:06:16,403 INFO L87 Difference]: Start difference. First operand 145 states and 287 transitions. Second operand 6 states. [2020-12-22 11:06:16,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:16,459 INFO L93 Difference]: Finished difference Result 124 states and 243 transitions. [2020-12-22 11:06:16,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 11:06:16,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-12-22 11:06:16,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:16,462 INFO L225 Difference]: With dead ends: 124 [2020-12-22 11:06:16,462 INFO L226 Difference]: Without dead ends: 113 [2020-12-22 11:06:16,462 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-12-22 11:06:16,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-12-22 11:06:16,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2020-12-22 11:06:16,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-12-22 11:06:16,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 202 transitions. [2020-12-22 11:06:16,466 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 202 transitions. Word has length 20 [2020-12-22 11:06:16,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:16,466 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 202 transitions. [2020-12-22 11:06:16,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 11:06:16,466 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 202 transitions. [2020-12-22 11:06:16,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-22 11:06:16,467 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:16,467 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-12-22 11:06:16,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-22 11:06:16,467 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:16,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:16,468 INFO L82 PathProgramCache]: Analyzing trace with hash -597668820, now seen corresponding path program 1 times [2020-12-22 11:06:16,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:16,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423734536] [2020-12-22 11:06:16,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:16,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:16,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423734536] [2020-12-22 11:06:16,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:16,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-22 11:06:16,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247938241] [2020-12-22 11:06:16,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-22 11:06:16,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:16,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-22 11:06:16,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-22 11:06:16,875 INFO L87 Difference]: Start difference. First operand 103 states and 202 transitions. Second operand 9 states. [2020-12-22 11:06:17,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:17,171 INFO L93 Difference]: Finished difference Result 124 states and 238 transitions. [2020-12-22 11:06:17,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 11:06:17,172 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-12-22 11:06:17,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:17,172 INFO L225 Difference]: With dead ends: 124 [2020-12-22 11:06:17,172 INFO L226 Difference]: Without dead ends: 63 [2020-12-22 11:06:17,173 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:06:17,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-12-22 11:06:17,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-12-22 11:06:17,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-12-22 11:06:17,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions. [2020-12-22 11:06:17,175 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 110 transitions. Word has length 22 [2020-12-22 11:06:17,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:17,176 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 110 transitions. [2020-12-22 11:06:17,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-22 11:06:17,176 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 110 transitions. [2020-12-22 11:06:17,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-22 11:06:17,176 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:17,176 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-12-22 11:06:17,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-22 11:06:17,177 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:17,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:17,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1431356608, now seen corresponding path program 2 times [2020-12-22 11:06:17,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:17,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023571751] [2020-12-22 11:06:17,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 11:06:17,250 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 11:06:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 11:06:17,355 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 11:06:17,402 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-22 11:06:17,402 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-22 11:06:17,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-22 11:06:17,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 11:06:17 BasicIcfg [2020-12-22 11:06:17,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 11:06:17,535 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 11:06:17,535 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 11:06:17,535 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 11:06:17,536 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:05:51" (3/4) ... [2020-12-22 11:06:17,538 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-22 11:06:17,651 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/pthread-wmm/safe003_rmo.oepc.i-witness.graphml [2020-12-22 11:06:17,651 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 11:06:17,653 INFO L168 Benchmark]: Toolchain (without parser) took 30718.04 ms. Allocated memory was 159.4 MB in the beginning and 488.6 MB in the end (delta: 329.3 MB). Free memory was 133.6 MB in the beginning and 427.5 MB in the end (delta: -293.9 MB). Peak memory consumption was 35.5 MB. Max. memory is 8.0 GB. [2020-12-22 11:06:17,653 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 159.4 MB. Free memory is still 133.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 11:06:17,653 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1085.57 ms. Allocated memory is still 159.4 MB. Free memory was 133.3 MB in the beginning and 127.5 MB in the end (delta: 5.8 MB). Peak memory consumption was 29.3 MB. Max. memory is 8.0 GB. [2020-12-22 11:06:17,654 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.71 ms. Allocated memory is still 159.4 MB. Free memory was 127.5 MB in the beginning and 124.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-22 11:06:17,654 INFO L168 Benchmark]: Boogie Preprocessor took 80.66 ms. Allocated memory is still 159.4 MB. Free memory was 124.9 MB in the beginning and 121.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-22 11:06:17,654 INFO L168 Benchmark]: RCFGBuilder took 3455.19 ms. Allocated memory was 159.4 MB in the beginning and 201.3 MB in the end (delta: 41.9 MB). Free memory was 121.7 MB in the beginning and 112.9 MB in the end (delta: 8.9 MB). Peak memory consumption was 104.3 MB. Max. memory is 8.0 GB. [2020-12-22 11:06:17,655 INFO L168 Benchmark]: TraceAbstraction took 25860.18 ms. Allocated memory was 201.3 MB in the beginning and 488.6 MB in the end (delta: 287.3 MB). Free memory was 112.3 MB in the beginning and 446.9 MB in the end (delta: -334.5 MB). Peak memory consumption was 237.6 MB. Max. memory is 8.0 GB. [2020-12-22 11:06:17,655 INFO L168 Benchmark]: Witness Printer took 116.37 ms. Allocated memory is still 488.6 MB. Free memory was 446.9 MB in the beginning and 427.5 MB in the end (delta: 19.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. [2020-12-22 11:06:17,657 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 159.4 MB. Free memory is still 133.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1085.57 ms. Allocated memory is still 159.4 MB. Free memory was 133.3 MB in the beginning and 127.5 MB in the end (delta: 5.8 MB). Peak memory consumption was 29.3 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 111.71 ms. Allocated memory is still 159.4 MB. Free memory was 127.5 MB in the beginning and 124.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 80.66 ms. Allocated memory is still 159.4 MB. Free memory was 124.9 MB in the beginning and 121.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 3455.19 ms. Allocated memory was 159.4 MB in the beginning and 201.3 MB in the end (delta: 41.9 MB). Free memory was 121.7 MB in the beginning and 112.9 MB in the end (delta: 8.9 MB). Peak memory consumption was 104.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 25860.18 ms. Allocated memory was 201.3 MB in the beginning and 488.6 MB in the end (delta: 287.3 MB). Free memory was 112.3 MB in the beginning and 446.9 MB in the end (delta: -334.5 MB). Peak memory consumption was 237.6 MB. Max. memory is 8.0 GB. * Witness Printer took 116.37 ms. Allocated memory is still 488.6 MB. Free memory was 446.9 MB in the beginning and 427.5 MB in the end (delta: 19.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1207 VarBasedMoverChecksPositive, 71 VarBasedMoverChecksNegative, 27 SemBasedMoverChecksPositive, 44 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.7s, 162 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 17.0s, 106 PlacesBefore, 37 PlacesAfterwards, 98 TransitionsBefore, 28 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 80 TotalNumberOfCompositions, 4531 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1861; [L847] FCALL, FORK 0 pthread_create(&t1861, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L848] 0 pthread_t t1862; [L849] FCALL, FORK 0 pthread_create(&t1862, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L850] 0 pthread_t t1863; [L851] FCALL, FORK 0 pthread_create(&t1863, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 2 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L778] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L778] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L778] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L779] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L780] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L781] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L782] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L782] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 y$flush_delayed = weak$$choice2 [L795] 3 y$mem_tmp = y [L796] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L796] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L797] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L797] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L798] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L798] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L799] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L799] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L800] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L801] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L802] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = y [L804] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L804] 3 y = y$flush_delayed ? y$mem_tmp : y [L805] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L808] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 3 y$flush_delayed = weak$$choice2 [L811] 3 y$mem_tmp = y [L812] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L812] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L813] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L813] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L814] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L814] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L815] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L815] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L816] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L817] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L818] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 __unbuffered_p2_EBX = y [L820] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L820] 3 y = y$flush_delayed ? y$mem_tmp : y [L821] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L758] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L759] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L760] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L761] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L761] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L762] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L762] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L824] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L824] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L825] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L826] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L828] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 3 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L857] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L869] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L869] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L869] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L870] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L870] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L870] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L871] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L871] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L871] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L872] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L872] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L873] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L873] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L874] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L874] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L876] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=54, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 25.5s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 17.1s, HoareTripleCheckerStatistics: 461 SDtfs, 764 SDslu, 1147 SDs, 0 SdLazy, 804 SolverSat, 262 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 164 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 307 NumberOfCodeBlocks, 307 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 267 ConstructedInterpolants, 0 QuantifiedInterpolants, 36094 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...