/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 21:57:18,228 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 21:57:18,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 21:57:18,253 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 21:57:18,253 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 21:57:18,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 21:57:18,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 21:57:18,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 21:57:18,259 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 21:57:18,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 21:57:18,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 21:57:18,262 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 21:57:18,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 21:57:18,264 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 21:57:18,265 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 21:57:18,266 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 21:57:18,267 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 21:57:18,267 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 21:57:18,269 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 21:57:18,271 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 21:57:18,272 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 21:57:18,273 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 21:57:18,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 21:57:18,275 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 21:57:18,278 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 21:57:18,278 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 21:57:18,278 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 21:57:18,279 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 21:57:18,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 21:57:18,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 21:57:18,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 21:57:18,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 21:57:18,282 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 21:57:18,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 21:57:18,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 21:57:18,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 21:57:18,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 21:57:18,285 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 21:57:18,285 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 21:57:18,286 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 21:57:18,287 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 21:57:18,288 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-21 21:57:18,310 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 21:57:18,311 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 21:57:18,312 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 21:57:18,312 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 21:57:18,312 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 21:57:18,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 21:57:18,313 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 21:57:18,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 21:57:18,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 21:57:18,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 21:57:18,313 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 21:57:18,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 21:57:18,314 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 21:57:18,314 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 21:57:18,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 21:57:18,314 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 21:57:18,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 21:57:18,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 21:57:18,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 21:57:18,315 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 21:57:18,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 21:57:18,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 21:57:18,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 21:57:18,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-21 21:57:18,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 21:57:18,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 21:57:18,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 21:57:18,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 21:57:18,317 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-21 21:57:18,317 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-21 21:57:18,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 21:57:18,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 21:57:18,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 21:57:18,639 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 21:57:18,639 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 21:57:18,640 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i [2020-10-21 21:57:18,720 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b650a1ad8/8f22d02d7e344548a397ecb061f821dd/FLAGb9b708c39 [2020-10-21 21:57:19,271 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 21:57:19,272 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i [2020-10-21 21:57:19,294 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b650a1ad8/8f22d02d7e344548a397ecb061f821dd/FLAGb9b708c39 [2020-10-21 21:57:19,615 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b650a1ad8/8f22d02d7e344548a397ecb061f821dd [2020-10-21 21:57:19,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 21:57:19,632 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 21:57:19,639 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 21:57:19,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 21:57:19,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 21:57:19,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 09:57:19" (1/1) ... [2020-10-21 21:57:19,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33960956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:57:19, skipping insertion in model container [2020-10-21 21:57:19,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 09:57:19" (1/1) ... [2020-10-21 21:57:19,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 21:57:19,732 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 21:57:20,190 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 21:57:20,207 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 21:57:20,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 21:57:20,422 INFO L208 MainTranslator]: Completed translation [2020-10-21 21:57:20,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:57:20 WrapperNode [2020-10-21 21:57:20,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 21:57:20,425 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 21:57:20,425 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 21:57:20,426 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 21:57:20,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:57:20" (1/1) ... [2020-10-21 21:57:20,484 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:57:20" (1/1) ... [2020-10-21 21:57:20,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 21:57:20,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 21:57:20,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 21:57:20,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 21:57:20,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:57:20" (1/1) ... [2020-10-21 21:57:20,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:57:20" (1/1) ... [2020-10-21 21:57:20,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:57:20" (1/1) ... [2020-10-21 21:57:20,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:57:20" (1/1) ... [2020-10-21 21:57:20,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:57:20" (1/1) ... [2020-10-21 21:57:20,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:57:20" (1/1) ... [2020-10-21 21:57:20,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:57:20" (1/1) ... [2020-10-21 21:57:20,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 21:57:20,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 21:57:20,561 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 21:57:20,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 21:57:20,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:57:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 21:57:20,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 21:57:20,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 21:57:20,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 21:57:20,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 21:57:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 21:57:20,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 21:57:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 21:57:20,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 21:57:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 21:57:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 21:57:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 21:57:20,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 21:57:20,656 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 21:57:22,615 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 21:57:22,615 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 21:57:22,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 09:57:22 BoogieIcfgContainer [2020-10-21 21:57:22,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 21:57:22,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 21:57:22,620 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 21:57:22,623 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 21:57:22,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 09:57:19" (1/3) ... [2020-10-21 21:57:22,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54841a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 09:57:22, skipping insertion in model container [2020-10-21 21:57:22,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:57:20" (2/3) ... [2020-10-21 21:57:22,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54841a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 09:57:22, skipping insertion in model container [2020-10-21 21:57:22,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 09:57:22" (3/3) ... [2020-10-21 21:57:22,628 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt.i [2020-10-21 21:57:22,641 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 21:57:22,641 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-21 21:57:22,649 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 21:57:22,650 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 21:57:22,678 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,679 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,679 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,679 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,682 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,683 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,683 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,684 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,684 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,684 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,684 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,684 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,693 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,693 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,699 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,701 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,701 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:57:22,703 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 21:57:22,718 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-21 21:57:22,741 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 21:57:22,741 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 21:57:22,741 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-21 21:57:22,741 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 21:57:22,742 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 21:57:22,742 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 21:57:22,742 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 21:57:22,742 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 21:57:22,756 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-21 21:57:22,760 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 87 transitions, 184 flow [2020-10-21 21:57:22,763 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 87 transitions, 184 flow [2020-10-21 21:57:22,765 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 91 places, 87 transitions, 184 flow [2020-10-21 21:57:22,810 INFO L129 PetriNetUnfolder]: 3/85 cut-off events. [2020-10-21 21:57:22,811 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 21:57:22,816 INFO L80 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 3/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2020-10-21 21:57:22,819 INFO L116 LiptonReduction]: Number of co-enabled transitions 1182 [2020-10-21 21:57:23,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 21:57:23,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:23,385 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-21 21:57:23,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 21:57:23,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:23,780 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-21 21:57:23,906 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-21 21:57:24,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 21:57:24,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:24,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 21:57:24,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:24,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 21:57:24,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:24,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 21:57:24,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:24,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 21:57:24,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:24,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 21:57:24,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:24,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 21:57:24,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:24,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 21:57:24,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:24,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 21:57:24,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:24,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 21:57:24,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:24,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-21 21:57:24,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:24,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-21 21:57:24,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:24,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:24,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:24,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 21:57:24,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:24,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 21:57:24,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:24,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 21:57:24,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:57:24,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 21:57:24,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:57:24,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 21:57:24,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:57:24,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-21 21:57:24,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:24,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-21 21:57:24,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:24,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-21 21:57:24,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:24,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 21:57:24,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:24,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 21:57:24,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:24,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-21 21:57:24,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-21 21:57:24,621 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-21 21:57:24,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:24,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 21:57:24,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:24,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 21:57:24,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:24,761 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 21:57:24,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:24,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 21:57:24,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:24,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-21 21:57:24,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:24,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-21 21:57:24,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:24,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 21:57:24,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:24,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 21:57:24,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:24,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 21:57:24,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:24,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 21:57:24,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:24,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 21:57:24,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:24,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 21:57:24,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:25,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:25,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 21:57:25,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 21:57:25,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 21:57:25,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:57:25,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 21:57:25,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:57:25,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-21 21:57:25,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:57:25,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-21 21:57:25,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-21 21:57:25,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-21 21:57:25,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 21:57:25,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 21:57:25,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-21 21:57:25,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-21 21:57:25,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-21 21:57:25,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,374 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-21 21:57:25,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-21 21:57:25,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 21:57:25,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 21:57:25,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-21 21:57:25,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-21 21:57:25,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 21:57:25,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 21:57:25,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 21:57:25,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 21:57:25,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 21:57:25,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 21:57:25,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 21:57:25,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,680 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 21:57:25,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 21:57:25,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 21:57:25,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 21:57:25,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 21:57:25,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 21:57:25,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 21:57:25,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:25,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:25,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:25,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:25,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:25,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:57:25,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:57:25,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:57:25,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:57:25,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:25,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:25,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:25,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:25,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:25,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:57:25,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:26,072 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:26,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:26,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:26,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:26,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:26,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:26,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:57:26,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:26,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:26,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:26,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:26,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:26,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:26,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:57:26,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:57:26,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:57:26,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:26,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:26,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:26,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:26,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:26,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:57:26,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:57:26,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:57:26,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:26,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:26,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:26,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:26,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:26,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:26,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:57:26,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:26,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:57:26,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:26,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:26,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:26,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:26,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:26,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:57:26,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:26,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:26,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:26,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:26,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:26,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:26,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:57:26,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:57:26,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:57:26,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 21:57:26,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:26,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 21:57:26,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:26,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-21 21:57:26,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:26,401 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 21:57:26,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:27,440 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-21 21:57:27,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-21 21:57:27,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:27,449 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 21:57:27,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:28,626 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 145 DAG size of output: 124 [2020-10-21 21:57:29,734 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 234 DAG size of output: 194 [2020-10-21 21:57:29,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-21 21:57:29,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:29,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 21:57:29,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:30,795 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 151 DAG size of output: 122 [2020-10-21 21:57:30,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:57:30,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:30,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:30,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:30,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:30,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:57:30,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:57:30,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:57:30,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:57:30,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:30,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:30,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:30,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:30,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:30,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:57:30,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:31,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:57:31,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:31,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:31,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:31,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:31,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:31,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:57:31,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:31,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:57:31,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:31,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:31,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:31,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:31,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:57:31,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:57:31,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:57:31,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:57:31,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:31,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:31,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:31,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:31,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:57:31,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:57:31,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:57:31,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:31,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:31,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:31,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:31,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:31,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:31,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:57:31,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:31,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:31,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:31,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:31,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:31,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:31,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:31,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:57:31,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:57:31,200 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:31,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:31,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:31,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:57:31,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:57:31,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:57:31,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:57:31,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:57:31,916 WARN L193 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 127 [2020-10-21 21:57:32,243 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-21 21:57:32,946 WARN L193 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2020-10-21 21:57:33,241 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-21 21:57:33,691 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2020-10-21 21:57:34,130 WARN L193 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2020-10-21 21:57:34,298 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-21 21:57:34,672 INFO L131 LiptonReduction]: Checked pairs total: 3891 [2020-10-21 21:57:34,672 INFO L133 LiptonReduction]: Total number of compositions: 85 [2020-10-21 21:57:34,679 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 22 transitions, 54 flow [2020-10-21 21:57:34,697 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 212 states. [2020-10-21 21:57:34,699 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states. [2020-10-21 21:57:34,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-21 21:57:34,706 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:57:34,706 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-21 21:57:34,707 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:57:34,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:57:34,712 INFO L82 PathProgramCache]: Analyzing trace with hash 919369024, now seen corresponding path program 1 times [2020-10-21 21:57:34,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:57:34,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793009762] [2020-10-21 21:57:34,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:57:34,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:57:34,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:57:34,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793009762] [2020-10-21 21:57:34,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:57:34,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 21:57:34,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834602283] [2020-10-21 21:57:34,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 21:57:34,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:57:34,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 21:57:34,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:57:34,979 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 3 states. [2020-10-21 21:57:35,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:57:35,061 INFO L93 Difference]: Finished difference Result 187 states and 450 transitions. [2020-10-21 21:57:35,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 21:57:35,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-21 21:57:35,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:57:35,077 INFO L225 Difference]: With dead ends: 187 [2020-10-21 21:57:35,077 INFO L226 Difference]: Without dead ends: 152 [2020-10-21 21:57:35,079 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:57:35,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-10-21 21:57:35,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2020-10-21 21:57:35,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-10-21 21:57:35,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 357 transitions. [2020-10-21 21:57:35,136 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 357 transitions. Word has length 5 [2020-10-21 21:57:35,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:57:35,136 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 357 transitions. [2020-10-21 21:57:35,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 21:57:35,136 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 357 transitions. [2020-10-21 21:57:35,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-21 21:57:35,137 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:57:35,137 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:57:35,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 21:57:35,138 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:57:35,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:57:35,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1249572569, now seen corresponding path program 1 times [2020-10-21 21:57:35,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:57:35,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113860723] [2020-10-21 21:57:35,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:57:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:57:35,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:57:35,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113860723] [2020-10-21 21:57:35,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:57:35,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 21:57:35,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258996716] [2020-10-21 21:57:35,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 21:57:35,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:57:35,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 21:57:35,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:57:35,238 INFO L87 Difference]: Start difference. First operand 152 states and 357 transitions. Second operand 3 states. [2020-10-21 21:57:35,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:57:35,262 INFO L93 Difference]: Finished difference Result 150 states and 351 transitions. [2020-10-21 21:57:35,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 21:57:35,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-21 21:57:35,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:57:35,265 INFO L225 Difference]: With dead ends: 150 [2020-10-21 21:57:35,265 INFO L226 Difference]: Without dead ends: 150 [2020-10-21 21:57:35,269 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:57:35,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-10-21 21:57:35,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2020-10-21 21:57:35,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-10-21 21:57:35,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 351 transitions. [2020-10-21 21:57:35,288 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 351 transitions. Word has length 7 [2020-10-21 21:57:35,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:57:35,288 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 351 transitions. [2020-10-21 21:57:35,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 21:57:35,288 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 351 transitions. [2020-10-21 21:57:35,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-21 21:57:35,289 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:57:35,289 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:57:35,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 21:57:35,290 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:57:35,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:57:35,290 INFO L82 PathProgramCache]: Analyzing trace with hash -796535291, now seen corresponding path program 1 times [2020-10-21 21:57:35,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:57:35,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979230164] [2020-10-21 21:57:35,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:57:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:57:35,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:57:35,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979230164] [2020-10-21 21:57:35,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:57:35,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 21:57:35,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610917299] [2020-10-21 21:57:35,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 21:57:35,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:57:35,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 21:57:35,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:57:35,366 INFO L87 Difference]: Start difference. First operand 150 states and 351 transitions. Second operand 3 states. [2020-10-21 21:57:35,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:57:35,376 INFO L93 Difference]: Finished difference Result 137 states and 315 transitions. [2020-10-21 21:57:35,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 21:57:35,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-10-21 21:57:35,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:57:35,379 INFO L225 Difference]: With dead ends: 137 [2020-10-21 21:57:35,379 INFO L226 Difference]: Without dead ends: 137 [2020-10-21 21:57:35,379 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:57:35,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-10-21 21:57:35,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-10-21 21:57:35,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-10-21 21:57:35,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 315 transitions. [2020-10-21 21:57:35,388 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 315 transitions. Word has length 8 [2020-10-21 21:57:35,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:57:35,389 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 315 transitions. [2020-10-21 21:57:35,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 21:57:35,389 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 315 transitions. [2020-10-21 21:57:35,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-21 21:57:35,390 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:57:35,390 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:57:35,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 21:57:35,390 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:57:35,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:57:35,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1535587376, now seen corresponding path program 1 times [2020-10-21 21:57:35,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:57:35,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518999075] [2020-10-21 21:57:35,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:57:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:57:35,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:57:35,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518999075] [2020-10-21 21:57:35,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:57:35,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 21:57:35,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601173337] [2020-10-21 21:57:35,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 21:57:35,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:57:35,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 21:57:35,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:57:35,516 INFO L87 Difference]: Start difference. First operand 137 states and 315 transitions. Second operand 5 states. [2020-10-21 21:57:35,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:57:35,594 INFO L93 Difference]: Finished difference Result 193 states and 437 transitions. [2020-10-21 21:57:35,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 21:57:35,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-21 21:57:35,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:57:35,597 INFO L225 Difference]: With dead ends: 193 [2020-10-21 21:57:35,597 INFO L226 Difference]: Without dead ends: 101 [2020-10-21 21:57:35,597 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 21:57:35,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-10-21 21:57:35,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-21 21:57:35,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-21 21:57:35,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 224 transitions. [2020-10-21 21:57:35,605 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 224 transitions. Word has length 10 [2020-10-21 21:57:35,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:57:35,605 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 224 transitions. [2020-10-21 21:57:35,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 21:57:35,605 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 224 transitions. [2020-10-21 21:57:35,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 21:57:35,606 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:57:35,606 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:57:35,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 21:57:35,606 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:57:35,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:57:35,607 INFO L82 PathProgramCache]: Analyzing trace with hash -358553736, now seen corresponding path program 1 times [2020-10-21 21:57:35,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:57:35,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333756297] [2020-10-21 21:57:35,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:57:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:57:35,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:57:35,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333756297] [2020-10-21 21:57:35,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:57:35,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 21:57:35,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962412411] [2020-10-21 21:57:35,717 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 21:57:35,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:57:35,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 21:57:35,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-21 21:57:35,718 INFO L87 Difference]: Start difference. First operand 101 states and 224 transitions. Second operand 6 states. [2020-10-21 21:57:35,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:57:35,837 INFO L93 Difference]: Finished difference Result 149 states and 328 transitions. [2020-10-21 21:57:35,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 21:57:35,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-21 21:57:35,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:57:35,840 INFO L225 Difference]: With dead ends: 149 [2020-10-21 21:57:35,840 INFO L226 Difference]: Without dead ends: 89 [2020-10-21 21:57:35,841 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:57:35,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-10-21 21:57:35,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2020-10-21 21:57:35,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-21 21:57:35,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 192 transitions. [2020-10-21 21:57:35,846 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 192 transitions. Word has length 11 [2020-10-21 21:57:35,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:57:35,846 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 192 transitions. [2020-10-21 21:57:35,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 21:57:35,846 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 192 transitions. [2020-10-21 21:57:35,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 21:57:35,847 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:57:35,847 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:57:35,848 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 21:57:35,848 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:57:35,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:57:35,848 INFO L82 PathProgramCache]: Analyzing trace with hash -358569546, now seen corresponding path program 2 times [2020-10-21 21:57:35,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:57:35,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353474619] [2020-10-21 21:57:35,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:57:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:57:35,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:57:35,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353474619] [2020-10-21 21:57:35,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:57:35,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 21:57:35,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167613695] [2020-10-21 21:57:35,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 21:57:35,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:57:35,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 21:57:35,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:57:35,939 INFO L87 Difference]: Start difference. First operand 89 states and 192 transitions. Second operand 3 states. [2020-10-21 21:57:35,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:57:35,944 INFO L93 Difference]: Finished difference Result 85 states and 181 transitions. [2020-10-21 21:57:35,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 21:57:35,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-21 21:57:35,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:57:35,946 INFO L225 Difference]: With dead ends: 85 [2020-10-21 21:57:35,947 INFO L226 Difference]: Without dead ends: 85 [2020-10-21 21:57:35,947 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:57:35,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-10-21 21:57:35,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-10-21 21:57:35,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-10-21 21:57:35,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 181 transitions. [2020-10-21 21:57:35,951 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 181 transitions. Word has length 11 [2020-10-21 21:57:35,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:57:35,952 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 181 transitions. [2020-10-21 21:57:35,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 21:57:35,952 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 181 transitions. [2020-10-21 21:57:35,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 21:57:35,953 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:57:35,953 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:57:35,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 21:57:35,953 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:57:35,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:57:35,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1769244320, now seen corresponding path program 1 times [2020-10-21 21:57:35,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:57:35,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464795735] [2020-10-21 21:57:35,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:57:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:57:36,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:57:36,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464795735] [2020-10-21 21:57:36,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:57:36,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 21:57:36,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352881244] [2020-10-21 21:57:36,071 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 21:57:36,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:57:36,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 21:57:36,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-21 21:57:36,072 INFO L87 Difference]: Start difference. First operand 85 states and 181 transitions. Second operand 6 states. [2020-10-21 21:57:36,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:57:36,183 INFO L93 Difference]: Finished difference Result 121 states and 256 transitions. [2020-10-21 21:57:36,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 21:57:36,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-10-21 21:57:36,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:57:36,184 INFO L225 Difference]: With dead ends: 121 [2020-10-21 21:57:36,185 INFO L226 Difference]: Without dead ends: 73 [2020-10-21 21:57:36,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:57:36,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-21 21:57:36,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-10-21 21:57:36,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-10-21 21:57:36,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 149 transitions. [2020-10-21 21:57:36,191 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 149 transitions. Word has length 12 [2020-10-21 21:57:36,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:57:36,191 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 149 transitions. [2020-10-21 21:57:36,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 21:57:36,191 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 149 transitions. [2020-10-21 21:57:36,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 21:57:36,201 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:57:36,201 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:57:36,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 21:57:36,201 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:57:36,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:57:36,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1769229440, now seen corresponding path program 2 times [2020-10-21 21:57:36,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:57:36,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306486488] [2020-10-21 21:57:36,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:57:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:57:36,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:57:36,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306486488] [2020-10-21 21:57:36,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:57:36,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 21:57:36,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118814215] [2020-10-21 21:57:36,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 21:57:36,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:57:36,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 21:57:36,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:57:36,352 INFO L87 Difference]: Start difference. First operand 73 states and 149 transitions. Second operand 5 states. [2020-10-21 21:57:36,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:57:36,398 INFO L93 Difference]: Finished difference Result 71 states and 143 transitions. [2020-10-21 21:57:36,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 21:57:36,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-21 21:57:36,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:57:36,400 INFO L225 Difference]: With dead ends: 71 [2020-10-21 21:57:36,400 INFO L226 Difference]: Without dead ends: 71 [2020-10-21 21:57:36,400 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:57:36,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-10-21 21:57:36,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-10-21 21:57:36,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-21 21:57:36,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 143 transitions. [2020-10-21 21:57:36,404 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 143 transitions. Word has length 12 [2020-10-21 21:57:36,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:57:36,404 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 143 transitions. [2020-10-21 21:57:36,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 21:57:36,405 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 143 transitions. [2020-10-21 21:57:36,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 21:57:36,405 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:57:36,406 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:57:36,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 21:57:36,406 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:57:36,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:57:36,406 INFO L82 PathProgramCache]: Analyzing trace with hash -988463819, now seen corresponding path program 1 times [2020-10-21 21:57:36,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:57:36,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323835943] [2020-10-21 21:57:36,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:57:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:57:36,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:57:36,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323835943] [2020-10-21 21:57:36,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:57:36,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 21:57:36,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074124067] [2020-10-21 21:57:36,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 21:57:36,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:57:36,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 21:57:36,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 21:57:36,485 INFO L87 Difference]: Start difference. First operand 71 states and 143 transitions. Second operand 4 states. [2020-10-21 21:57:36,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:57:36,520 INFO L93 Difference]: Finished difference Result 62 states and 105 transitions. [2020-10-21 21:57:36,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 21:57:36,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-21 21:57:36,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:57:36,522 INFO L225 Difference]: With dead ends: 62 [2020-10-21 21:57:36,522 INFO L226 Difference]: Without dead ends: 43 [2020-10-21 21:57:36,522 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:57:36,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-10-21 21:57:36,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-10-21 21:57:36,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-21 21:57:36,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2020-10-21 21:57:36,525 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 13 [2020-10-21 21:57:36,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:57:36,526 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2020-10-21 21:57:36,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 21:57:36,526 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2020-10-21 21:57:36,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 21:57:36,527 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:57:36,527 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:57:36,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 21:57:36,527 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:57:36,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:57:36,527 INFO L82 PathProgramCache]: Analyzing trace with hash 530055858, now seen corresponding path program 1 times [2020-10-21 21:57:36,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:57:36,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083138685] [2020-10-21 21:57:36,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:57:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:57:36,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:57:36,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083138685] [2020-10-21 21:57:36,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:57:36,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 21:57:36,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657658263] [2020-10-21 21:57:36,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 21:57:36,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:57:36,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 21:57:36,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:57:36,617 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 5 states. [2020-10-21 21:57:36,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:57:36,662 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2020-10-21 21:57:36,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 21:57:36,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-21 21:57:36,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:57:36,664 INFO L225 Difference]: With dead ends: 33 [2020-10-21 21:57:36,665 INFO L226 Difference]: Without dead ends: 26 [2020-10-21 21:57:36,665 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 21:57:36,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-10-21 21:57:36,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-10-21 21:57:36,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-10-21 21:57:36,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2020-10-21 21:57:36,668 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 14 [2020-10-21 21:57:36,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:57:36,668 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-10-21 21:57:36,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 21:57:36,668 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-10-21 21:57:36,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 21:57:36,669 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:57:36,669 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:57:36,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 21:57:36,670 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:57:36,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:57:36,670 INFO L82 PathProgramCache]: Analyzing trace with hash 542229330, now seen corresponding path program 1 times [2020-10-21 21:57:36,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:57:36,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319206309] [2020-10-21 21:57:36,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:57:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:57:36,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:57:36,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319206309] [2020-10-21 21:57:36,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:57:36,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 21:57:36,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636108748] [2020-10-21 21:57:36,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 21:57:36,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:57:36,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 21:57:36,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 21:57:36,821 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 6 states. [2020-10-21 21:57:36,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:57:36,921 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2020-10-21 21:57:36,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 21:57:36,922 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-21 21:57:36,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:57:36,922 INFO L225 Difference]: With dead ends: 34 [2020-10-21 21:57:36,922 INFO L226 Difference]: Without dead ends: 22 [2020-10-21 21:57:36,923 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-10-21 21:57:36,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-10-21 21:57:36,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-10-21 21:57:36,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-21 21:57:36,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2020-10-21 21:57:36,924 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2020-10-21 21:57:36,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:57:36,925 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-10-21 21:57:36,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 21:57:36,925 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2020-10-21 21:57:36,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 21:57:36,926 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:57:36,926 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:57:36,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 21:57:36,927 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:57:36,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:57:36,927 INFO L82 PathProgramCache]: Analyzing trace with hash 589801010, now seen corresponding path program 2 times [2020-10-21 21:57:36,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:57:36,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031103680] [2020-10-21 21:57:36,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:57:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 21:57:36,998 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 21:57:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 21:57:37,055 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 21:57:37,105 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 21:57:37,106 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 21:57:37,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 21:57:37,107 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 21:57:37,118 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L807-->L814: Formula: (let ((.cse6 (= (mod ~x$w_buff0_used~0_In-1263868896 256) 0)) (.cse7 (= (mod ~x$r_buff0_thd0~0_In-1263868896 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In-1263868896 256) 0)) (.cse8 (= (mod ~x$r_buff1_thd0~0_In-1263868896 256) 0))) (let ((.cse2 (or .cse9 .cse8)) (.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse5 (or .cse6 .cse7)) (.cse0 (not .cse7)) (.cse1 (not .cse6))) (and (= ~x$r_buff0_thd0~0_Out-1263868896 ~x$r_buff0_thd0~0_In-1263868896) (or (and (= ~x$w_buff0~0_In-1263868896 ~x~0_Out-1263868896) .cse0 .cse1) (and (or (and (= ~x~0_Out-1263868896 ~x~0_In-1263868896) .cse2) (and (= ~x~0_Out-1263868896 ~x$w_buff1~0_In-1263868896) .cse3 .cse4)) .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1263868896 0)) (or (and (= ~x$w_buff1_used~0_In-1263868896 ~x$w_buff1_used~0_Out-1263868896) .cse2) (and (= 0 ~x$w_buff1_used~0_Out-1263868896) .cse3 .cse4)) (= ~x$r_buff1_thd0~0_In-1263868896 ~x$r_buff1_thd0~0_Out-1263868896) (or (and (= ~x$w_buff0_used~0_In-1263868896 ~x$w_buff0_used~0_Out-1263868896) .cse5) (and (= ~x$w_buff0_used~0_Out-1263868896 0) .cse0 .cse1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1263868896| ULTIMATE.start_assume_abort_if_not_~cond_Out-1263868896)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1263868896, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1263868896, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1263868896|, ~x$w_buff1~0=~x$w_buff1~0_In-1263868896, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1263868896, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1263868896, ~x~0=~x~0_In-1263868896, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1263868896} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1263868896, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-1263868896, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1263868896|, ~x$w_buff1~0=~x$w_buff1~0_In-1263868896, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1263868896|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1263868896, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1263868896, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1263868896|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1263868896|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1263868896|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1263868896, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1263868896|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1263868896|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1263868896, ~x~0=~x~0_Out-1263868896} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ~x~0, ULTIMATE.start_main_#t~ite22, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-21 21:57:37,129 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:57:37,129 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [757] [2020-10-21 21:57:37,136 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:57:37,136 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:57:37,137 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:57:37,137 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:57:37,137 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:57:37,137 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:57:37,138 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:57:37,139 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:57:37,139 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:57:37,139 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:57:37,139 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:57:37,139 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:57:37,140 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:57:37,140 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:57:37,140 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:57:37,140 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:57:37,140 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:57:37,140 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:57:37,140 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:57:37,140 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:57:37,141 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:57:37,141 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:57:37,141 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:57:37,141 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:57:37,142 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:57:37,142 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:57:37,142 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:57:37,142 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:57:37,142 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:57:37,142 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:57:37,142 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:57:37,142 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:57:37,142 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:57:37,143 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:57:37,143 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:57:37,143 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:57:37,143 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:57:37,143 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:57:37,144 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:57:37,144 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:57:37,144 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:57:37,144 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:57:37,144 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:57:37,144 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:57:37,145 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:57:37,145 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:57:37,145 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:57:37,145 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:57:37,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 09:57:37 BasicIcfg [2020-10-21 21:57:37,196 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 21:57:37,198 INFO L168 Benchmark]: Toolchain (without parser) took 17573.90 ms. Allocated memory was 145.2 MB in the beginning and 442.0 MB in the end (delta: 296.7 MB). Free memory was 99.0 MB in the beginning and 259.5 MB in the end (delta: -160.5 MB). Peak memory consumption was 136.2 MB. Max. memory is 7.1 GB. [2020-10-21 21:57:37,199 INFO L168 Benchmark]: CDTParser took 4.38 ms. Allocated memory is still 145.2 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-21 21:57:37,200 INFO L168 Benchmark]: CACSL2BoogieTranslator took 785.28 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 98.2 MB in the beginning and 152.8 MB in the end (delta: -54.7 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. [2020-10-21 21:57:37,200 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.54 ms. Allocated memory is still 201.9 MB. Free memory was 152.8 MB in the beginning and 150.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-21 21:57:37,201 INFO L168 Benchmark]: Boogie Preprocessor took 35.91 ms. Allocated memory is still 201.9 MB. Free memory was 150.0 MB in the beginning and 147.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-21 21:57:37,202 INFO L168 Benchmark]: RCFGBuilder took 2056.89 ms. Allocated memory was 201.9 MB in the beginning and 253.2 MB in the end (delta: 51.4 MB). Free memory was 147.2 MB in the beginning and 192.7 MB in the end (delta: -45.4 MB). Peak memory consumption was 102.2 MB. Max. memory is 7.1 GB. [2020-10-21 21:57:37,203 INFO L168 Benchmark]: TraceAbstraction took 14576.69 ms. Allocated memory was 253.2 MB in the beginning and 442.0 MB in the end (delta: 188.7 MB). Free memory was 192.7 MB in the beginning and 259.5 MB in the end (delta: -66.8 MB). Peak memory consumption was 121.9 MB. Max. memory is 7.1 GB. [2020-10-21 21:57:37,207 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 4.38 ms. Allocated memory is still 145.2 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 785.28 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 98.2 MB in the beginning and 152.8 MB in the end (delta: -54.7 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 99.54 ms. Allocated memory is still 201.9 MB. Free memory was 152.8 MB in the beginning and 150.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.91 ms. Allocated memory is still 201.9 MB. Free memory was 150.0 MB in the beginning and 147.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2056.89 ms. Allocated memory was 201.9 MB in the beginning and 253.2 MB in the end (delta: 51.4 MB). Free memory was 147.2 MB in the beginning and 192.7 MB in the end (delta: -45.4 MB). Peak memory consumption was 102.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14576.69 ms. Allocated memory was 253.2 MB in the beginning and 442.0 MB in the end (delta: 188.7 MB). Free memory was 192.7 MB in the beginning and 259.5 MB in the end (delta: -66.8 MB). Peak memory consumption was 121.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 909 VarBasedMoverChecksPositive, 94 VarBasedMoverChecksNegative, 31 SemBasedMoverChecksPositive, 63 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 95 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 11.9s, 91 PlacesBefore, 28 PlacesAfterwards, 87 TransitionsBefore, 22 TransitionsAfterwards, 1182 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 85 TotalNumberOfCompositions, 3891 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L800] 0 pthread_t t1587; [L801] FCALL, FORK 0 pthread_create(&t1587, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] 0 pthread_t t1588; [L803] FCALL, FORK 0 pthread_create(&t1588, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L805] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L816] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 0 x$flush_delayed = weak$$choice2 [L819] 0 x$mem_tmp = x [L820] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L820] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L821] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L821] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L822] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L822] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L822] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L822] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L823] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L823] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L824] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L824] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L824] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L825] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L825] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L825] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L825] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L825] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L826] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L826] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L826] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L828] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L828] 0 x = x$flush_delayed ? x$mem_tmp : x [L829] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "rfi000_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 85 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.3s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.9s, HoareTripleCheckerStatistics: 178 SDtfs, 180 SDslu, 167 SDs, 0 SdLazy, 171 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred 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.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 137 NumberOfCodeBlocks, 137 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 7914 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...