/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/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 02:10:55,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 02:10:55,227 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 02:10:55,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 02:10:55,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 02:10:55,276 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 02:10:55,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 02:10:55,283 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 02:10:55,286 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 02:10:55,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 02:10:55,289 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 02:10:55,290 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 02:10:55,291 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 02:10:55,294 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 02:10:55,296 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 02:10:55,297 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 02:10:55,299 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 02:10:55,300 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 02:10:55,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 02:10:55,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 02:10:55,305 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 02:10:55,309 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 02:10:55,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 02:10:55,311 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 02:10:55,313 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 02:10:55,313 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 02:10:55,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 02:10:55,314 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 02:10:55,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 02:10:55,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 02:10:55,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 02:10:55,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 02:10:55,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 02:10:55,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 02:10:55,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 02:10:55,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 02:10:55,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 02:10:55,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 02:10:55,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 02:10:55,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 02:10:55,321 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 02:10:55,322 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf [2020-10-22 02:10:55,344 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 02:10:55,344 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 02:10:55,345 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 02:10:55,345 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 02:10:55,346 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 02:10:55,346 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 02:10:55,346 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 02:10:55,346 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 02:10:55,346 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 02:10:55,347 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 02:10:55,347 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 02:10:55,347 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 02:10:55,347 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 02:10:55,347 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 02:10:55,348 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 02:10:55,348 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 02:10:55,348 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 02:10:55,348 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 02:10:55,348 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 02:10:55,349 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 02:10:55,349 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 02:10:55,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 02:10:55,349 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 02:10:55,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 02:10:55,350 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 02:10:55,350 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 02:10:55,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 02:10:55,350 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 02:10:55,351 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 02:10:55,351 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 02:10:55,351 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 02:10:55,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 02:10:55,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 02:10:55,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 02:10:55,669 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 02:10:55,669 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 02:10:55,670 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_rmo.opt.i [2020-10-22 02:10:55,738 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aebac873/2c901b835a2c4584be2ff6a26dd57b7a/FLAG24a4378ab [2020-10-22 02:10:56,342 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 02:10:56,343 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_rmo.opt.i [2020-10-22 02:10:56,358 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aebac873/2c901b835a2c4584be2ff6a26dd57b7a/FLAG24a4378ab [2020-10-22 02:10:56,585 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aebac873/2c901b835a2c4584be2ff6a26dd57b7a [2020-10-22 02:10:56,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 02:10:56,603 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 02:10:56,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 02:10:56,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 02:10:56,608 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 02:10:56,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:10:56" (1/1) ... [2020-10-22 02:10:56,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e8780d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:56, skipping insertion in model container [2020-10-22 02:10:56,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:10:56" (1/1) ... [2020-10-22 02:10:56,621 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 02:10:56,670 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 02:10:57,239 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:10:57,257 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 02:10:57,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:10:57,447 INFO L208 MainTranslator]: Completed translation [2020-10-22 02:10:57,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:57 WrapperNode [2020-10-22 02:10:57,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 02:10:57,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 02:10:57,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 02:10:57,449 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 02:10:57,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:57" (1/1) ... [2020-10-22 02:10:57,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:57" (1/1) ... [2020-10-22 02:10:57,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 02:10:57,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 02:10:57,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 02:10:57,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 02:10:57,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:57" (1/1) ... [2020-10-22 02:10:57,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:57" (1/1) ... [2020-10-22 02:10:57,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:57" (1/1) ... [2020-10-22 02:10:57,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:57" (1/1) ... [2020-10-22 02:10:57,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:57" (1/1) ... [2020-10-22 02:10:57,549 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:57" (1/1) ... [2020-10-22 02:10:57,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:57" (1/1) ... [2020-10-22 02:10:57,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 02:10:57,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 02:10:57,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 02:10:57,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 02:10:57,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:57" (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-22 02:10:57,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 02:10:57,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 02:10:57,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 02:10:57,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 02:10:57,649 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 02:10:57,649 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 02:10:57,649 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 02:10:57,649 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 02:10:57,650 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 02:10:57,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 02:10:57,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 02:10:57,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 02:10:57,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 02:10:57,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 02:10:57,653 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 02:10:59,626 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 02:10:59,627 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 02:10:59,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:10:59 BoogieIcfgContainer [2020-10-22 02:10:59,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 02:10:59,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 02:10:59,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 02:10:59,634 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 02:10:59,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 02:10:56" (1/3) ... [2020-10-22 02:10:59,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710b49d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:10:59, skipping insertion in model container [2020-10-22 02:10:59,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:57" (2/3) ... [2020-10-22 02:10:59,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710b49d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:10:59, skipping insertion in model container [2020-10-22 02:10:59,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:10:59" (3/3) ... [2020-10-22 02:10:59,638 INFO L111 eAbstractionObserver]: Analyzing ICFG safe001_rmo.opt.i [2020-10-22 02:10:59,649 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 02:10:59,650 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 02:10:59,657 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 02:10:59,658 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 02:10:59,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,691 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,691 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,694 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,695 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,695 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,696 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,699 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,700 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,707 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,708 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,712 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,714 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,714 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,716 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,716 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:59,719 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 02:10:59,735 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-22 02:10:59,757 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 02:10:59,757 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 02:10:59,757 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 02:10:59,757 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 02:10:59,757 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 02:10:59,757 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 02:10:59,758 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 02:10:59,758 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 02:10:59,771 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 02:10:59,772 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 101 transitions, 217 flow [2020-10-22 02:10:59,775 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 101 transitions, 217 flow [2020-10-22 02:10:59,777 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 108 places, 101 transitions, 217 flow [2020-10-22 02:10:59,829 INFO L129 PetriNetUnfolder]: 3/98 cut-off events. [2020-10-22 02:10:59,829 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 02:10:59,834 INFO L80 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 3/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2020-10-22 02:10:59,838 INFO L116 LiptonReduction]: Number of co-enabled transitions 1862 [2020-10-22 02:11:00,450 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-10-22 02:11:01,580 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2020-10-22 02:11:01,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-22 02:11:01,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:11:01,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-22 02:11:01,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:11:02,843 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2020-10-22 02:11:03,556 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-10-22 02:11:04,820 WARN L193 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2020-10-22 02:11:05,129 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-22 02:11:06,420 WARN L193 SmtUtils]: Spent 994.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 132 [2020-10-22 02:11:06,787 WARN L193 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-22 02:11:07,201 WARN L193 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-10-22 02:11:07,388 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-22 02:11:07,396 INFO L131 LiptonReduction]: Checked pairs total: 5081 [2020-10-22 02:11:07,397 INFO L133 LiptonReduction]: Total number of compositions: 89 [2020-10-22 02:11:07,403 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-22 02:11:07,455 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 822 states. [2020-10-22 02:11:07,457 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states. [2020-10-22 02:11:07,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-22 02:11:07,467 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:07,468 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-22 02:11:07,468 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:07,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:07,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1048842805, now seen corresponding path program 1 times [2020-10-22 02:11:07,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:07,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714674376] [2020-10-22 02:11:07,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:11:07,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:11:07,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714674376] [2020-10-22 02:11:07,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:11:07,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:11:07,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [129858874] [2020-10-22 02:11:07,731 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:11:07,734 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:11:07,746 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-10-22 02:11:07,747 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:11:07,751 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:11:07,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:11:07,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:11:07,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:11:07,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:11:07,769 INFO L87 Difference]: Start difference. First operand 822 states. Second operand 3 states. [2020-10-22 02:11:07,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:11:07,885 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-10-22 02:11:07,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:11:07,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-22 02:11:07,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:11:07,909 INFO L225 Difference]: With dead ends: 687 [2020-10-22 02:11:07,909 INFO L226 Difference]: Without dead ends: 562 [2020-10-22 02:11:07,910 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-22 02:11:07,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-10-22 02:11:08,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-10-22 02:11:08,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-22 02:11:08,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-10-22 02:11:08,033 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 5 [2020-10-22 02:11:08,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:11:08,034 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-10-22 02:11:08,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:11:08,034 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-10-22 02:11:08,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 02:11:08,036 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:08,036 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:11:08,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 02:11:08,036 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:08,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:08,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1612320360, now seen corresponding path program 1 times [2020-10-22 02:11:08,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:08,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834735601] [2020-10-22 02:11:08,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:11:08,187 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-22 02:11:08,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834735601] [2020-10-22 02:11:08,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:11:08,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:11:08,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [244538361] [2020-10-22 02:11:08,189 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:11:08,190 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:11:08,192 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 02:11:08,192 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:11:08,193 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:11:08,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:11:08,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:11:08,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:11:08,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:11:08,196 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 3 states. [2020-10-22 02:11:08,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:11:08,210 INFO L93 Difference]: Finished difference Result 537 states and 1635 transitions. [2020-10-22 02:11:08,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:11:08,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-22 02:11:08,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:11:08,217 INFO L225 Difference]: With dead ends: 537 [2020-10-22 02:11:08,217 INFO L226 Difference]: Without dead ends: 537 [2020-10-22 02:11:08,218 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-22 02:11:08,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-10-22 02:11:08,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2020-10-22 02:11:08,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2020-10-22 02:11:08,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1635 transitions. [2020-10-22 02:11:08,243 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 1635 transitions. Word has length 9 [2020-10-22 02:11:08,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:11:08,245 INFO L481 AbstractCegarLoop]: Abstraction has 537 states and 1635 transitions. [2020-10-22 02:11:08,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:11:08,246 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1635 transitions. [2020-10-22 02:11:08,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 02:11:08,247 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:08,248 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:11:08,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 02:11:08,250 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:08,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:08,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1557677095, now seen corresponding path program 1 times [2020-10-22 02:11:08,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:08,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969495491] [2020-10-22 02:11:08,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:11:08,323 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-22 02:11:08,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969495491] [2020-10-22 02:11:08,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:11:08,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:11:08,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [507453354] [2020-10-22 02:11:08,325 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:11:08,327 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:11:08,330 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-10-22 02:11:08,330 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:11:08,440 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:11:08,440 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:11:08,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:11:08,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:11:08,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:11:08,441 INFO L87 Difference]: Start difference. First operand 537 states and 1635 transitions. Second operand 3 states. [2020-10-22 02:11:08,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:11:08,454 INFO L93 Difference]: Finished difference Result 517 states and 1564 transitions. [2020-10-22 02:11:08,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:11:08,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-22 02:11:08,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:11:08,460 INFO L225 Difference]: With dead ends: 517 [2020-10-22 02:11:08,460 INFO L226 Difference]: Without dead ends: 517 [2020-10-22 02:11:08,461 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-22 02:11:08,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2020-10-22 02:11:08,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2020-10-22 02:11:08,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2020-10-22 02:11:08,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1564 transitions. [2020-10-22 02:11:08,479 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1564 transitions. Word has length 10 [2020-10-22 02:11:08,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:11:08,479 INFO L481 AbstractCegarLoop]: Abstraction has 517 states and 1564 transitions. [2020-10-22 02:11:08,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:11:08,480 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1564 transitions. [2020-10-22 02:11:08,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 02:11:08,482 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:08,482 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:11:08,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 02:11:08,482 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:08,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:08,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1030075138, now seen corresponding path program 1 times [2020-10-22 02:11:08,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:08,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660889008] [2020-10-22 02:11:08,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:11:08,552 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-22 02:11:08,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660889008] [2020-10-22 02:11:08,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:11:08,553 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:11:08,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [86296987] [2020-10-22 02:11:08,554 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:11:08,555 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:11:08,559 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 35 transitions. [2020-10-22 02:11:08,560 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:11:08,751 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:11:08,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:11:08,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:11:08,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:11:08,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:11:08,753 INFO L87 Difference]: Start difference. First operand 517 states and 1564 transitions. Second operand 3 states. [2020-10-22 02:11:08,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:11:08,773 INFO L93 Difference]: Finished difference Result 509 states and 1534 transitions. [2020-10-22 02:11:08,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:11:08,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-22 02:11:08,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:11:08,778 INFO L225 Difference]: With dead ends: 509 [2020-10-22 02:11:08,778 INFO L226 Difference]: Without dead ends: 509 [2020-10-22 02:11:08,778 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-22 02:11:08,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2020-10-22 02:11:08,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2020-10-22 02:11:08,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2020-10-22 02:11:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 1534 transitions. [2020-10-22 02:11:08,795 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 1534 transitions. Word has length 11 [2020-10-22 02:11:08,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:11:08,795 INFO L481 AbstractCegarLoop]: Abstraction has 509 states and 1534 transitions. [2020-10-22 02:11:08,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:11:08,796 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 1534 transitions. [2020-10-22 02:11:08,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 02:11:08,797 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:08,797 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:11:08,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 02:11:08,798 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:08,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:08,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1867591583, now seen corresponding path program 1 times [2020-10-22 02:11:08,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:08,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043427229] [2020-10-22 02:11:08,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:11:08,868 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-22 02:11:08,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043427229] [2020-10-22 02:11:08,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:11:08,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:11:08,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [949212701] [2020-10-22 02:11:08,869 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:11:08,871 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:11:08,874 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 24 transitions. [2020-10-22 02:11:08,874 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:11:08,937 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:09,060 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:11:09,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:11:09,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:11:09,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:11:09,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:11:09,061 INFO L87 Difference]: Start difference. First operand 509 states and 1534 transitions. Second operand 4 states. [2020-10-22 02:11:09,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:11:09,158 INFO L93 Difference]: Finished difference Result 497 states and 1493 transitions. [2020-10-22 02:11:09,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:11:09,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-22 02:11:09,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:11:09,166 INFO L225 Difference]: With dead ends: 497 [2020-10-22 02:11:09,167 INFO L226 Difference]: Without dead ends: 497 [2020-10-22 02:11:09,167 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-22 02:11:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2020-10-22 02:11:09,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2020-10-22 02:11:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2020-10-22 02:11:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 1493 transitions. [2020-10-22 02:11:09,183 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 1493 transitions. Word has length 12 [2020-10-22 02:11:09,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:11:09,184 INFO L481 AbstractCegarLoop]: Abstraction has 497 states and 1493 transitions. [2020-10-22 02:11:09,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:11:09,184 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 1493 transitions. [2020-10-22 02:11:09,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 02:11:09,186 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:09,186 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:11:09,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 02:11:09,186 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:09,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:09,187 INFO L82 PathProgramCache]: Analyzing trace with hash 197916404, now seen corresponding path program 1 times [2020-10-22 02:11:09,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:09,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934641645] [2020-10-22 02:11:09,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:11:09,298 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-22 02:11:09,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934641645] [2020-10-22 02:11:09,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:11:09,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:11:09,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1065244693] [2020-10-22 02:11:09,302 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:11:09,304 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:11:09,311 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 47 transitions. [2020-10-22 02:11:09,312 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:11:09,500 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:11:09,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:11:09,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:11:09,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:11:09,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:11:09,501 INFO L87 Difference]: Start difference. First operand 497 states and 1493 transitions. Second operand 4 states. [2020-10-22 02:11:09,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:11:09,555 INFO L93 Difference]: Finished difference Result 968 states and 2779 transitions. [2020-10-22 02:11:09,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 02:11:09,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-22 02:11:09,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:11:09,563 INFO L225 Difference]: With dead ends: 968 [2020-10-22 02:11:09,563 INFO L226 Difference]: Without dead ends: 521 [2020-10-22 02:11:09,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-22 02:11:09,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-10-22 02:11:09,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 485. [2020-10-22 02:11:09,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2020-10-22 02:11:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1383 transitions. [2020-10-22 02:11:09,580 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 1383 transitions. Word has length 13 [2020-10-22 02:11:09,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:11:09,580 INFO L481 AbstractCegarLoop]: Abstraction has 485 states and 1383 transitions. [2020-10-22 02:11:09,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:11:09,581 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 1383 transitions. [2020-10-22 02:11:09,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 02:11:09,581 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:09,582 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:11:09,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 02:11:09,582 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:09,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:09,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1759211781, now seen corresponding path program 1 times [2020-10-22 02:11:09,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:09,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452523137] [2020-10-22 02:11:09,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:11:09,662 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-22 02:11:09,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452523137] [2020-10-22 02:11:09,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:11:09,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:11:09,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [860548157] [2020-10-22 02:11:09,664 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:11:09,667 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:11:09,676 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 46 transitions. [2020-10-22 02:11:09,676 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:11:09,920 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:11:09,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:11:09,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:11:09,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:11:09,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:11:09,921 INFO L87 Difference]: Start difference. First operand 485 states and 1383 transitions. Second operand 4 states. [2020-10-22 02:11:09,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:11:09,950 INFO L93 Difference]: Finished difference Result 653 states and 1852 transitions. [2020-10-22 02:11:09,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:11:09,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-22 02:11:09,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:11:09,954 INFO L225 Difference]: With dead ends: 653 [2020-10-22 02:11:09,954 INFO L226 Difference]: Without dead ends: 353 [2020-10-22 02:11:09,954 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-22 02:11:09,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2020-10-22 02:11:09,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2020-10-22 02:11:09,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-10-22 02:11:09,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 971 transitions. [2020-10-22 02:11:09,964 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 971 transitions. Word has length 13 [2020-10-22 02:11:09,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:11:09,965 INFO L481 AbstractCegarLoop]: Abstraction has 353 states and 971 transitions. [2020-10-22 02:11:09,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:11:09,965 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 971 transitions. [2020-10-22 02:11:09,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 02:11:09,966 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:09,966 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:11:09,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 02:11:09,966 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:09,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:09,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1840407851, now seen corresponding path program 1 times [2020-10-22 02:11:09,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:09,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637153638] [2020-10-22 02:11:09,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:11:10,053 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-22 02:11:10,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637153638] [2020-10-22 02:11:10,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:11:10,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:11:10,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [737338240] [2020-10-22 02:11:10,054 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:11:10,056 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:11:10,061 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 40 transitions. [2020-10-22 02:11:10,062 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:11:10,143 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-22 02:11:10,143 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:10,144 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:11:10,144 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:10,146 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:10,152 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:10,155 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:11:10,168 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:11:10,171 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:10,187 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:10,187 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:10,198 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:11:10,493 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:11:10,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 02:11:10,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:11:10,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 02:11:10,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:11:10,495 INFO L87 Difference]: Start difference. First operand 353 states and 971 transitions. Second operand 5 states. [2020-10-22 02:11:10,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:11:10,602 INFO L93 Difference]: Finished difference Result 352 states and 967 transitions. [2020-10-22 02:11:10,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:11:10,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-22 02:11:10,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:11:10,606 INFO L225 Difference]: With dead ends: 352 [2020-10-22 02:11:10,606 INFO L226 Difference]: Without dead ends: 352 [2020-10-22 02:11:10,606 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:11:10,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2020-10-22 02:11:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2020-10-22 02:11:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-10-22 02:11:10,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 967 transitions. [2020-10-22 02:11:10,616 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 967 transitions. Word has length 14 [2020-10-22 02:11:10,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:11:10,617 INFO L481 AbstractCegarLoop]: Abstraction has 352 states and 967 transitions. [2020-10-22 02:11:10,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 02:11:10,617 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 967 transitions. [2020-10-22 02:11:10,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 02:11:10,618 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:10,618 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:11:10,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 02:11:10,618 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:10,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:10,619 INFO L82 PathProgramCache]: Analyzing trace with hash 950022406, now seen corresponding path program 1 times [2020-10-22 02:11:10,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:10,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89245550] [2020-10-22 02:11:10,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:11:10,706 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-22 02:11:10,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89245550] [2020-10-22 02:11:10,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:11:10,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:11:10,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [894159765] [2020-10-22 02:11:10,707 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:11:10,709 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:11:10,716 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 60 transitions. [2020-10-22 02:11:10,716 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:11:10,773 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:10,854 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:11,099 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:11,166 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [14141#(= (mod ~main$tmp_guard0~0 256) 0), 14142#(not (= 3 ~__unbuffered_cnt~0))] [2020-10-22 02:11:11,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:11:11,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:11:11,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:11:11,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:11:11,167 INFO L87 Difference]: Start difference. First operand 352 states and 967 transitions. Second operand 6 states. [2020-10-22 02:11:11,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:11:11,216 INFO L93 Difference]: Finished difference Result 262 states and 639 transitions. [2020-10-22 02:11:11,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 02:11:11,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-22 02:11:11,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:11:11,219 INFO L225 Difference]: With dead ends: 262 [2020-10-22 02:11:11,219 INFO L226 Difference]: Without dead ends: 177 [2020-10-22 02:11:11,219 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:11:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-10-22 02:11:11,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2020-10-22 02:11:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-10-22 02:11:11,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 383 transitions. [2020-10-22 02:11:11,225 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 383 transitions. Word has length 15 [2020-10-22 02:11:11,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:11:11,226 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 383 transitions. [2020-10-22 02:11:11,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:11:11,226 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 383 transitions. [2020-10-22 02:11:11,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-22 02:11:11,227 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:11,227 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:11:11,227 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 02:11:11,227 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:11,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:11,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1023864462, now seen corresponding path program 1 times [2020-10-22 02:11:11,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:11,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801947926] [2020-10-22 02:11:11,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:11:11,428 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-22 02:11:11,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801947926] [2020-10-22 02:11:11,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:11:11,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 02:11:11,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2090582813] [2020-10-22 02:11:11,430 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:11:11,433 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:11:11,446 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 59 transitions. [2020-10-22 02:11:11,446 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:11:11,475 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:11,933 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [14769#(= (mod ~main$tmp_guard0~0 256) 0), 14770#(not (= 3 ~__unbuffered_cnt~0)), 14771#(not (= ~__unbuffered_cnt~0 2)), 14772#(not (= ~__unbuffered_cnt~0 1)), 14773#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 02:11:11,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-22 02:11:11,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:11:11,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-22 02:11:11,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-22 02:11:11,934 INFO L87 Difference]: Start difference. First operand 177 states and 383 transitions. Second operand 11 states. [2020-10-22 02:11:12,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:11:12,028 INFO L93 Difference]: Finished difference Result 161 states and 349 transitions. [2020-10-22 02:11:12,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:11:12,031 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-10-22 02:11:12,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:11:12,032 INFO L225 Difference]: With dead ends: 161 [2020-10-22 02:11:12,033 INFO L226 Difference]: Without dead ends: 150 [2020-10-22 02:11:12,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2020-10-22 02:11:12,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-10-22 02:11:12,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2020-10-22 02:11:12,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-10-22 02:11:12,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 329 transitions. [2020-10-22 02:11:12,038 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 329 transitions. Word has length 18 [2020-10-22 02:11:12,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:11:12,038 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 329 transitions. [2020-10-22 02:11:12,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-22 02:11:12,038 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 329 transitions. [2020-10-22 02:11:12,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 02:11:12,039 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:12,040 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:11:12,040 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 02:11:12,040 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:12,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:12,040 INFO L82 PathProgramCache]: Analyzing trace with hash -2015020648, now seen corresponding path program 1 times [2020-10-22 02:11:12,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:12,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481734172] [2020-10-22 02:11:12,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:11:12,253 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-22 02:11:12,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481734172] [2020-10-22 02:11:12,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:11:12,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 02:11:12,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2139120663] [2020-10-22 02:11:12,254 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:11:12,260 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:11:12,275 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 66 transitions. [2020-10-22 02:11:12,276 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:11:12,418 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 [2020-10-22 02:11:12,428 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-10-22 02:11:12,428 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:12,429 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-22 02:11:12,429 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:12,432 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:11:12,432 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:12,437 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:11:12,437 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:12,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:12,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:12,447 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:12,455 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:12,463 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:12,466 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:11:12,467 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:11:12,482 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:11:12,487 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:12,489 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:12,490 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:12,495 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:11:12,504 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:11:12,505 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:12,509 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:12,520 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:11:12,523 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:12,525 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:12,526 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:12,531 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:11:12,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:12,544 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:12,545 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:12,549 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:12,615 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:12,630 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:12,631 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:12,676 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:12,693 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:11:12,693 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:12,699 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:11:12,750 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:12,768 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:12,772 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:12,775 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:12,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:12,784 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:12,787 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:12,788 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 3 conjuncts [2020-10-22 02:11:12,788 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:12,792 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:12,799 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:11:12,803 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:12,806 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:11:12,808 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:11:12,814 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:12,851 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:11:12,863 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:11:12,878 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:11:12,954 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:11:13,541 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 [2020-10-22 02:11:13,550 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-10-22 02:11:13,550 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:13,552 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-22 02:11:13,552 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:13,555 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:11:13,556 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:13,558 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:13,559 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:13,567 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:13,574 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:11:13,575 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:13,576 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:13,578 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:13,578 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:13,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:13,586 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:13,587 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:11:13,588 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:11:13,589 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:13,600 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:13,605 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:11:13,610 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:11:13,611 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:13,623 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:11:13,633 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:13,634 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:11:13,643 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:13,645 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:13,651 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:13,652 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:11:13,654 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:13,655 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:11:13,661 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:11:13,668 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:11:13,671 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:13,678 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:11:13,699 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:11:13,702 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:13,715 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:13,717 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:13,759 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:11:13,774 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-22 02:11:13,803 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:13,886 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:11:13,927 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:11:13,950 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:14,034 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:11:14,127 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:11:14,589 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 15 [2020-10-22 02:11:14,751 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:11:14,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 02:11:14,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:11:14,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 02:11:14,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:11:14,753 INFO L87 Difference]: Start difference. First operand 150 states and 329 transitions. Second operand 7 states. [2020-10-22 02:11:14,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:11:14,843 INFO L93 Difference]: Finished difference Result 216 states and 467 transitions. [2020-10-22 02:11:14,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:11:14,843 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-22 02:11:14,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:11:14,845 INFO L225 Difference]: With dead ends: 216 [2020-10-22 02:11:14,845 INFO L226 Difference]: Without dead ends: 194 [2020-10-22 02:11:14,846 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:11:14,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-10-22 02:11:14,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 142. [2020-10-22 02:11:14,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-10-22 02:11:14,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 305 transitions. [2020-10-22 02:11:14,850 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 305 transitions. Word has length 21 [2020-10-22 02:11:14,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:11:14,851 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 305 transitions. [2020-10-22 02:11:14,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 02:11:14,851 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 305 transitions. [2020-10-22 02:11:14,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 02:11:14,852 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:14,852 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:11:14,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 02:11:14,852 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:14,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:14,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1226256408, now seen corresponding path program 2 times [2020-10-22 02:11:14,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:14,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104109141] [2020-10-22 02:11:14,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:11:15,036 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-22 02:11:15,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104109141] [2020-10-22 02:11:15,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:11:15,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 02:11:15,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1592025839] [2020-10-22 02:11:15,037 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:11:15,041 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:11:15,054 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 57 transitions. [2020-10-22 02:11:15,054 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:11:15,308 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-10-22 02:11:15,309 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:15,309 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-10-22 02:11:15,309 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:15,311 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:11:15,311 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:15,313 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:11:15,313 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:15,314 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:15,315 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:15,320 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:15,331 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:15,332 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:15,334 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:11:15,344 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:11:15,344 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:11:15,345 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:15,349 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:15,385 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:15,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:11:15,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:15,470 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:11:15,508 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:11:15,546 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:15,577 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:15,621 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:15,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:11:15,640 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:15,664 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:11:15,713 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:11:15,752 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:15,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:15,839 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:15,840 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:15,847 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:11:15,848 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:11:15,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:15,856 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:11:15,863 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:11:15,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:15,874 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:11:15,886 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:15,887 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:15,891 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:15,895 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:15,899 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:15,900 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:15,907 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:15,910 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:11:15,917 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:15,918 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:15,920 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:15,922 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:11:15,923 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:11:15,927 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:11:15,929 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:11:15,941 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:11:15,946 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:11:15,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:11:15,951 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:15,952 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:11:15,953 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:11:15,963 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:11:15,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:15,971 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:11:15,972 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:11:15,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:11:15,980 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:11:15,981 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:11:16,688 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:11:16,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 02:11:16,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:11:16,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 02:11:16,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:11:16,689 INFO L87 Difference]: Start difference. First operand 142 states and 305 transitions. Second operand 8 states. [2020-10-22 02:11:16,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:11:16,839 INFO L93 Difference]: Finished difference Result 188 states and 397 transitions. [2020-10-22 02:11:16,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:11:16,840 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-10-22 02:11:16,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:11:16,841 INFO L225 Difference]: With dead ends: 188 [2020-10-22 02:11:16,841 INFO L226 Difference]: Without dead ends: 124 [2020-10-22 02:11:16,842 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-22 02:11:16,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-10-22 02:11:16,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2020-10-22 02:11:16,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-10-22 02:11:16,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 257 transitions. [2020-10-22 02:11:16,846 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 257 transitions. Word has length 21 [2020-10-22 02:11:16,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:11:16,846 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 257 transitions. [2020-10-22 02:11:16,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 02:11:16,846 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 257 transitions. [2020-10-22 02:11:16,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 02:11:16,847 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:16,847 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:11:16,847 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 02:11:16,848 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:16,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:16,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1452915720, now seen corresponding path program 3 times [2020-10-22 02:11:16,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:16,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839874966] [2020-10-22 02:11:16,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:11:16,912 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:11:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:11:16,978 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:11:17,028 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 02:11:17,029 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 02:11:17,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-22 02:11:17,031 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 02:11:17,048 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1057] [1057] L826-->L834: Formula: (let ((.cse7 (= (mod ~x$r_buff1_thd0~0_In15767489 256) 0)) (.cse6 (= 0 (mod ~x$w_buff1_used~0_In15767489 256))) (.cse8 (= (mod ~x$r_buff0_thd0~0_In15767489 256) 0)) (.cse9 (= (mod ~x$w_buff0_used~0_In15767489 256) 0))) (let ((.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse0 (or .cse8 .cse9)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse3 (or .cse6 .cse7))) (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond_Out15767489| ULTIMATE.start_assume_abort_if_not_~cond_Out15767489) (or (and (= ~x$w_buff0_used~0_Out15767489 ~x$w_buff0_used~0_In15767489) .cse0) (and .cse1 (= ~x$w_buff0_used~0_Out15767489 0) .cse2)) (= ~x$r_buff0_thd0~0_In15767489 ~x$r_buff0_thd0~0_Out15767489) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_Out15767489| (mod ~main$tmp_guard0~0_In15767489 256)) (= ~x$r_buff1_thd0~0_In15767489 ~x$r_buff1_thd0~0_Out15767489) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out15767489 0)) (or (and (= ~x$w_buff1_used~0_In15767489 ~x$w_buff1_used~0_Out15767489) .cse3) (and (= ~x$w_buff1_used~0_Out15767489 0) .cse4 .cse5)) (or (and .cse1 (= ~x~0_Out15767489 ~x$w_buff0~0_In15767489) .cse2) (and .cse0 (or (and (= ~x~0_Out15767489 ~x$w_buff1~0_In15767489) .cse4 .cse5) (and (= ~x~0_In15767489 ~x~0_Out15767489) .cse3))))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In15767489, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In15767489, ~x$w_buff1~0=~x$w_buff1~0_In15767489, ~x$w_buff1_used~0=~x$w_buff1_used~0_In15767489, ~main$tmp_guard0~0=~main$tmp_guard0~0_In15767489, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In15767489, ~x~0=~x~0_In15767489, ~x$w_buff0_used~0=~x$w_buff0_used~0_In15767489} OutVars{~x$w_buff0~0=~x$w_buff0~0_In15767489, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out15767489, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out15767489|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out15767489|, ~x$w_buff1~0=~x$w_buff1~0_In15767489, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out15767489, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out15767489|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out15767489|, ~main$tmp_guard0~0=~main$tmp_guard0~0_In15767489, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out15767489|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out15767489, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out15767489, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_Out15767489|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out15767489|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out15767489, ~x~0=~x~0_Out15767489} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite31, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ~x~0] because there is no mapped edge [2020-10-22 02:11:17,061 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-22 02:11:17,061 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [760] [2020-10-22 02:11:17,063 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-22 02:11:17,063 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,064 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-22 02:11:17,064 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,064 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-22 02:11:17,064 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,064 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-22 02:11:17,065 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,065 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-22 02:11:17,065 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,065 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-22 02:11:17,066 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,066 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-22 02:11:17,067 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,067 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-22 02:11:17,067 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,067 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-22 02:11:17,067 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,067 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-22 02:11:17,067 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,067 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-22 02:11:17,068 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,068 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-22 02:11:17,068 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,068 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-22 02:11:17,069 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,069 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-22 02:11:17,069 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,069 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-22 02:11:17,069 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,069 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-22 02:11:17,070 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,070 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-22 02:11:17,070 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,070 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-22 02:11:17,071 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,071 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-22 02:11:17,071 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,071 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-22 02:11:17,071 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,071 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-22 02:11:17,072 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,072 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-22 02:11:17,072 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,072 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-22 02:11:17,072 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,072 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-22 02:11:17,073 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,073 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-22 02:11:17,073 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,073 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-22 02:11:17,073 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,073 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-22 02:11:17,074 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,074 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-22 02:11:17,074 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,074 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-22 02:11:17,074 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,074 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-22 02:11:17,075 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:17,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 02:11:17 BasicIcfg [2020-10-22 02:11:17,137 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 02:11:17,138 INFO L168 Benchmark]: Toolchain (without parser) took 20541.63 ms. Allocated memory was 137.4 MB in the beginning and 445.6 MB in the end (delta: 308.3 MB). Free memory was 98.4 MB in the beginning and 135.2 MB in the end (delta: -36.8 MB). Peak memory consumption was 271.5 MB. Max. memory is 7.1 GB. [2020-10-22 02:11:17,139 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 137.4 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-22 02:11:17,140 INFO L168 Benchmark]: CACSL2BoogieTranslator took 844.84 ms. Allocated memory was 137.4 MB in the beginning and 199.8 MB in the end (delta: 62.4 MB). Free memory was 97.6 MB in the beginning and 149.5 MB in the end (delta: -51.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. [2020-10-22 02:11:17,140 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.22 ms. Allocated memory is still 199.8 MB. Free memory was 149.5 MB in the beginning and 146.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-22 02:11:17,141 INFO L168 Benchmark]: Boogie Preprocessor took 39.74 ms. Allocated memory is still 199.8 MB. Free memory was 146.7 MB in the beginning and 143.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-22 02:11:17,142 INFO L168 Benchmark]: RCFGBuilder took 2071.08 ms. Allocated memory was 199.8 MB in the beginning and 254.3 MB in the end (delta: 54.5 MB). Free memory was 143.9 MB in the beginning and 168.1 MB in the end (delta: -24.3 MB). Peak memory consumption was 100.9 MB. Max. memory is 7.1 GB. [2020-10-22 02:11:17,143 INFO L168 Benchmark]: TraceAbstraction took 17506.54 ms. Allocated memory was 254.3 MB in the beginning and 445.6 MB in the end (delta: 191.4 MB). Free memory was 168.1 MB in the beginning and 135.2 MB in the end (delta: 32.9 MB). Peak memory consumption was 224.3 MB. Max. memory is 7.1 GB. [2020-10-22 02:11:17,152 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 137.4 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 844.84 ms. Allocated memory was 137.4 MB in the beginning and 199.8 MB in the end (delta: 62.4 MB). Free memory was 97.6 MB in the beginning and 149.5 MB in the end (delta: -51.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.22 ms. Allocated memory is still 199.8 MB. Free memory was 149.5 MB in the beginning and 146.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.74 ms. Allocated memory is still 199.8 MB. Free memory was 146.7 MB in the beginning and 143.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2071.08 ms. Allocated memory was 199.8 MB in the beginning and 254.3 MB in the end (delta: 54.5 MB). Free memory was 143.9 MB in the beginning and 168.1 MB in the end (delta: -24.3 MB). Peak memory consumption was 100.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17506.54 ms. Allocated memory was 254.3 MB in the beginning and 445.6 MB in the end (delta: 191.4 MB). Free memory was 168.1 MB in the beginning and 135.2 MB in the end (delta: 32.9 MB). Peak memory consumption was 224.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 978 VarBasedMoverChecksPositive, 40 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 65 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.6s, 108 PlacesBefore, 36 PlacesAfterwards, 101 TransitionsBefore, 26 TransitionsAfterwards, 1862 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 89 TotalNumberOfCompositions, 5081 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1816; [L819] FCALL, FORK 0 pthread_create(&t1816, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L820] 0 pthread_t t1817; [L821] FCALL, FORK 0 pthread_create(&t1817, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L822] 0 pthread_t t1818; [L823] FCALL, FORK 0 pthread_create(&t1818, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L793] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L741] 1 __unbuffered_p0_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L744] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L776] 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) [L776] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L776] 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) [L776] 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) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 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 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 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 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L747] 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) [L747] 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) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 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 [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 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 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 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) [L840] 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) [L841] 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)) [L841] 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)) [L842] 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)) [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L842] 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)) [L842] 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)) [L843] 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)) [L843] 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) [L843] 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)) [L843] 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)) [L844] 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)) [L844] 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)) [L845] 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)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L845] 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)) [L845] 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)) [L846] 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)) [L846] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] 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)) [L846] 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)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe001_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.2s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.6s, HoareTripleCheckerStatistics: 250 SDtfs, 373 SDslu, 384 SDs, 0 SdLazy, 216 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 134 SyntacticMatches, 11 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=822occurred 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.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 90 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 18066 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...