/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/safe029_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 22:04:09,175 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 22:04:09,177 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 22:04:09,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 22:04:09,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 22:04:09,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 22:04:09,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 22:04:09,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 22:04:09,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 22:04:09,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 22:04:09,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 22:04:09,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 22:04:09,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 22:04:09,214 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 22:04:09,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 22:04:09,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 22:04:09,217 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 22:04:09,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 22:04:09,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 22:04:09,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 22:04:09,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 22:04:09,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 22:04:09,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 22:04:09,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 22:04:09,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 22:04:09,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 22:04:09,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 22:04:09,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 22:04:09,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 22:04:09,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 22:04:09,232 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 22:04:09,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 22:04:09,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 22:04:09,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 22:04:09,239 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 22:04:09,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 22:04:09,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 22:04:09,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 22:04:09,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 22:04:09,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 22:04:09,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 22:04:09,243 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 22:04:09,265 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 22:04:09,266 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 22:04:09,267 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 22:04:09,267 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 22:04:09,268 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 22:04:09,268 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 22:04:09,268 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 22:04:09,268 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 22:04:09,268 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 22:04:09,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 22:04:09,269 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 22:04:09,269 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 22:04:09,269 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 22:04:09,269 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 22:04:09,270 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 22:04:09,270 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 22:04:09,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 22:04:09,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 22:04:09,270 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 22:04:09,271 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 22:04:09,271 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 22:04:09,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 22:04:09,271 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 22:04:09,272 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-21 22:04:09,272 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 22:04:09,272 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 22:04:09,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 22:04:09,272 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 22:04:09,272 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-21 22:04:09,273 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-21 22:04:09,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 22:04:09,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 22:04:09,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 22:04:09,651 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 22:04:09,651 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 22:04:09,652 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i [2020-10-21 22:04:09,719 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9f8cc0bb/ec6f42eff62246189b2316d3565788b6/FLAG197b67562 [2020-10-21 22:04:10,269 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 22:04:10,270 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i [2020-10-21 22:04:10,296 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9f8cc0bb/ec6f42eff62246189b2316d3565788b6/FLAG197b67562 [2020-10-21 22:04:10,485 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9f8cc0bb/ec6f42eff62246189b2316d3565788b6 [2020-10-21 22:04:10,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 22:04:10,504 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 22:04:10,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 22:04:10,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 22:04:10,510 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 22:04:10,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:04:10" (1/1) ... [2020-10-21 22:04:10,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb43e23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:10, skipping insertion in model container [2020-10-21 22:04:10,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:04:10" (1/1) ... [2020-10-21 22:04:10,525 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 22:04:10,572 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 22:04:11,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 22:04:11,153 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 22:04:11,244 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 22:04:11,348 INFO L208 MainTranslator]: Completed translation [2020-10-21 22:04:11,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:11 WrapperNode [2020-10-21 22:04:11,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 22:04:11,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 22:04:11,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 22:04:11,352 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 22:04:11,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:11" (1/1) ... [2020-10-21 22:04:11,413 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:11" (1/1) ... [2020-10-21 22:04:11,476 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 22:04:11,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 22:04:11,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 22:04:11,477 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 22:04:11,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:11" (1/1) ... [2020-10-21 22:04:11,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:11" (1/1) ... [2020-10-21 22:04:11,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:11" (1/1) ... [2020-10-21 22:04:11,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:11" (1/1) ... [2020-10-21 22:04:11,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:11" (1/1) ... [2020-10-21 22:04:11,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:11" (1/1) ... [2020-10-21 22:04:11,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:11" (1/1) ... [2020-10-21 22:04:11,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 22:04:11,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 22:04:11,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 22:04:11,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 22:04:11,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:11" (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 22:04:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 22:04:11,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 22:04:11,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 22:04:11,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 22:04:11,626 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 22:04:11,627 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 22:04:11,627 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 22:04:11,628 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 22:04:11,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 22:04:11,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 22:04:11,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 22:04:11,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 22:04:11,632 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 22:04:13,670 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 22:04:13,670 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 22:04:13,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:04:13 BoogieIcfgContainer [2020-10-21 22:04:13,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 22:04:13,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 22:04:13,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 22:04:13,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 22:04:13,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 10:04:10" (1/3) ... [2020-10-21 22:04:13,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa408b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:04:13, skipping insertion in model container [2020-10-21 22:04:13,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:11" (2/3) ... [2020-10-21 22:04:13,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa408b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:04:13, skipping insertion in model container [2020-10-21 22:04:13,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:04:13" (3/3) ... [2020-10-21 22:04:13,682 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_rmo.opt.i [2020-10-21 22:04:13,695 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 22:04:13,695 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-21 22:04:13,704 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 22:04:13,705 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 22:04:13,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,735 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,735 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,738 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,738 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,739 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,739 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,739 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,739 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,740 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,740 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,740 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,740 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,740 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,740 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,748 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,748 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,751 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,752 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,752 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:13,756 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 22:04:13,771 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-21 22:04:13,794 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 22:04:13,794 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 22:04:13,794 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-21 22:04:13,795 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 22:04:13,795 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 22:04:13,795 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 22:04:13,795 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 22:04:13,795 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 22:04:13,809 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-21 22:04:13,812 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 83 transitions, 176 flow [2020-10-21 22:04:13,816 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 83 transitions, 176 flow [2020-10-21 22:04:13,818 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 176 flow [2020-10-21 22:04:13,860 INFO L129 PetriNetUnfolder]: 3/81 cut-off events. [2020-10-21 22:04:13,861 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 22:04:13,865 INFO L80 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 3/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2020-10-21 22:04:13,868 INFO L116 LiptonReduction]: Number of co-enabled transitions 1038 [2020-10-21 22:04:14,174 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-21 22:04:14,294 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-21 22:04:14,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 22:04:14,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:14,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-21 22:04:14,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:14,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-21 22:04:14,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:14,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 22:04:14,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-21 22:04:14,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 22:04:14,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:14,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:14,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:14,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 22:04:14,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:14,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:14,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:14,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:14,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:04:14,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:14,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:04:14,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:14,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:04:14,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 22:04:14,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:14,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 22:04:14,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:14,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 22:04:14,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:15,138 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-21 22:04:15,334 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:04:15,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:15,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-21 22:04:15,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:15,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:04:15,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:15,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-21 22:04:15,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:15,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:15,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:15,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:15,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:04:15,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:04:15,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:04:15,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 22:04:15,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:15,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:15,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:15,593 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-21 22:04:15,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:15,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-21 22:04:15,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:15,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 22:04:15,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-21 22:04:15,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 22:04:15,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:15,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:15,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:15,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:15,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:15,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:15,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:15,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:15,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:15,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:15,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:15,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:15,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:15,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:15,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:15,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:15,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:15,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:15,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:15,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:15,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:15,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:15,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:16,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:16,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:16,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:16,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:16,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:16,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:16,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:16,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:16,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:16,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:16,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:16,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:16,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:16,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:16,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:16,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:16,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:04:16,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:16,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-21 22:04:16,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:16,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:04:16,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:16,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-21 22:04:16,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:16,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 22:04:16,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:16,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:16,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:16,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:16,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:16,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:16,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:16,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:16,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:16,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:16,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:16,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:16,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:16,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:16,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:16,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:16,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:16,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:04:16,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:16,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-21 22:04:16,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:16,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:04:16,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:16,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-21 22:04:16,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:17,787 WARN L193 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-21 22:04:17,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-21 22:04:17,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:17,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-21 22:04:17,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:18,719 WARN L193 SmtUtils]: Spent 900.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 113 [2020-10-21 22:04:19,798 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 227 DAG size of output: 187 [2020-10-21 22:04:19,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-21 22:04:19,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:19,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-21 22:04:19,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:20,756 WARN L193 SmtUtils]: Spent 926.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 106 [2020-10-21 22:04:20,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:20,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:20,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:20,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:20,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:20,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:20,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:20,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:20,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:20,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:20,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:20,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:20,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:20,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:20,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:20,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:20,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:20,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:20,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:20,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:20,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:20,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:20,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:20,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:20,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:20,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:20,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:20,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:20,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:20,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:20,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:20,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:20,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:20,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:20,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:20,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:20,923 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:20,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:20,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:20,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:20,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:20,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:20,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:20,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:20,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:20,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:20,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:20,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:21,383 WARN L193 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2020-10-21 22:04:21,744 WARN L193 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2020-10-21 22:04:21,902 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-10-21 22:04:22,384 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-10-21 22:04:22,689 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-10-21 22:04:23,212 WARN L193 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-21 22:04:23,523 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-21 22:04:23,948 WARN L193 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2020-10-21 22:04:24,112 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-10-21 22:04:24,165 INFO L131 LiptonReduction]: Checked pairs total: 2666 [2020-10-21 22:04:24,166 INFO L133 LiptonReduction]: Total number of compositions: 78 [2020-10-21 22:04:24,173 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 20 transitions, 50 flow [2020-10-21 22:04:24,190 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 162 states. [2020-10-21 22:04:24,193 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2020-10-21 22:04:24,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-21 22:04:24,199 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:24,200 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-21 22:04:24,201 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:24,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:24,207 INFO L82 PathProgramCache]: Analyzing trace with hash 907060207, now seen corresponding path program 1 times [2020-10-21 22:04:24,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:24,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988121152] [2020-10-21 22:04:24,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:24,474 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 22:04:24,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988121152] [2020-10-21 22:04:24,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:24,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:04:24,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906284484] [2020-10-21 22:04:24,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:04:24,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:24,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:04:24,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:04:24,503 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 3 states. [2020-10-21 22:04:24,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:24,599 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-10-21 22:04:24,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:04:24,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-21 22:04:24,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:24,613 INFO L225 Difference]: With dead ends: 137 [2020-10-21 22:04:24,613 INFO L226 Difference]: Without dead ends: 112 [2020-10-21 22:04:24,614 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 22:04:24,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-21 22:04:24,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-21 22:04:24,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-21 22:04:24,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-10-21 22:04:24,667 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 5 [2020-10-21 22:04:24,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:24,668 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-10-21 22:04:24,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:04:24,668 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-10-21 22:04:24,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-21 22:04:24,669 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:24,669 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:24,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 22:04:24,670 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:24,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:24,670 INFO L82 PathProgramCache]: Analyzing trace with hash -193428177, now seen corresponding path program 1 times [2020-10-21 22:04:24,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:24,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776516983] [2020-10-21 22:04:24,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:24,769 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 22:04:24,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776516983] [2020-10-21 22:04:24,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:24,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:04:24,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590510742] [2020-10-21 22:04:24,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:04:24,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:24,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:04:24,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:04:24,772 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 3 states. [2020-10-21 22:04:24,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:24,786 INFO L93 Difference]: Finished difference Result 110 states and 249 transitions. [2020-10-21 22:04:24,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:04:24,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-21 22:04:24,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:24,791 INFO L225 Difference]: With dead ends: 110 [2020-10-21 22:04:24,792 INFO L226 Difference]: Without dead ends: 110 [2020-10-21 22:04:24,793 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 22:04:24,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-21 22:04:24,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-10-21 22:04:24,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-10-21 22:04:24,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 249 transitions. [2020-10-21 22:04:24,806 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 249 transitions. Word has length 7 [2020-10-21 22:04:24,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:24,807 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 249 transitions. [2020-10-21 22:04:24,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:04:24,807 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 249 transitions. [2020-10-21 22:04:24,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-21 22:04:24,808 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:24,808 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:24,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 22:04:24,808 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:24,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:24,809 INFO L82 PathProgramCache]: Analyzing trace with hash 2141230383, now seen corresponding path program 1 times [2020-10-21 22:04:24,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:24,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073817735] [2020-10-21 22:04:24,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:24,963 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 22:04:24,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073817735] [2020-10-21 22:04:24,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:24,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:04:24,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658068394] [2020-10-21 22:04:24,965 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:04:24,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:24,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:04:24,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:04:24,966 INFO L87 Difference]: Start difference. First operand 110 states and 249 transitions. Second operand 3 states. [2020-10-21 22:04:25,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:25,003 INFO L93 Difference]: Finished difference Result 106 states and 238 transitions. [2020-10-21 22:04:25,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:04:25,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-10-21 22:04:25,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:25,006 INFO L225 Difference]: With dead ends: 106 [2020-10-21 22:04:25,006 INFO L226 Difference]: Without dead ends: 106 [2020-10-21 22:04:25,006 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:04:25,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-21 22:04:25,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-10-21 22:04:25,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-21 22:04:25,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 238 transitions. [2020-10-21 22:04:25,017 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 238 transitions. Word has length 8 [2020-10-21 22:04:25,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:25,018 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 238 transitions. [2020-10-21 22:04:25,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:04:25,018 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 238 transitions. [2020-10-21 22:04:25,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 22:04:25,019 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:25,019 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:25,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 22:04:25,020 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:25,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:25,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1953631552, now seen corresponding path program 1 times [2020-10-21 22:04:25,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:25,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608629600] [2020-10-21 22:04:25,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:25,153 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 22:04:25,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608629600] [2020-10-21 22:04:25,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:25,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:04:25,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420296794] [2020-10-21 22:04:25,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:04:25,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:25,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:04:25,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:04:25,157 INFO L87 Difference]: Start difference. First operand 106 states and 238 transitions. Second operand 5 states. [2020-10-21 22:04:25,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:25,248 INFO L93 Difference]: Finished difference Result 103 states and 229 transitions. [2020-10-21 22:04:25,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:04:25,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-21 22:04:25,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:25,251 INFO L225 Difference]: With dead ends: 103 [2020-10-21 22:04:25,251 INFO L226 Difference]: Without dead ends: 103 [2020-10-21 22:04:25,252 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:04:25,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-10-21 22:04:25,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-10-21 22:04:25,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-21 22:04:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 229 transitions. [2020-10-21 22:04:25,269 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 229 transitions. Word has length 9 [2020-10-21 22:04:25,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:25,271 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 229 transitions. [2020-10-21 22:04:25,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:04:25,271 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 229 transitions. [2020-10-21 22:04:25,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-21 22:04:25,272 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:25,273 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:25,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 22:04:25,273 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:25,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:25,273 INFO L82 PathProgramCache]: Analyzing trace with hash 433034188, now seen corresponding path program 1 times [2020-10-21 22:04:25,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:25,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883426796] [2020-10-21 22:04:25,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:25,355 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 22:04:25,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883426796] [2020-10-21 22:04:25,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:25,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:04:25,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440576505] [2020-10-21 22:04:25,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:04:25,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:25,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:04:25,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:04:25,357 INFO L87 Difference]: Start difference. First operand 103 states and 229 transitions. Second operand 5 states. [2020-10-21 22:04:25,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:25,422 INFO L93 Difference]: Finished difference Result 109 states and 239 transitions. [2020-10-21 22:04:25,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:04:25,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-21 22:04:25,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:25,426 INFO L225 Difference]: With dead ends: 109 [2020-10-21 22:04:25,426 INFO L226 Difference]: Without dead ends: 109 [2020-10-21 22:04:25,427 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 22:04:25,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-21 22:04:25,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2020-10-21 22:04:25,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-21 22:04:25,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 236 transitions. [2020-10-21 22:04:25,435 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 236 transitions. Word has length 10 [2020-10-21 22:04:25,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:25,436 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 236 transitions. [2020-10-21 22:04:25,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:04:25,436 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 236 transitions. [2020-10-21 22:04:25,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-21 22:04:25,437 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:25,438 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:25,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 22:04:25,438 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:25,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:25,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1426394591, now seen corresponding path program 1 times [2020-10-21 22:04:25,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:25,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487020168] [2020-10-21 22:04:25,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:25,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 22:04:25,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487020168] [2020-10-21 22:04:25,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:25,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 22:04:25,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061997298] [2020-10-21 22:04:25,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:04:25,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:25,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:04:25,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:04:25,484 INFO L87 Difference]: Start difference. First operand 107 states and 236 transitions. Second operand 3 states. [2020-10-21 22:04:25,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:25,497 INFO L93 Difference]: Finished difference Result 153 states and 326 transitions. [2020-10-21 22:04:25,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:04:25,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-21 22:04:25,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:25,499 INFO L225 Difference]: With dead ends: 153 [2020-10-21 22:04:25,499 INFO L226 Difference]: Without dead ends: 111 [2020-10-21 22:04:25,500 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:04:25,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-10-21 22:04:25,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2020-10-21 22:04:25,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-10-21 22:04:25,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 219 transitions. [2020-10-21 22:04:25,506 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 219 transitions. Word has length 10 [2020-10-21 22:04:25,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:25,506 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 219 transitions. [2020-10-21 22:04:25,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:04:25,506 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 219 transitions. [2020-10-21 22:04:25,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 22:04:25,507 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:25,508 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:25,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 22:04:25,508 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:25,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:25,508 INFO L82 PathProgramCache]: Analyzing trace with hash 539156191, now seen corresponding path program 1 times [2020-10-21 22:04:25,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:25,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186094524] [2020-10-21 22:04:25,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:25,684 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 22:04:25,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186094524] [2020-10-21 22:04:25,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:25,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:04:25,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847330955] [2020-10-21 22:04:25,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:04:25,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:25,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:04:25,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:04:25,687 INFO L87 Difference]: Start difference. First operand 105 states and 219 transitions. Second operand 6 states. [2020-10-21 22:04:25,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:25,785 INFO L93 Difference]: Finished difference Result 132 states and 256 transitions. [2020-10-21 22:04:25,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:04:25,786 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-21 22:04:25,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:25,787 INFO L225 Difference]: With dead ends: 132 [2020-10-21 22:04:25,787 INFO L226 Difference]: Without dead ends: 102 [2020-10-21 22:04:25,788 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:04:25,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-21 22:04:25,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2020-10-21 22:04:25,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-10-21 22:04:25,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 187 transitions. [2020-10-21 22:04:25,792 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 187 transitions. Word has length 11 [2020-10-21 22:04:25,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:25,793 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 187 transitions. [2020-10-21 22:04:25,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:04:25,793 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 187 transitions. [2020-10-21 22:04:25,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 22:04:25,794 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:25,794 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:25,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 22:04:25,794 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:25,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:25,795 INFO L82 PathProgramCache]: Analyzing trace with hash 538320121, now seen corresponding path program 2 times [2020-10-21 22:04:25,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:25,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572652632] [2020-10-21 22:04:25,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:25,893 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 22:04:25,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572652632] [2020-10-21 22:04:25,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:25,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:04:25,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346793894] [2020-10-21 22:04:25,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:04:25,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:25,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:04:25,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:04:25,896 INFO L87 Difference]: Start difference. First operand 96 states and 187 transitions. Second operand 6 states. [2020-10-21 22:04:25,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:25,972 INFO L93 Difference]: Finished difference Result 104 states and 197 transitions. [2020-10-21 22:04:25,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:04:25,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-21 22:04:25,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:25,975 INFO L225 Difference]: With dead ends: 104 [2020-10-21 22:04:25,975 INFO L226 Difference]: Without dead ends: 95 [2020-10-21 22:04:25,975 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:04:25,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-10-21 22:04:25,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-10-21 22:04:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-10-21 22:04:25,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 182 transitions. [2020-10-21 22:04:25,979 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 182 transitions. Word has length 11 [2020-10-21 22:04:25,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:25,980 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 182 transitions. [2020-10-21 22:04:25,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:04:25,980 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 182 transitions. [2020-10-21 22:04:25,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 22:04:25,981 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:25,981 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:25,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 22:04:25,981 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:25,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:25,982 INFO L82 PathProgramCache]: Analyzing trace with hash 538294081, now seen corresponding path program 3 times [2020-10-21 22:04:25,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:25,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543107498] [2020-10-21 22:04:25,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:26,082 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 22:04:26,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543107498] [2020-10-21 22:04:26,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:26,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:04:26,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987691962] [2020-10-21 22:04:26,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:04:26,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:26,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:04:26,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:04:26,085 INFO L87 Difference]: Start difference. First operand 95 states and 182 transitions. Second operand 6 states. [2020-10-21 22:04:26,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:26,193 INFO L93 Difference]: Finished difference Result 97 states and 183 transitions. [2020-10-21 22:04:26,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:04:26,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-21 22:04:26,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:26,195 INFO L225 Difference]: With dead ends: 97 [2020-10-21 22:04:26,195 INFO L226 Difference]: Without dead ends: 79 [2020-10-21 22:04:26,196 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-21 22:04:26,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-21 22:04:26,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-10-21 22:04:26,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-21 22:04:26,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 148 transitions. [2020-10-21 22:04:26,199 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 148 transitions. Word has length 11 [2020-10-21 22:04:26,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:26,199 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 148 transitions. [2020-10-21 22:04:26,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:04:26,200 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 148 transitions. [2020-10-21 22:04:26,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 22:04:26,200 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:26,200 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:26,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 22:04:26,201 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:26,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:26,201 INFO L82 PathProgramCache]: Analyzing trace with hash 475759021, now seen corresponding path program 4 times [2020-10-21 22:04:26,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:26,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184727955] [2020-10-21 22:04:26,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:26,412 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 22:04:26,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184727955] [2020-10-21 22:04:26,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:26,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 22:04:26,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374923622] [2020-10-21 22:04:26,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 22:04:26,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:26,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 22:04:26,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-21 22:04:26,415 INFO L87 Difference]: Start difference. First operand 79 states and 148 transitions. Second operand 7 states. [2020-10-21 22:04:26,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:26,579 INFO L93 Difference]: Finished difference Result 75 states and 140 transitions. [2020-10-21 22:04:26,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:04:26,580 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-10-21 22:04:26,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:26,581 INFO L225 Difference]: With dead ends: 75 [2020-10-21 22:04:26,581 INFO L226 Difference]: Without dead ends: 63 [2020-10-21 22:04:26,581 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-21 22:04:26,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-21 22:04:26,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-21 22:04:26,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-21 22:04:26,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 122 transitions. [2020-10-21 22:04:26,584 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 122 transitions. Word has length 11 [2020-10-21 22:04:26,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:26,585 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 122 transitions. [2020-10-21 22:04:26,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 22:04:26,585 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 122 transitions. [2020-10-21 22:04:26,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 22:04:26,585 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:26,586 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:26,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 22:04:26,586 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:26,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:26,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1268585729, now seen corresponding path program 1 times [2020-10-21 22:04:26,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:26,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516448190] [2020-10-21 22:04:26,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:26,677 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 22:04:26,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516448190] [2020-10-21 22:04:26,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:26,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:04:26,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158346784] [2020-10-21 22:04:26,678 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:04:26,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:26,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:04:26,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:04:26,679 INFO L87 Difference]: Start difference. First operand 63 states and 122 transitions. Second operand 4 states. [2020-10-21 22:04:26,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:26,748 INFO L93 Difference]: Finished difference Result 78 states and 141 transitions. [2020-10-21 22:04:26,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:04:26,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-21 22:04:26,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:26,750 INFO L225 Difference]: With dead ends: 78 [2020-10-21 22:04:26,750 INFO L226 Difference]: Without dead ends: 61 [2020-10-21 22:04:26,751 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 2 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 22:04:26,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-10-21 22:04:26,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-10-21 22:04:26,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-21 22:04:26,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 118 transitions. [2020-10-21 22:04:26,753 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 118 transitions. Word has length 11 [2020-10-21 22:04:26,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:26,754 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 118 transitions. [2020-10-21 22:04:26,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:04:26,754 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 118 transitions. [2020-10-21 22:04:26,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 22:04:26,754 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:26,755 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:26,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 22:04:26,755 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:26,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:26,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1626460929, now seen corresponding path program 2 times [2020-10-21 22:04:26,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:26,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696788196] [2020-10-21 22:04:26,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:26,813 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 22:04:26,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696788196] [2020-10-21 22:04:26,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:26,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:04:26,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74390518] [2020-10-21 22:04:26,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:04:26,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:26,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:04:26,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:04:26,816 INFO L87 Difference]: Start difference. First operand 61 states and 118 transitions. Second operand 4 states. [2020-10-21 22:04:26,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:26,845 INFO L93 Difference]: Finished difference Result 56 states and 89 transitions. [2020-10-21 22:04:26,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:04:26,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-21 22:04:26,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:26,847 INFO L225 Difference]: With dead ends: 56 [2020-10-21 22:04:26,847 INFO L226 Difference]: Without dead ends: 40 [2020-10-21 22:04:26,847 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 22:04:26,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-10-21 22:04:26,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-10-21 22:04:26,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-10-21 22:04:26,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2020-10-21 22:04:26,849 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 11 [2020-10-21 22:04:26,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:26,850 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2020-10-21 22:04:26,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:04:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2020-10-21 22:04:26,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 22:04:26,851 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:26,851 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:26,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 22:04:26,851 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:26,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:26,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1119968960, now seen corresponding path program 1 times [2020-10-21 22:04:26,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:26,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033335895] [2020-10-21 22:04:26,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:26,923 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 22:04:26,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033335895] [2020-10-21 22:04:26,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:26,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:04:26,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212075283] [2020-10-21 22:04:26,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:04:26,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:26,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:04:26,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:04:26,925 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 5 states. [2020-10-21 22:04:26,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:26,965 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2020-10-21 22:04:26,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 22:04:26,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-21 22:04:26,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:26,966 INFO L225 Difference]: With dead ends: 31 [2020-10-21 22:04:26,966 INFO L226 Difference]: Without dead ends: 20 [2020-10-21 22:04:26,967 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 22:04:26,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-10-21 22:04:26,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-21 22:04:26,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-21 22:04:26,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-10-21 22:04:26,969 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2020-10-21 22:04:26,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:26,970 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-10-21 22:04:26,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:04:26,970 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-10-21 22:04:26,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 22:04:26,971 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:26,971 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:26,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 22:04:26,972 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:26,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:26,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1283443941, now seen corresponding path program 1 times [2020-10-21 22:04:26,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:26,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426026095] [2020-10-21 22:04:26,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 22:04:27,013 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 22:04:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 22:04:27,044 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 22:04:27,095 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 22:04:27,095 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 22:04:27,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 22:04:27,097 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 22:04:27,110 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] L3-->L804: Formula: (let ((.cse8 (= (mod ~x$r_buff1_thd0~0_In1939332646 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In1939332646 256) 0)) (.cse6 (= (mod ~x$r_buff0_thd0~0_In1939332646 256) 0)) (.cse7 (= (mod ~x$w_buff0_used~0_In1939332646 256) 0))) (let ((.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse8 .cse9)) (.cse3 (or .cse6 .cse7))) (and (or (and .cse0 .cse1 (= ~x$w_buff1_used~0_Out1939332646 0)) (and (= ~x$w_buff1_used~0_In1939332646 ~x$w_buff1_used~0_Out1939332646) .cse2)) (or (and .cse3 (= ~x$w_buff0_used~0_Out1939332646 ~x$w_buff0_used~0_In1939332646)) (and (= ~x$w_buff0_used~0_Out1939332646 0) .cse4 .cse5)) (= ~x$r_buff1_thd0~0_Out1939332646 ~x$r_buff1_thd0~0_In1939332646) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In1939332646 0)) (or (and (= ~x$w_buff0~0_In1939332646 ~x~0_Out1939332646) .cse4 .cse5) (and (or (and (= ~x$w_buff1~0_In1939332646 ~x~0_Out1939332646) .cse0 .cse1) (and .cse2 (= ~x~0_In1939332646 ~x~0_Out1939332646))) .cse3)) (= ~x$r_buff0_thd0~0_In1939332646 ~x$r_buff0_thd0~0_Out1939332646)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1939332646, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1939332646, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1939332646, ~x$w_buff1~0=~x$w_buff1~0_In1939332646, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1939332646, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1939332646, ~x~0=~x~0_In1939332646, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1939332646} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1939332646, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out1939332646, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1939332646|, ~x$w_buff1~0=~x$w_buff1~0_In1939332646, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1939332646|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1939332646, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1939332646, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1939332646|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1939332646|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1939332646|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1939332646, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1939332646|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1939332646, ~x~0=~x~0_Out1939332646} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, 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 22:04:27,116 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 22:04:27,116 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [753] [2020-10-21 22:04:27,118 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 22:04:27,118 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:27,118 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 22:04:27,119 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:27,119 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 22:04:27,119 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:27,119 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 22:04:27,119 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:27,120 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 22:04:27,120 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:27,120 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 22:04:27,120 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:27,121 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 22:04:27,121 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:27,121 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 22:04:27,121 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:27,122 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 22:04:27,122 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:27,122 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 22:04:27,122 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:27,122 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 22:04:27,122 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:27,123 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 22:04:27,124 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:27,124 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 22:04:27,124 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:27,124 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 22:04:27,124 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:27,124 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 22:04:27,125 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:27,125 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 22:04:27,125 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:27,125 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 22:04:27,125 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:27,126 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 22:04:27,126 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:27,126 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 22:04:27,126 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:27,126 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 22:04:27,126 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:27,127 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 22:04:27,127 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:27,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 10:04:27 BasicIcfg [2020-10-21 22:04:27,174 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 22:04:27,176 INFO L168 Benchmark]: Toolchain (without parser) took 16677.91 ms. Allocated memory was 140.0 MB in the beginning and 393.2 MB in the end (delta: 253.2 MB). Free memory was 101.3 MB in the beginning and 245.3 MB in the end (delta: -144.0 MB). Peak memory consumption was 109.3 MB. Max. memory is 7.1 GB. [2020-10-21 22:04:27,177 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-10-21 22:04:27,178 INFO L168 Benchmark]: CACSL2BoogieTranslator took 845.24 ms. Allocated memory was 140.0 MB in the beginning and 199.8 MB in the end (delta: 59.8 MB). Free memory was 100.3 MB in the beginning and 151.3 MB in the end (delta: -51.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2020-10-21 22:04:27,179 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.51 ms. Allocated memory is still 199.8 MB. Free memory was 151.3 MB in the beginning and 147.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-10-21 22:04:27,179 INFO L168 Benchmark]: Boogie Preprocessor took 39.91 ms. Allocated memory is still 199.8 MB. Free memory was 147.9 MB in the beginning and 145.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-21 22:04:27,180 INFO L168 Benchmark]: RCFGBuilder took 2156.33 ms. Allocated memory was 199.8 MB in the beginning and 247.5 MB in the end (delta: 47.7 MB). Free memory was 145.9 MB in the beginning and 192.4 MB in the end (delta: -46.6 MB). Peak memory consumption was 102.4 MB. Max. memory is 7.1 GB. [2020-10-21 22:04:27,181 INFO L168 Benchmark]: TraceAbstraction took 13499.31 ms. Allocated memory was 247.5 MB in the beginning and 393.2 MB in the end (delta: 145.8 MB). Free memory was 192.4 MB in the beginning and 245.3 MB in the end (delta: -52.9 MB). Peak memory consumption was 92.9 MB. Max. memory is 7.1 GB. [2020-10-21 22:04:27,185 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 845.24 ms. Allocated memory was 140.0 MB in the beginning and 199.8 MB in the end (delta: 59.8 MB). Free memory was 100.3 MB in the beginning and 151.3 MB in the end (delta: -51.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 124.51 ms. Allocated memory is still 199.8 MB. Free memory was 151.3 MB in the beginning and 147.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.91 ms. Allocated memory is still 199.8 MB. Free memory was 147.9 MB in the beginning and 145.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2156.33 ms. Allocated memory was 199.8 MB in the beginning and 247.5 MB in the end (delta: 47.7 MB). Free memory was 145.9 MB in the beginning and 192.4 MB in the end (delta: -46.6 MB). Peak memory consumption was 102.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13499.31 ms. Allocated memory was 247.5 MB in the beginning and 393.2 MB in the end (delta: 145.8 MB). Free memory was 192.4 MB in the beginning and 245.3 MB in the end (delta: -52.9 MB). Peak memory consumption was 92.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 694 VarBasedMoverChecksPositive, 62 VarBasedMoverChecksNegative, 22 SemBasedMoverChecksPositive, 40 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 68 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.3s, 87 PlacesBefore, 26 PlacesAfterwards, 83 TransitionsBefore, 20 TransitionsAfterwards, 1038 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 78 TotalNumberOfCompositions, 2666 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; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2483; [L791] FCALL, FORK 0 pthread_create(&t2483, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L792] 0 pthread_t t2484; [L793] FCALL, FORK 0 pthread_create(&t2484, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=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] [L765] 2 y = 1 VAL [__unbuffered_cnt=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] [L734] 1 y = 2 VAL [__unbuffered_cnt=0, 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] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, 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] [L768] 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) [L768] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L768] 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) [L768] 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) [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] 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 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L772] 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 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L740] 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) [L740] 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) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 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 [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L744] 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 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 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) [L810] 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) [L811] 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)) [L811] 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)) [L812] 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)) [L812] 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)) [L813] 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)) [L813] EXPR 0 !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) [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] EXPR 0 !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) [L813] 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)) [L813] 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)) [L814] 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)) [L814] 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)) [L815] 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)) [L815] 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)) [L816] 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)) [L816] 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)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe029_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, 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, 81 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.3s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.3s, HoareTripleCheckerStatistics: 199 SDtfs, 145 SDslu, 218 SDs, 0 SdLazy, 231 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred 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.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 8551 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...