/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/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe033_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 14:34:40,543 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 14:34:40,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 14:34:40,560 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 14:34:40,561 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 14:34:40,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 14:34:40,563 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 14:34:40,565 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 14:34:40,566 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 14:34:40,567 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 14:34:40,568 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 14:34:40,569 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 14:34:40,570 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 14:34:40,571 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 14:34:40,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 14:34:40,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 14:34:40,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 14:34:40,574 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 14:34:40,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 14:34:40,577 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 14:34:40,579 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 14:34:40,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 14:34:40,581 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 14:34:40,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 14:34:40,584 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 14:34:40,584 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 14:34:40,584 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 14:34:40,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 14:34:40,585 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 14:34:40,586 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 14:34:40,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 14:34:40,587 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 14:34:40,588 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 14:34:40,589 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 14:34:40,590 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 14:34:40,590 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 14:34:40,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 14:34:40,591 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 14:34:40,591 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 14:34:40,592 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 14:34:40,592 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 14:34:40,593 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-27 14:34:40,607 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 14:34:40,607 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 14:34:40,609 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 14:34:40,609 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 14:34:40,609 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 14:34:40,609 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 14:34:40,609 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 14:34:40,610 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 14:34:40,610 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 14:34:40,610 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 14:34:40,610 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 14:34:40,610 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 14:34:40,611 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 14:34:40,611 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 14:34:40,611 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 14:34:40,611 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 14:34:40,611 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 14:34:40,612 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 14:34:40,612 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 14:34:40,612 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 14:34:40,612 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 14:34:40,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 14:34:40,613 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 14:34:40,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 14:34:40,613 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 14:34:40,613 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 14:34:40,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 14:34:40,614 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 14:34:40,614 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 14:34:40,614 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 14:34:40,887 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 14:34:40,899 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 14:34:40,903 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 14:34:40,904 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 14:34:40,905 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 14:34:40,906 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_pso.opt.i [2019-12-27 14:34:40,968 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/189cdb4eb/4af0d8dbf14249dab81bb7b4f7ca843a/FLAG8b0b4551a [2019-12-27 14:34:41,495 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 14:34:41,496 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_pso.opt.i [2019-12-27 14:34:41,511 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/189cdb4eb/4af0d8dbf14249dab81bb7b4f7ca843a/FLAG8b0b4551a [2019-12-27 14:34:41,841 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/189cdb4eb/4af0d8dbf14249dab81bb7b4f7ca843a [2019-12-27 14:34:41,853 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 14:34:41,855 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 14:34:41,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 14:34:41,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 14:34:41,864 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 14:34:41,866 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:34:41" (1/1) ... [2019-12-27 14:34:41,869 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e400b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:34:41, skipping insertion in model container [2019-12-27 14:34:41,869 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:34:41" (1/1) ... [2019-12-27 14:34:41,878 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 14:34:41,936 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 14:34:42,431 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 14:34:42,443 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 14:34:42,527 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 14:34:42,604 INFO L208 MainTranslator]: Completed translation [2019-12-27 14:34:42,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:34:42 WrapperNode [2019-12-27 14:34:42,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 14:34:42,606 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 14:34:42,606 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 14:34:42,606 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 14:34:42,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:34:42" (1/1) ... [2019-12-27 14:34:42,635 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:34:42" (1/1) ... [2019-12-27 14:34:42,670 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 14:34:42,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 14:34:42,671 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 14:34:42,671 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 14:34:42,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:34:42" (1/1) ... [2019-12-27 14:34:42,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:34:42" (1/1) ... [2019-12-27 14:34:42,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:34:42" (1/1) ... [2019-12-27 14:34:42,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:34:42" (1/1) ... [2019-12-27 14:34:42,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:34:42" (1/1) ... [2019-12-27 14:34:42,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:34:42" (1/1) ... [2019-12-27 14:34:42,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:34:42" (1/1) ... [2019-12-27 14:34:42,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 14:34:42,714 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 14:34:42,714 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 14:34:42,714 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 14:34:42,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:34:42" (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 [2019-12-27 14:34:42,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 14:34:42,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 14:34:42,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 14:34:42,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 14:34:42,786 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 14:34:42,787 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 14:34:42,787 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 14:34:42,787 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 14:34:42,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 14:34:42,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 14:34:42,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 14:34:42,790 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 14:34:43,504 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 14:34:43,504 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 14:34:43,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:34:43 BoogieIcfgContainer [2019-12-27 14:34:43,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 14:34:43,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 14:34:43,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 14:34:43,511 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 14:34:43,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:34:41" (1/3) ... [2019-12-27 14:34:43,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3cd8d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:34:43, skipping insertion in model container [2019-12-27 14:34:43,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:34:42" (2/3) ... [2019-12-27 14:34:43,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3cd8d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:34:43, skipping insertion in model container [2019-12-27 14:34:43,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:34:43" (3/3) ... [2019-12-27 14:34:43,515 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_pso.opt.i [2019-12-27 14:34:43,525 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 14:34:43,525 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 14:34:43,532 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 14:34:43,533 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 14:34:43,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,575 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,576 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,608 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,608 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,608 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,609 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,609 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,620 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,620 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,621 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,626 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,627 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:34:43,647 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 14:34:43,667 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 14:34:43,667 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 14:34:43,667 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 14:34:43,667 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 14:34:43,668 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 14:34:43,668 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 14:34:43,668 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 14:34:43,668 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 14:34:43,683 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 134 places, 162 transitions [2019-12-27 14:34:45,285 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25974 states. [2019-12-27 14:34:45,287 INFO L276 IsEmpty]: Start isEmpty. Operand 25974 states. [2019-12-27 14:34:45,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 14:34:45,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:34:45,298 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:34:45,299 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:34:45,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:34:45,304 INFO L82 PathProgramCache]: Analyzing trace with hash 310103372, now seen corresponding path program 1 times [2019-12-27 14:34:45,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:34:45,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777878140] [2019-12-27 14:34:45,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:34:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:34:45,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:34:45,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777878140] [2019-12-27 14:34:45,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:34:45,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:34:45,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406794412] [2019-12-27 14:34:45,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:34:45,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:34:45,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:34:45,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:34:45,661 INFO L87 Difference]: Start difference. First operand 25974 states. Second operand 4 states. [2019-12-27 14:34:46,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:34:46,287 INFO L93 Difference]: Finished difference Result 26614 states and 102119 transitions. [2019-12-27 14:34:46,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 14:34:46,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-27 14:34:46,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:34:47,302 INFO L225 Difference]: With dead ends: 26614 [2019-12-27 14:34:47,302 INFO L226 Difference]: Without dead ends: 20358 [2019-12-27 14:34:47,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:34:47,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20358 states. [2019-12-27 14:34:48,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20358 to 20358. [2019-12-27 14:34:48,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20358 states. [2019-12-27 14:34:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20358 states to 20358 states and 78423 transitions. [2019-12-27 14:34:48,342 INFO L78 Accepts]: Start accepts. Automaton has 20358 states and 78423 transitions. Word has length 37 [2019-12-27 14:34:48,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:34:48,343 INFO L462 AbstractCegarLoop]: Abstraction has 20358 states and 78423 transitions. [2019-12-27 14:34:48,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:34:48,343 INFO L276 IsEmpty]: Start isEmpty. Operand 20358 states and 78423 transitions. [2019-12-27 14:34:48,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 14:34:48,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:34:48,353 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:34:48,354 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:34:48,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:34:48,354 INFO L82 PathProgramCache]: Analyzing trace with hash 2127220543, now seen corresponding path program 1 times [2019-12-27 14:34:48,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:34:48,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399052901] [2019-12-27 14:34:48,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:34:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:34:48,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:34:48,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399052901] [2019-12-27 14:34:48,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:34:48,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:34:48,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844967665] [2019-12-27 14:34:48,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:34:48,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:34:48,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:34:48,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:34:48,503 INFO L87 Difference]: Start difference. First operand 20358 states and 78423 transitions. Second operand 5 states. [2019-12-27 14:34:49,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:34:49,575 INFO L93 Difference]: Finished difference Result 31836 states and 116040 transitions. [2019-12-27 14:34:49,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:34:49,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-27 14:34:49,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:34:49,691 INFO L225 Difference]: With dead ends: 31836 [2019-12-27 14:34:49,691 INFO L226 Difference]: Without dead ends: 31284 [2019-12-27 14:34:49,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:34:49,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31284 states. [2019-12-27 14:34:51,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31284 to 29703. [2019-12-27 14:34:51,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29703 states. [2019-12-27 14:34:51,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29703 states to 29703 states and 109517 transitions. [2019-12-27 14:34:51,668 INFO L78 Accepts]: Start accepts. Automaton has 29703 states and 109517 transitions. Word has length 45 [2019-12-27 14:34:51,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:34:51,669 INFO L462 AbstractCegarLoop]: Abstraction has 29703 states and 109517 transitions. [2019-12-27 14:34:51,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:34:51,670 INFO L276 IsEmpty]: Start isEmpty. Operand 29703 states and 109517 transitions. [2019-12-27 14:34:51,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 14:34:51,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:34:51,678 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:34:51,679 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:34:51,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:34:51,679 INFO L82 PathProgramCache]: Analyzing trace with hash -370499147, now seen corresponding path program 1 times [2019-12-27 14:34:51,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:34:51,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715870629] [2019-12-27 14:34:51,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:34:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:34:51,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:34:51,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715870629] [2019-12-27 14:34:51,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:34:51,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:34:51,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888170358] [2019-12-27 14:34:51,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:34:51,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:34:51,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:34:51,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:34:51,831 INFO L87 Difference]: Start difference. First operand 29703 states and 109517 transitions. Second operand 5 states. [2019-12-27 14:34:52,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:34:52,655 INFO L93 Difference]: Finished difference Result 38694 states and 139689 transitions. [2019-12-27 14:34:52,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:34:52,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-27 14:34:52,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:34:52,788 INFO L225 Difference]: With dead ends: 38694 [2019-12-27 14:34:52,789 INFO L226 Difference]: Without dead ends: 38246 [2019-12-27 14:34:52,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:34:53,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38246 states. [2019-12-27 14:34:54,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38246 to 32949. [2019-12-27 14:34:54,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32949 states. [2019-12-27 14:34:54,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32949 states to 32949 states and 120526 transitions. [2019-12-27 14:34:54,990 INFO L78 Accepts]: Start accepts. Automaton has 32949 states and 120526 transitions. Word has length 46 [2019-12-27 14:34:54,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:34:54,990 INFO L462 AbstractCegarLoop]: Abstraction has 32949 states and 120526 transitions. [2019-12-27 14:34:54,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:34:54,991 INFO L276 IsEmpty]: Start isEmpty. Operand 32949 states and 120526 transitions. [2019-12-27 14:34:54,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 14:34:54,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:34:54,998 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:34:54,998 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:34:54,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:34:54,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1101725263, now seen corresponding path program 1 times [2019-12-27 14:34:54,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:34:54,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62697642] [2019-12-27 14:34:54,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:34:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:34:55,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:34:55,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62697642] [2019-12-27 14:34:55,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:34:55,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 14:34:55,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117888517] [2019-12-27 14:34:55,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 14:34:55,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:34:55,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 14:34:55,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:34:55,051 INFO L87 Difference]: Start difference. First operand 32949 states and 120526 transitions. Second operand 3 states. [2019-12-27 14:34:55,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:34:55,284 INFO L93 Difference]: Finished difference Result 42410 states and 152017 transitions. [2019-12-27 14:34:55,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 14:34:55,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-12-27 14:34:55,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:34:55,400 INFO L225 Difference]: With dead ends: 42410 [2019-12-27 14:34:55,400 INFO L226 Difference]: Without dead ends: 42410 [2019-12-27 14:34:55,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:34:55,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42410 states. [2019-12-27 14:34:56,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42410 to 37663. [2019-12-27 14:34:56,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37663 states. [2019-12-27 14:34:56,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37663 states to 37663 states and 136330 transitions. [2019-12-27 14:34:56,755 INFO L78 Accepts]: Start accepts. Automaton has 37663 states and 136330 transitions. Word has length 48 [2019-12-27 14:34:56,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:34:56,756 INFO L462 AbstractCegarLoop]: Abstraction has 37663 states and 136330 transitions. [2019-12-27 14:34:56,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 14:34:56,756 INFO L276 IsEmpty]: Start isEmpty. Operand 37663 states and 136330 transitions. [2019-12-27 14:34:56,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 14:34:56,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:34:56,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:34:56,773 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:34:56,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:34:56,775 INFO L82 PathProgramCache]: Analyzing trace with hash -929169210, now seen corresponding path program 1 times [2019-12-27 14:34:56,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:34:56,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884468290] [2019-12-27 14:34:56,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:34:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:34:56,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:34:56,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884468290] [2019-12-27 14:34:56,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:34:56,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:34:56,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177820517] [2019-12-27 14:34:56,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:34:56,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:34:56,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:34:56,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:34:56,901 INFO L87 Difference]: Start difference. First operand 37663 states and 136330 transitions. Second operand 6 states. [2019-12-27 14:34:58,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:34:58,705 INFO L93 Difference]: Finished difference Result 48754 states and 172979 transitions. [2019-12-27 14:34:58,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 14:34:58,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 14:34:58,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:34:58,849 INFO L225 Difference]: With dead ends: 48754 [2019-12-27 14:34:58,849 INFO L226 Difference]: Without dead ends: 48234 [2019-12-27 14:34:58,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-27 14:34:59,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48234 states. [2019-12-27 14:34:59,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48234 to 38227. [2019-12-27 14:34:59,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38227 states. [2019-12-27 14:34:59,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38227 states to 38227 states and 138493 transitions. [2019-12-27 14:34:59,948 INFO L78 Accepts]: Start accepts. Automaton has 38227 states and 138493 transitions. Word has length 52 [2019-12-27 14:34:59,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:34:59,948 INFO L462 AbstractCegarLoop]: Abstraction has 38227 states and 138493 transitions. [2019-12-27 14:34:59,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:34:59,948 INFO L276 IsEmpty]: Start isEmpty. Operand 38227 states and 138493 transitions. [2019-12-27 14:34:59,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 14:34:59,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:34:59,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:34:59,964 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:34:59,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:34:59,965 INFO L82 PathProgramCache]: Analyzing trace with hash 2144383564, now seen corresponding path program 1 times [2019-12-27 14:34:59,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:34:59,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790216635] [2019-12-27 14:34:59,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:34:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:35:00,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:35:00,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790216635] [2019-12-27 14:35:00,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:35:00,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:35:00,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923227043] [2019-12-27 14:35:00,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:35:00,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:35:00,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:35:00,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:35:00,117 INFO L87 Difference]: Start difference. First operand 38227 states and 138493 transitions. Second operand 6 states. [2019-12-27 14:35:00,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:35:00,968 INFO L93 Difference]: Finished difference Result 53003 states and 189569 transitions. [2019-12-27 14:35:00,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:35:00,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 14:35:00,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:35:01,085 INFO L225 Difference]: With dead ends: 53003 [2019-12-27 14:35:01,085 INFO L226 Difference]: Without dead ends: 52027 [2019-12-27 14:35:01,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:35:01,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52027 states. [2019-12-27 14:35:03,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52027 to 48780. [2019-12-27 14:35:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48780 states. [2019-12-27 14:35:03,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48780 states to 48780 states and 175224 transitions. [2019-12-27 14:35:03,711 INFO L78 Accepts]: Start accepts. Automaton has 48780 states and 175224 transitions. Word has length 52 [2019-12-27 14:35:03,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:35:03,711 INFO L462 AbstractCegarLoop]: Abstraction has 48780 states and 175224 transitions. [2019-12-27 14:35:03,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:35:03,712 INFO L276 IsEmpty]: Start isEmpty. Operand 48780 states and 175224 transitions. [2019-12-27 14:35:03,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 14:35:03,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:35:03,730 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:35:03,730 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:35:03,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:35:03,731 INFO L82 PathProgramCache]: Analyzing trace with hash 347432205, now seen corresponding path program 1 times [2019-12-27 14:35:03,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:35:03,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628352854] [2019-12-27 14:35:03,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:35:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:35:03,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:35:03,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628352854] [2019-12-27 14:35:03,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:35:03,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 14:35:03,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175410002] [2019-12-27 14:35:03,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 14:35:03,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:35:03,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 14:35:03,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:35:03,824 INFO L87 Difference]: Start difference. First operand 48780 states and 175224 transitions. Second operand 7 states. [2019-12-27 14:35:04,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:35:04,965 INFO L93 Difference]: Finished difference Result 70895 states and 244521 transitions. [2019-12-27 14:35:04,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 14:35:04,965 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-27 14:35:04,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:35:05,582 INFO L225 Difference]: With dead ends: 70895 [2019-12-27 14:35:05,582 INFO L226 Difference]: Without dead ends: 70895 [2019-12-27 14:35:05,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 14:35:05,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70895 states. [2019-12-27 14:35:06,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70895 to 57888. [2019-12-27 14:35:06,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57888 states. [2019-12-27 14:35:09,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57888 states to 57888 states and 203148 transitions. [2019-12-27 14:35:09,634 INFO L78 Accepts]: Start accepts. Automaton has 57888 states and 203148 transitions. Word has length 52 [2019-12-27 14:35:09,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:35:09,634 INFO L462 AbstractCegarLoop]: Abstraction has 57888 states and 203148 transitions. [2019-12-27 14:35:09,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 14:35:09,634 INFO L276 IsEmpty]: Start isEmpty. Operand 57888 states and 203148 transitions. [2019-12-27 14:35:09,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 14:35:09,648 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:35:09,649 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:35:09,649 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:35:09,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:35:09,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1234935886, now seen corresponding path program 1 times [2019-12-27 14:35:09,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:35:09,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562403547] [2019-12-27 14:35:09,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:35:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:35:09,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:35:09,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562403547] [2019-12-27 14:35:09,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:35:09,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:35:09,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767701438] [2019-12-27 14:35:09,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:35:09,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:35:09,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:35:09,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:35:09,731 INFO L87 Difference]: Start difference. First operand 57888 states and 203148 transitions. Second operand 4 states. [2019-12-27 14:35:09,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:35:09,805 INFO L93 Difference]: Finished difference Result 10858 states and 33393 transitions. [2019-12-27 14:35:09,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 14:35:09,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-27 14:35:09,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:35:09,829 INFO L225 Difference]: With dead ends: 10858 [2019-12-27 14:35:09,829 INFO L226 Difference]: Without dead ends: 9359 [2019-12-27 14:35:09,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:35:09,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9359 states. [2019-12-27 14:35:09,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9359 to 9311. [2019-12-27 14:35:09,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9311 states. [2019-12-27 14:35:10,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9311 states to 9311 states and 28343 transitions. [2019-12-27 14:35:10,026 INFO L78 Accepts]: Start accepts. Automaton has 9311 states and 28343 transitions. Word has length 52 [2019-12-27 14:35:10,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:35:10,026 INFO L462 AbstractCegarLoop]: Abstraction has 9311 states and 28343 transitions. [2019-12-27 14:35:10,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:35:10,027 INFO L276 IsEmpty]: Start isEmpty. Operand 9311 states and 28343 transitions. [2019-12-27 14:35:10,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 14:35:10,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:35:10,034 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:35:10,034 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:35:10,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:35:10,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1215430140, now seen corresponding path program 1 times [2019-12-27 14:35:10,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:35:10,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893470505] [2019-12-27 14:35:10,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:35:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:35:10,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:35:10,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893470505] [2019-12-27 14:35:10,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:35:10,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:35:10,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73024703] [2019-12-27 14:35:10,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:35:10,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:35:10,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:35:10,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:35:10,137 INFO L87 Difference]: Start difference. First operand 9311 states and 28343 transitions. Second operand 4 states. [2019-12-27 14:35:10,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:35:10,300 INFO L93 Difference]: Finished difference Result 10886 states and 33035 transitions. [2019-12-27 14:35:10,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 14:35:10,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-27 14:35:10,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:35:10,320 INFO L225 Difference]: With dead ends: 10886 [2019-12-27 14:35:10,321 INFO L226 Difference]: Without dead ends: 10886 [2019-12-27 14:35:10,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:35:10,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10886 states. [2019-12-27 14:35:10,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10886 to 9878. [2019-12-27 14:35:10,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9878 states. [2019-12-27 14:35:10,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9878 states to 9878 states and 30014 transitions. [2019-12-27 14:35:10,510 INFO L78 Accepts]: Start accepts. Automaton has 9878 states and 30014 transitions. Word has length 62 [2019-12-27 14:35:10,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:35:10,510 INFO L462 AbstractCegarLoop]: Abstraction has 9878 states and 30014 transitions. [2019-12-27 14:35:10,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:35:10,511 INFO L276 IsEmpty]: Start isEmpty. Operand 9878 states and 30014 transitions. [2019-12-27 14:35:10,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 14:35:10,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:35:10,516 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:35:10,517 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:35:10,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:35:10,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1336726821, now seen corresponding path program 1 times [2019-12-27 14:35:10,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:35:10,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45343815] [2019-12-27 14:35:10,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:35:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:35:10,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:35:10,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45343815] [2019-12-27 14:35:10,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:35:10,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:35:10,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297073459] [2019-12-27 14:35:10,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:35:10,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:35:10,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:35:10,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:35:10,621 INFO L87 Difference]: Start difference. First operand 9878 states and 30014 transitions. Second operand 6 states. [2019-12-27 14:35:11,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:35:11,141 INFO L93 Difference]: Finished difference Result 12784 states and 38224 transitions. [2019-12-27 14:35:11,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 14:35:11,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-27 14:35:11,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:35:11,160 INFO L225 Difference]: With dead ends: 12784 [2019-12-27 14:35:11,160 INFO L226 Difference]: Without dead ends: 12736 [2019-12-27 14:35:11,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-12-27 14:35:11,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12736 states. [2019-12-27 14:35:11,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12736 to 10617. [2019-12-27 14:35:11,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10617 states. [2019-12-27 14:35:11,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10617 states to 10617 states and 32067 transitions. [2019-12-27 14:35:11,312 INFO L78 Accepts]: Start accepts. Automaton has 10617 states and 32067 transitions. Word has length 62 [2019-12-27 14:35:11,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:35:11,312 INFO L462 AbstractCegarLoop]: Abstraction has 10617 states and 32067 transitions. [2019-12-27 14:35:11,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:35:11,313 INFO L276 IsEmpty]: Start isEmpty. Operand 10617 states and 32067 transitions. [2019-12-27 14:35:11,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 14:35:11,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:35:11,320 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:35:11,320 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:35:11,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:35:11,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1540685473, now seen corresponding path program 1 times [2019-12-27 14:35:11,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:35:11,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556631473] [2019-12-27 14:35:11,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:35:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:35:11,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:35:11,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556631473] [2019-12-27 14:35:11,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:35:11,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 14:35:11,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108306182] [2019-12-27 14:35:11,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 14:35:11,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:35:11,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 14:35:11,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:35:11,377 INFO L87 Difference]: Start difference. First operand 10617 states and 32067 transitions. Second operand 3 states. [2019-12-27 14:35:11,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:35:11,552 INFO L93 Difference]: Finished difference Result 11193 states and 33595 transitions. [2019-12-27 14:35:11,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 14:35:11,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 14:35:11,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:35:11,569 INFO L225 Difference]: With dead ends: 11193 [2019-12-27 14:35:11,569 INFO L226 Difference]: Without dead ends: 11193 [2019-12-27 14:35:11,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:35:11,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11193 states. [2019-12-27 14:35:11,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11193 to 10905. [2019-12-27 14:35:11,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10905 states. [2019-12-27 14:35:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10905 states to 10905 states and 32831 transitions. [2019-12-27 14:35:11,724 INFO L78 Accepts]: Start accepts. Automaton has 10905 states and 32831 transitions. Word has length 64 [2019-12-27 14:35:11,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:35:11,724 INFO L462 AbstractCegarLoop]: Abstraction has 10905 states and 32831 transitions. [2019-12-27 14:35:11,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 14:35:11,724 INFO L276 IsEmpty]: Start isEmpty. Operand 10905 states and 32831 transitions. [2019-12-27 14:35:11,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 14:35:11,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:35:11,732 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:35:11,732 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:35:11,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:35:11,732 INFO L82 PathProgramCache]: Analyzing trace with hash 536523870, now seen corresponding path program 1 times [2019-12-27 14:35:11,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:35:11,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132840694] [2019-12-27 14:35:11,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:35:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:35:11,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:35:11,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132840694] [2019-12-27 14:35:11,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:35:11,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:35:11,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720504482] [2019-12-27 14:35:11,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:35:11,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:35:11,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:35:11,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:35:11,790 INFO L87 Difference]: Start difference. First operand 10905 states and 32831 transitions. Second operand 4 states. [2019-12-27 14:35:12,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:35:12,201 INFO L93 Difference]: Finished difference Result 13607 states and 40433 transitions. [2019-12-27 14:35:12,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 14:35:12,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-27 14:35:12,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:35:12,219 INFO L225 Difference]: With dead ends: 13607 [2019-12-27 14:35:12,220 INFO L226 Difference]: Without dead ends: 13607 [2019-12-27 14:35:12,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:35:12,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13607 states. [2019-12-27 14:35:12,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13607 to 12461. [2019-12-27 14:35:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12461 states. [2019-12-27 14:35:12,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12461 states to 12461 states and 37122 transitions. [2019-12-27 14:35:12,380 INFO L78 Accepts]: Start accepts. Automaton has 12461 states and 37122 transitions. Word has length 64 [2019-12-27 14:35:12,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:35:12,380 INFO L462 AbstractCegarLoop]: Abstraction has 12461 states and 37122 transitions. [2019-12-27 14:35:12,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:35:12,380 INFO L276 IsEmpty]: Start isEmpty. Operand 12461 states and 37122 transitions. [2019-12-27 14:35:12,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 14:35:12,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:35:12,391 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:35:12,391 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:35:12,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:35:12,392 INFO L82 PathProgramCache]: Analyzing trace with hash 762121994, now seen corresponding path program 1 times [2019-12-27 14:35:12,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:35:12,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393288477] [2019-12-27 14:35:12,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:35:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:35:12,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:35:12,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393288477] [2019-12-27 14:35:12,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:35:12,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:35:12,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621239311] [2019-12-27 14:35:12,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:35:12,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:35:12,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:35:12,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:35:12,501 INFO L87 Difference]: Start difference. First operand 12461 states and 37122 transitions. Second operand 6 states. [2019-12-27 14:35:12,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:35:12,997 INFO L93 Difference]: Finished difference Result 13732 states and 40361 transitions. [2019-12-27 14:35:12,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:35:12,997 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 14:35:12,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:35:13,016 INFO L225 Difference]: With dead ends: 13732 [2019-12-27 14:35:13,016 INFO L226 Difference]: Without dead ends: 13732 [2019-12-27 14:35:13,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:35:13,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13732 states. [2019-12-27 14:35:13,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13732 to 13246. [2019-12-27 14:35:13,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13246 states. [2019-12-27 14:35:13,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13246 states to 13246 states and 39077 transitions. [2019-12-27 14:35:13,185 INFO L78 Accepts]: Start accepts. Automaton has 13246 states and 39077 transitions. Word has length 66 [2019-12-27 14:35:13,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:35:13,185 INFO L462 AbstractCegarLoop]: Abstraction has 13246 states and 39077 transitions. [2019-12-27 14:35:13,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:35:13,185 INFO L276 IsEmpty]: Start isEmpty. Operand 13246 states and 39077 transitions. [2019-12-27 14:35:13,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 14:35:13,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:35:13,197 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:35:13,197 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:35:13,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:35:13,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1315087349, now seen corresponding path program 1 times [2019-12-27 14:35:13,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:35:13,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390590928] [2019-12-27 14:35:13,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:35:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:35:13,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:35:13,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390590928] [2019-12-27 14:35:13,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:35:13,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:35:13,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254231587] [2019-12-27 14:35:13,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:35:13,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:35:13,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:35:13,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:35:13,297 INFO L87 Difference]: Start difference. First operand 13246 states and 39077 transitions. Second operand 6 states. [2019-12-27 14:35:13,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:35:13,726 INFO L93 Difference]: Finished difference Result 15569 states and 44587 transitions. [2019-12-27 14:35:13,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 14:35:13,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 14:35:13,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:35:13,752 INFO L225 Difference]: With dead ends: 15569 [2019-12-27 14:35:13,752 INFO L226 Difference]: Without dead ends: 15569 [2019-12-27 14:35:13,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 14:35:13,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15569 states. [2019-12-27 14:35:13,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15569 to 13820. [2019-12-27 14:35:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13820 states. [2019-12-27 14:35:13,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13820 states to 13820 states and 39927 transitions. [2019-12-27 14:35:13,940 INFO L78 Accepts]: Start accepts. Automaton has 13820 states and 39927 transitions. Word has length 66 [2019-12-27 14:35:13,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:35:13,940 INFO L462 AbstractCegarLoop]: Abstraction has 13820 states and 39927 transitions. [2019-12-27 14:35:13,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:35:13,940 INFO L276 IsEmpty]: Start isEmpty. Operand 13820 states and 39927 transitions. [2019-12-27 14:35:13,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 14:35:13,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:35:13,952 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:35:13,953 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:35:13,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:35:13,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1103736436, now seen corresponding path program 1 times [2019-12-27 14:35:13,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:35:13,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7445357] [2019-12-27 14:35:13,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:35:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:35:14,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:35:14,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7445357] [2019-12-27 14:35:14,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:35:14,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:35:14,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549713021] [2019-12-27 14:35:14,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:35:14,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:35:14,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:35:14,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:35:14,022 INFO L87 Difference]: Start difference. First operand 13820 states and 39927 transitions. Second operand 5 states. [2019-12-27 14:35:14,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:35:14,356 INFO L93 Difference]: Finished difference Result 17381 states and 50006 transitions. [2019-12-27 14:35:14,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 14:35:14,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 14:35:14,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:35:14,386 INFO L225 Difference]: With dead ends: 17381 [2019-12-27 14:35:14,387 INFO L226 Difference]: Without dead ends: 17381 [2019-12-27 14:35:14,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:35:14,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17381 states. [2019-12-27 14:35:14,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17381 to 14858. [2019-12-27 14:35:14,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14858 states. [2019-12-27 14:35:14,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14858 states to 14858 states and 42559 transitions. [2019-12-27 14:35:14,717 INFO L78 Accepts]: Start accepts. Automaton has 14858 states and 42559 transitions. Word has length 66 [2019-12-27 14:35:14,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:35:14,717 INFO L462 AbstractCegarLoop]: Abstraction has 14858 states and 42559 transitions. [2019-12-27 14:35:14,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:35:14,717 INFO L276 IsEmpty]: Start isEmpty. Operand 14858 states and 42559 transitions. [2019-12-27 14:35:14,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 14:35:14,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:35:14,727 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:35:14,727 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:35:14,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:35:14,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1614270613, now seen corresponding path program 1 times [2019-12-27 14:35:14,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:35:14,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787215774] [2019-12-27 14:35:14,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:35:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:35:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:35:14,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787215774] [2019-12-27 14:35:14,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:35:14,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:35:14,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423441452] [2019-12-27 14:35:14,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:35:14,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:35:14,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:35:14,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:35:14,800 INFO L87 Difference]: Start difference. First operand 14858 states and 42559 transitions. Second operand 5 states. [2019-12-27 14:35:15,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:35:15,220 INFO L93 Difference]: Finished difference Result 19763 states and 56506 transitions. [2019-12-27 14:35:15,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:35:15,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 14:35:15,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:35:15,247 INFO L225 Difference]: With dead ends: 19763 [2019-12-27 14:35:15,247 INFO L226 Difference]: Without dead ends: 19763 [2019-12-27 14:35:15,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:35:15,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19763 states. [2019-12-27 14:35:15,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19763 to 15763. [2019-12-27 14:35:15,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15763 states. [2019-12-27 14:35:15,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15763 states to 15763 states and 45145 transitions. [2019-12-27 14:35:15,460 INFO L78 Accepts]: Start accepts. Automaton has 15763 states and 45145 transitions. Word has length 66 [2019-12-27 14:35:15,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:35:15,460 INFO L462 AbstractCegarLoop]: Abstraction has 15763 states and 45145 transitions. [2019-12-27 14:35:15,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:35:15,461 INFO L276 IsEmpty]: Start isEmpty. Operand 15763 states and 45145 transitions. [2019-12-27 14:35:15,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 14:35:15,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:35:15,472 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:35:15,472 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:35:15,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:35:15,473 INFO L82 PathProgramCache]: Analyzing trace with hash 873242220, now seen corresponding path program 1 times [2019-12-27 14:35:15,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:35:15,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624396833] [2019-12-27 14:35:15,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:35:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:35:15,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:35:15,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624396833] [2019-12-27 14:35:15,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:35:15,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:35:15,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255091552] [2019-12-27 14:35:15,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:35:15,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:35:15,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:35:15,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:35:15,538 INFO L87 Difference]: Start difference. First operand 15763 states and 45145 transitions. Second operand 4 states. [2019-12-27 14:35:16,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:35:16,045 INFO L93 Difference]: Finished difference Result 20659 states and 59353 transitions. [2019-12-27 14:35:16,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 14:35:16,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 14:35:16,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:35:16,074 INFO L225 Difference]: With dead ends: 20659 [2019-12-27 14:35:16,075 INFO L226 Difference]: Without dead ends: 20383 [2019-12-27 14:35:16,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:35:16,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20383 states. [2019-12-27 14:35:16,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20383 to 18946. [2019-12-27 14:35:16,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18946 states. [2019-12-27 14:35:16,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18946 states to 18946 states and 54434 transitions. [2019-12-27 14:35:16,384 INFO L78 Accepts]: Start accepts. Automaton has 18946 states and 54434 transitions. Word has length 66 [2019-12-27 14:35:16,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:35:16,385 INFO L462 AbstractCegarLoop]: Abstraction has 18946 states and 54434 transitions. [2019-12-27 14:35:16,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:35:16,385 INFO L276 IsEmpty]: Start isEmpty. Operand 18946 states and 54434 transitions. [2019-12-27 14:35:16,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 14:35:16,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:35:16,396 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:35:16,396 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:35:16,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:35:16,397 INFO L82 PathProgramCache]: Analyzing trace with hash -923709139, now seen corresponding path program 1 times [2019-12-27 14:35:16,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:35:16,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636562826] [2019-12-27 14:35:16,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:35:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:35:16,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:35:16,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636562826] [2019-12-27 14:35:16,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:35:16,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 14:35:16,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612651614] [2019-12-27 14:35:16,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 14:35:16,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:35:16,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 14:35:16,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:35:16,527 INFO L87 Difference]: Start difference. First operand 18946 states and 54434 transitions. Second operand 7 states. [2019-12-27 14:35:16,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:35:16,974 INFO L93 Difference]: Finished difference Result 17840 states and 48888 transitions. [2019-12-27 14:35:16,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 14:35:16,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 14:35:16,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:35:16,997 INFO L225 Difference]: With dead ends: 17840 [2019-12-27 14:35:16,997 INFO L226 Difference]: Without dead ends: 17840 [2019-12-27 14:35:16,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-27 14:35:17,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17840 states. [2019-12-27 14:35:17,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17840 to 12474. [2019-12-27 14:35:17,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12474 states. [2019-12-27 14:35:17,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12474 states to 12474 states and 34351 transitions. [2019-12-27 14:35:17,168 INFO L78 Accepts]: Start accepts. Automaton has 12474 states and 34351 transitions. Word has length 66 [2019-12-27 14:35:17,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:35:17,168 INFO L462 AbstractCegarLoop]: Abstraction has 12474 states and 34351 transitions. [2019-12-27 14:35:17,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 14:35:17,169 INFO L276 IsEmpty]: Start isEmpty. Operand 12474 states and 34351 transitions. [2019-12-27 14:35:17,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 14:35:17,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:35:17,175 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:35:17,175 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:35:17,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:35:17,176 INFO L82 PathProgramCache]: Analyzing trace with hash -36205458, now seen corresponding path program 1 times [2019-12-27 14:35:17,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:35:17,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124696293] [2019-12-27 14:35:17,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:35:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:35:17,435 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2019-12-27 14:35:17,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:35:17,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124696293] [2019-12-27 14:35:17,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:35:17,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:35:17,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974165446] [2019-12-27 14:35:17,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:35:17,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:35:17,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:35:17,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:35:17,448 INFO L87 Difference]: Start difference. First operand 12474 states and 34351 transitions. Second operand 5 states. [2019-12-27 14:35:17,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:35:17,503 INFO L93 Difference]: Finished difference Result 4023 states and 9370 transitions. [2019-12-27 14:35:17,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 14:35:17,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 14:35:17,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:35:17,510 INFO L225 Difference]: With dead ends: 4023 [2019-12-27 14:35:17,510 INFO L226 Difference]: Without dead ends: 3350 [2019-12-27 14:35:17,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:35:17,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3350 states. [2019-12-27 14:35:17,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3350 to 3090. [2019-12-27 14:35:17,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3090 states. [2019-12-27 14:35:17,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3090 states to 3090 states and 7076 transitions. [2019-12-27 14:35:17,561 INFO L78 Accepts]: Start accepts. Automaton has 3090 states and 7076 transitions. Word has length 66 [2019-12-27 14:35:17,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:35:17,562 INFO L462 AbstractCegarLoop]: Abstraction has 3090 states and 7076 transitions. [2019-12-27 14:35:17,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:35:17,562 INFO L276 IsEmpty]: Start isEmpty. Operand 3090 states and 7076 transitions. [2019-12-27 14:35:17,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 14:35:17,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:35:17,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:35:17,568 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:35:17,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:35:17,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1721997520, now seen corresponding path program 1 times [2019-12-27 14:35:17,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:35:17,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924980243] [2019-12-27 14:35:17,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:35:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:35:17,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:35:17,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924980243] [2019-12-27 14:35:17,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:35:17,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 14:35:17,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809199572] [2019-12-27 14:35:17,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 14:35:17,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:35:17,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 14:35:17,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:35:17,687 INFO L87 Difference]: Start difference. First operand 3090 states and 7076 transitions. Second operand 7 states. [2019-12-27 14:35:18,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:35:18,360 INFO L93 Difference]: Finished difference Result 3729 states and 8437 transitions. [2019-12-27 14:35:18,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 14:35:18,361 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-27 14:35:18,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:35:18,365 INFO L225 Difference]: With dead ends: 3729 [2019-12-27 14:35:18,366 INFO L226 Difference]: Without dead ends: 3698 [2019-12-27 14:35:18,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-27 14:35:18,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2019-12-27 14:35:18,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3244. [2019-12-27 14:35:18,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3244 states. [2019-12-27 14:35:18,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 7399 transitions. [2019-12-27 14:35:18,400 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 7399 transitions. Word has length 83 [2019-12-27 14:35:18,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:35:18,400 INFO L462 AbstractCegarLoop]: Abstraction has 3244 states and 7399 transitions. [2019-12-27 14:35:18,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 14:35:18,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 7399 transitions. [2019-12-27 14:35:18,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 14:35:18,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:35:18,405 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:35:18,405 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:35:18,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:35:18,405 INFO L82 PathProgramCache]: Analyzing trace with hash -355211823, now seen corresponding path program 1 times [2019-12-27 14:35:18,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:35:18,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093831866] [2019-12-27 14:35:18,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:35:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:35:18,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:35:18,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093831866] [2019-12-27 14:35:18,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:35:18,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:35:18,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120691218] [2019-12-27 14:35:18,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:35:18,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:35:18,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:35:18,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:35:18,529 INFO L87 Difference]: Start difference. First operand 3244 states and 7399 transitions. Second operand 6 states. [2019-12-27 14:35:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:35:18,603 INFO L93 Difference]: Finished difference Result 5448 states and 12508 transitions. [2019-12-27 14:35:18,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 14:35:18,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-27 14:35:18,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:35:18,606 INFO L225 Difference]: With dead ends: 5448 [2019-12-27 14:35:18,607 INFO L226 Difference]: Without dead ends: 2293 [2019-12-27 14:35:18,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 14:35:18,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2019-12-27 14:35:18,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 2293. [2019-12-27 14:35:18,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2293 states. [2019-12-27 14:35:18,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 5257 transitions. [2019-12-27 14:35:18,628 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 5257 transitions. Word has length 83 [2019-12-27 14:35:18,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:35:18,629 INFO L462 AbstractCegarLoop]: Abstraction has 2293 states and 5257 transitions. [2019-12-27 14:35:18,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:35:18,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 5257 transitions. [2019-12-27 14:35:18,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 14:35:18,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:35:18,631 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:35:18,631 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:35:18,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:35:18,632 INFO L82 PathProgramCache]: Analyzing trace with hash 2146119358, now seen corresponding path program 1 times [2019-12-27 14:35:18,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:35:18,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602024683] [2019-12-27 14:35:18,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:35:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:35:18,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:35:18,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602024683] [2019-12-27 14:35:18,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:35:18,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:35:18,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972358778] [2019-12-27 14:35:18,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:35:18,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:35:18,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:35:18,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:35:18,703 INFO L87 Difference]: Start difference. First operand 2293 states and 5257 transitions. Second operand 5 states. [2019-12-27 14:35:18,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:35:18,884 INFO L93 Difference]: Finished difference Result 2016 states and 4506 transitions. [2019-12-27 14:35:18,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 14:35:18,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-12-27 14:35:18,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:35:18,888 INFO L225 Difference]: With dead ends: 2016 [2019-12-27 14:35:18,888 INFO L226 Difference]: Without dead ends: 2016 [2019-12-27 14:35:18,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:35:18,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2016 states. [2019-12-27 14:35:18,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2016 to 1756. [2019-12-27 14:35:18,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1756 states. [2019-12-27 14:35:18,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 3950 transitions. [2019-12-27 14:35:18,916 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 3950 transitions. Word has length 83 [2019-12-27 14:35:18,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:35:18,916 INFO L462 AbstractCegarLoop]: Abstraction has 1756 states and 3950 transitions. [2019-12-27 14:35:18,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:35:18,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 3950 transitions. [2019-12-27 14:35:18,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 14:35:18,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:35:18,919 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:35:18,920 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:35:18,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:35:18,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1743706764, now seen corresponding path program 2 times [2019-12-27 14:35:18,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:35:18,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081956743] [2019-12-27 14:35:18,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:35:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:35:19,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:35:19,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081956743] [2019-12-27 14:35:19,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:35:19,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:35:19,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241121219] [2019-12-27 14:35:19,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:35:19,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:35:19,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:35:19,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:35:19,042 INFO L87 Difference]: Start difference. First operand 1756 states and 3950 transitions. Second operand 6 states. [2019-12-27 14:35:19,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:35:19,245 INFO L93 Difference]: Finished difference Result 1979 states and 4405 transitions. [2019-12-27 14:35:19,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 14:35:19,245 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-27 14:35:19,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:35:19,248 INFO L225 Difference]: With dead ends: 1979 [2019-12-27 14:35:19,248 INFO L226 Difference]: Without dead ends: 1939 [2019-12-27 14:35:19,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:35:19,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-12-27 14:35:19,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1685. [2019-12-27 14:35:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1685 states. [2019-12-27 14:35:19,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 3757 transitions. [2019-12-27 14:35:19,266 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 3757 transitions. Word has length 83 [2019-12-27 14:35:19,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:35:19,266 INFO L462 AbstractCegarLoop]: Abstraction has 1685 states and 3757 transitions. [2019-12-27 14:35:19,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:35:19,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 3757 transitions. [2019-12-27 14:35:19,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 14:35:19,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:35:19,268 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:35:19,269 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:35:19,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:35:19,269 INFO L82 PathProgramCache]: Analyzing trace with hash 474051189, now seen corresponding path program 2 times [2019-12-27 14:35:19,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:35:19,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312101354] [2019-12-27 14:35:19,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:35:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:35:19,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:35:19,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312101354] [2019-12-27 14:35:19,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:35:19,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 14:35:19,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396441930] [2019-12-27 14:35:19,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 14:35:19,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:35:19,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 14:35:19,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-27 14:35:19,388 INFO L87 Difference]: Start difference. First operand 1685 states and 3757 transitions. Second operand 9 states. [2019-12-27 14:35:19,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:35:19,637 INFO L93 Difference]: Finished difference Result 3295 states and 7383 transitions. [2019-12-27 14:35:19,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 14:35:19,638 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-12-27 14:35:19,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:35:19,641 INFO L225 Difference]: With dead ends: 3295 [2019-12-27 14:35:19,641 INFO L226 Difference]: Without dead ends: 1968 [2019-12-27 14:35:19,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-12-27 14:35:19,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2019-12-27 14:35:19,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1738. [2019-12-27 14:35:19,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-12-27 14:35:19,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 3822 transitions. [2019-12-27 14:35:19,660 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 3822 transitions. Word has length 83 [2019-12-27 14:35:19,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:35:19,660 INFO L462 AbstractCegarLoop]: Abstraction has 1738 states and 3822 transitions. [2019-12-27 14:35:19,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 14:35:19,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 3822 transitions. [2019-12-27 14:35:19,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 14:35:19,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:35:19,662 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:35:19,662 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:35:19,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:35:19,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1193195599, now seen corresponding path program 3 times [2019-12-27 14:35:19,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:35:19,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116489701] [2019-12-27 14:35:19,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:35:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 14:35:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 14:35:19,772 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 14:35:19,772 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 14:35:20,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:35:20 BasicIcfg [2019-12-27 14:35:20,034 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 14:35:20,040 INFO L168 Benchmark]: Toolchain (without parser) took 38185.57 ms. Allocated memory was 137.4 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 100.2 MB in the beginning and 1.0 GB in the end (delta: -912.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 14:35:20,041 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 14:35:20,042 INFO L168 Benchmark]: CACSL2BoogieTranslator took 744.87 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 99.8 MB in the beginning and 155.4 MB in the end (delta: -55.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 14:35:20,042 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.56 ms. Allocated memory is still 200.8 MB. Free memory was 155.4 MB in the beginning and 152.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 14:35:20,043 INFO L168 Benchmark]: Boogie Preprocessor took 43.38 ms. Allocated memory is still 200.8 MB. Free memory was 152.7 MB in the beginning and 150.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 14:35:20,050 INFO L168 Benchmark]: RCFGBuilder took 792.04 ms. Allocated memory is still 200.8 MB. Free memory was 150.7 MB in the beginning and 109.9 MB in the end (delta: 40.7 MB). Peak memory consumption was 40.7 MB. Max. memory is 7.1 GB. [2019-12-27 14:35:20,051 INFO L168 Benchmark]: TraceAbstraction took 36527.39 ms. Allocated memory was 200.8 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 109.9 MB in the beginning and 1.0 GB in the end (delta: -902.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 14:35:20,057 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 744.87 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 99.8 MB in the beginning and 155.4 MB in the end (delta: -55.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.56 ms. Allocated memory is still 200.8 MB. Free memory was 155.4 MB in the beginning and 152.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.38 ms. Allocated memory is still 200.8 MB. Free memory was 152.7 MB in the beginning and 150.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 792.04 ms. Allocated memory is still 200.8 MB. Free memory was 150.7 MB in the beginning and 109.9 MB in the end (delta: 40.7 MB). Peak memory consumption was 40.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36527.39 ms. Allocated memory was 200.8 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 109.9 MB in the beginning and 1.0 GB in the end (delta: -902.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L699] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L701] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L703] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L704] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L705] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L706] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L707] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L708] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L709] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L710] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L711] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L712] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L713] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L714] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L715] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L718] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] 0 pthread_t t2567; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] FCALL, FORK 0 pthread_create(&t2567, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L791] 0 pthread_t t2568; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] FCALL, FORK 0 pthread_create(&t2568, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L759] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L760] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L761] 2 x$r_buff0_thd2 = (_Bool)1 [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L733] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 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) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L734] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L735] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L737] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L738] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x = x$flush_delayed ? x$mem_tmp : x [L741] 1 x$flush_delayed = (_Bool)0 [L746] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 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) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] 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 [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L771] 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 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L794] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L800] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 128 locations, 2 error locations. Result: UNSAFE, OverallTime: 36.1s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 14.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6238 SDtfs, 7113 SDslu, 13342 SDs, 0 SdLazy, 5240 SolverSat, 374 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 58 SyntacticMatches, 11 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57888occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.7s AutomataMinimizationTime, 24 MinimizatonAttempts, 59514 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1596 NumberOfCodeBlocks, 1596 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1489 ConstructedInterpolants, 0 QuantifiedInterpolants, 240865 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...